|
|
| YZM1010 | Data Structures | 2+2+0 | ECTS:5 | | Year / Semester | Spring Semester | | Level of Course | First Cycle | | Status | Compulsory | | Department | DEPARTMENT of SOFTWARE ENGINEERING | | Prerequisites and co-requisites | None | | Mode of Delivery | | | Contact Hours | 14 weeks - 2 hours of lectures and 2 hours of practicals per week | | Lecturer | Dr. Öğr. Üyesi Asuman GÜNAY YILMAZ | | Co-Lecturer | DOCTOR LECTURER Asuman GÜNAY YILMAZ, | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | Give information about data structures,Analyze some data structure, To help select the appropriate data structure for programing. |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | Define the notions of time and space complexity. | 3,4,5 | 1,4, | | LO - 2 : | Analyze a given algorithm and determine its complexity. | 3,4,5 | 1,4, | | LO - 3 : | Define abstract data structures (types) such as linked lists, stacks, queues, heaps and trees. | 3,4,5 | 1,4, | | LO - 4 : | Design an algorithm to solve a given problem. | 3,4,5 | 1,4, | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), LO : Learning Outcome | | |
| The foundations of Java, Object-Oriented Programming, Arrays, Linked Lists, and Recursion, Analysis Tools, Stacks, Queues, and Deques, List and Iterator ADTs, Trees, Heaps and Priority Queues, Hash Tables, Search Trees, Sorting, Sets, and Selection, Strings and Dynamic Programming, Graph Algorithms, Memory Management and B-Trees. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | The foundations of Java | | | Week 2 | Object-Oriented Programming | | | Week 3 | Arrays, Linked Lists, and Recursion | | | Week 4 | Analysis Tools | | | Week 5 | Stacks, Queues, and Deques | | | Week 6 | List and Iterator ADTs | | | Week 7 | Trees | | | Week 8 | Heaps and Priority Queues | | | Week 9 | Midterm exam | | | Week 10 | Hash Tables, Maps, and Skip Lists | | | Week 11 | Search Trees | | | Week 12 | Sorting, Sets, and Selection | | | Week 13 | Strings and Dynamic Programming | | | Week 14 | Graph Algorithms | | | Week 15 | Memory Management and B-Trees | | | Week 16 | End of term exam | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | | 2 | 30 | | Practice | 15 | | 1 | 20 | | End-of-term exam | 16 | | 2 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Yüz yüze eğitim | 4 | 14 | 56 | | Sınıf dışı çalışma | 3 | 14 | 42 | | Laboratuar çalışması | 0 | 0 | 0 | | Arasınav için hazırlık | 1 | 8 | 8 | | Arasınav | 2 | 1 | 2 | | Uygulama | 2 | 14 | 28 | | Klinik Uygulama | 0 | 0 | 0 | | Ödev | 0 | 0 | 0 | | Proje | 0 | 0 | 0 | | Kısa sınav | 0 | 0 | 0 | | Dönem sonu sınavı için hazırlık | 2 | 6 | 12 | | Dönem sonu sınavı | 2 | 1 | 2 | | Diğer 1 | 0 | 0 | 0 | | Diğer 2 | 0 | 0 | 0 | | Total work load | | | 150 |
|