| Week | Topic |
| 1 | Orientation and Motivation |
| 2 | Basic concepts for data structures, performance analysis, space and time complexity |
| 3 | Representation of multidimensional arrays, matrix representation |
| 4 | Record/struct, list |
| 5 | Linked list |
| 6 | National Holiday |
| 7 | Stack, Queue |
| 8 | Trees, Binary Trees, Binary Search Trees |
| 9 | Midterm Exam |
| 10 | Balanced Trees: AVL , LLRBT |
| 11 | Hash Tables |
| 12 | Graph representation |
| 13 | String, Trie |
| 14 | Priority Queues (Heaps) |
| Final Exam |
| Midterm Exam | 45 |
| Final Exam | 55 |
| Week | Lab | Assignment |
| 1 | Tutorial: Java to C++ Transition | |
| 2 | Tutorial: Java to C++ Transition | |
| 3 | Quiz 0 (no grading) | |
| 4 | Tutorial: Java to C++ Transition | |
| 5 | Tutorial: Java to C++ Transition | PA1: Linked list |
| 6 | Quiz 1 |
|
| 7 | ||
| 8 | Quiz 2 |
PA2: Stack & Queue |
| 9 | ||
| 10 | Quiz
3 |
PA3: Trees |
| 11 | ||
| 12 | Quiz 4 |
|
| 13 | ||
| 14 | Quiz 5 |
| Programming Assignments | 75 |
| Quizes | 25 |
Turning in someone else’s work, in whole or in part, as your own will be considered as a violation of academic integrity. Please note that the former condition also holds for the material found on the web as everything on the web has been written by someone else.
© 2024 Hacettepe University