BAHÇEŞEHİR UNIVERSITY BİLGİ PAKETİ / DERS KATALOĞU
| PERFORMING ARTS | |||||
| Bachelor | TR-NQF-HE: Level 6 | QF-EHEA: First Cycle | EQF-LLL: Level 6 | ||
Course Introduction and Application Information
| Course Code | Course Name | Semester | Theoretical | Practical | Credit | ECTS |
| SEN2211 | Data Structures and Algorithms I | Spring Fall |
2 | 2 | 3 | 7 |
| This catalog is for information purposes. Course status is determined by the relevant department at the beginning of semester. |
Basic information
| Language of instruction: | English |
| Type of course: | Non-Departmental Elective |
| Course Level: | Bachelor’s Degree (First Cycle) |
| Mode of Delivery: | Face to face |
| Course Coordinator : | Dr. Öğr. Üyesi BETÜL ERDOĞDU ŞAKAR |
| Course Lecturer(s): |
Dr. Öğr. Üyesi BETÜL ERDOĞDU ŞAKAR RA MERVE ARITÜRK Prof. Dr. NAFİZ ARICA Instructor DUYGU ÇAKIR YENİDOĞAN RA SEVGİ CANPOLAT |
| Recommended Optional Program Components: | None |
| Course Objectives: | This is an introductory course on common data structures that are used in software engineering. After completing the course, the student will have knowledge of applying, implementing and analysis of basic data structures, including, lists, stacks and queues. Certain fundamental techniques, such as sorting, searching and recursion are also taught. |
Learning Outcomes
|
The students who have succeeded in this course; 1) Describe and apply basic object oriented programming principles. 2) Implement basic data structures such as linked lists, stacks and queues. 3) Analyze the complexity and efficiency of algorithms. 4) Choose and design data structures for writing efficient programs. 5) Implement recursive algorithms. 6) Describe and implement sorting algorithms on common data structures. 7) Describe and implement search algorithms on common data structures. |
Course Content
| The course content is composed of object oriented Java review, the complexity and efficiency of algorithms, introduction to list-stack-queue structures, implementing list-stack-queue structures, recursion, searching algorithms and sorting algorithms. |
Weekly Detailed Course Contents
| Week | Subject | Related Preparation |
| 1) | Introduction to Data Structures and Algorithms Complexity Analysis | |
| 2) | Introduction to Linked Lists | |
| 3) | Doubly Linked Lists Ordered Linked Lists | |
| 4) | ||
| 5) | Stacks | |
| 6) | Stacks for Algebraic Operations | |
| 7) | Queues | |
| 8) | Queues | |
| 9) | Data Structure Classes in Java | |
| 10) | Recursion | |
| 11) | Recursive Complexity | |
| 12) | Searching Algorithms | |
| 13) | Sorting Algorithms | |
| 14) | Sorting algorithms |
Sources
| Course Notes / Textbooks: | Data Structures & Problem Solving Using Java (Mark Allen Weiss) Data Structures and Algorithm Analysis in Java (Mark Allen Weiss) Data Structures and Abstractions with Java (Frank Carrano) |
| References: | Yok |
Evaluation System
| Semester Requirements | Number of Activities | Level of Contribution |
| Laboratory | 4 | % 20 |
| Quizzes | 5 | % 20 |
| Midterms | 1 | % 20 |
| Final | 1 | % 40 |
| Total | % 100 | |
| PERCENTAGE OF SEMESTER WORK | % 60 | |
| PERCENTAGE OF FINAL WORK | % 40 | |
| Total | % 100 | |
ECTS / Workload Table
| Activities | Number of Activities | Workload |
| Course Hours | 14 | 28 |
| Laboratory | 14 | 28 |
| Study Hours Out of Class | 12 | 24 |
| Midterms | 10 | 52 |
| Final | 5 | 32 |
| Total Workload | 164 | |
Contribution of Learning Outcomes to Programme Outcomes
| No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
| Program Outcomes | Level of Contribution | |
| 1) | They acquire theoretical, historical and aesthetic knowledge specific to their field by using methods and techniques related to performing arts (acting, dance, music, etc.). | 2 |
| 2) | They have knowledge about art culture and aesthetics and they provide the unity of theory and practice in their field. | 2 |
| 3) | They are aware of national and international values in performing arts. | 2 |
| 4) | Abstract and concrete concepts of performing arts; can transform it into creative thinking, innovative and original works. | 1 |
| 5) | They have the sensitivity to run a business successfully in their field. | 3 |
| 6) | Develops the ability to perceive, think, design and implement multidimensional from local to universal. | 3 |
| 7) | They have knowledge about the disciplines that the performing arts field is related to and can evaluate the interaction of the sub-disciplines within their field. | 2 |
| 8) | They develop the ability to perceive, design, and apply multidimensionality by having knowledge about artistic criticism methods. | 3 |
| 9) | They can share original works related to their field with the society and evaluate their results and question their own work by using critical methods. | 1 |
| 10) | They follow English language resources related to their field and can communicate with foreign colleagues in their field. | 1 |
| 11) | By becoming aware of national and international values in the field of performing arts, they can transform abstract and concrete concepts into creative thinking, innovative and original works. | 3 |
| 12) | They can produce original works within the framework of an interdisciplinary understanding of art. | 2 |
| 13) | Within the framework of the Performing Arts Program and the units within it, they become individuals who are equipped to take part in the universal platform in their field. | 3 |
| 14) | Within the Performing Arts Program, according to the field of study; have competent technical knowledge in the field of acting and musical theater. | 2 |
| 15) | They use information and communication technologies together with computer software that is at least at the Advanced Level of the European Computer Use License as required by the field. | 3 |