| # | Topic Description | Syllabus |
|---|---|---|
| 1 | (1)Introduction and arrays | |
| 2 | Array 2 and Stack 1 | |
| 3 | Stack 2 | |
| 4 | Queue | |
| 5 | Priority and circular queue | |
| 6 | Linked list-intro | |
| 7 | linked list-types | |
| 8 | linked list-application | |
| 9 | Stack and Queue with linked list | |
| 10 | Sparse matrix implementation with linked list | |
| 11 | Midterm | |
| 12 | Tree | |
| 13 | tree-types, implementation | |
| 14 | binary tree | |
| 15 | Arithmetic expression and binary tree | |
| 16 | binary search tree | |
| 17 | AVL/Heap | |
| 18 | Tree Traversal | |
| 19 | Threaded tree | |
| 20 | tree-application | |
| 21 | sorting -1 | |
| 22 | sorting -2 | |
| 23 | Search | |
| 24 | ||
| 25 | ||
| 26 |