|
|
| COM2005 | Data Structures | 3+0+0 | ECTS:4 | | Year / Semester | Fall Semester | | Level of Course | First Cycle | | Status | Compulsory | | Department | DEPARTMENT of COMPUTER ENGINEERING | | Prerequisites and co-requisites | DC must have been achieved from COM1002-Programming - II or DC must have been achieved from COM1000-Introduction To Computer Programming | | Mode of Delivery | Face to face | | Contact Hours | 14 weeks - 3 hours of lectures per week | | Lecturer | Öğretim Görevlisi Ömer ÇAKIR | | Co-Lecturer | None | | Language of instruction | | | Professional practise ( internship ) | None | | | | The aim of the course: | | Give information about data structures, analyse some data structures, assist on selecting the optimal data structure and introducing data structure types. |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | Analyze a given algorithm and determine its complexity. | 1,2,12 | 1 | | LO - 2 : | Define abstract data structures such as linked lists, stacks, queues, heaps and trees. | 1,2,12 | 1 | | LO - 3 : | Determine which data structure to be used to solve a given problem and write the program. | 1,2,12 | 1 | | 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 | | |
| A C++ Primer, 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, Maps, and Skip Lists, 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 | A C++ Primer | | | 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 | Mid-term exam | | | Week 9 | Heaps and Priority Queues | | | 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 | | | |
| 1 | Goodrich, M. 2011; Data Structures and Algotihms in C , USA | | | |
| 1 | Dersin web sayfası : http://ceng2.ktu.edu.tr/~cakir/veri_yapilari.html | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | 23/11/2012 | 1,5 | 50 | | End-of-term exam | 16 | 10/01/2013 | 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 | 3 | 15 | 45 | | Sınıf dışı çalışma | 4 | 15 | 60 | | Arasınav için hazırlık | 6 | 1 | 6 | | Arasınav | 2 | 1 | 2 | | Dönem sonu sınavı için hazırlık | 5 | 2 | 10 | | Dönem sonu sınavı | 2 | 1 | 2 | | Total work load | | | 125 |
|