| Date | Syllabus | Memo |
|---|---|---|
| 9/7 | Course Overview | |
| 9/9 | Program, Algorithm & Recursion | |
| 9/14 | Performance Analysis | HW0 |
| 9/16 | Advanced Analysis | |
| 9/21 | Arrays and Linked Lists | |
| 9/23 | Stacks | |
| 9/28 | Break | Teachers Day |
| 9/30 | Queues | |
| 10/5 | Infix, Prefix and Postfix | |
| 10/7 | Trees | |
| 10/12 | Binary Tree Traversal | |
| 10/14 | Binary Search Trees | |
| 10/19 | AVL Trees | |
| 10/21 | 2-3 Trees | |
| 10/26 | Break | |
| 10/28 | Red-Black Trees | |
| 11/2 | B Trees | |
| 11/4 | B+ Trees & Binary Heaps | |
| 11/9 | Splay Trees | |
| 11/11 | Huffman Trees | |
| 11/16 | Midterm | |
| 11/18 | Bubble, Insertion, Tree and Heap Sorts | |
| 11/23 | Selection and Merge Sorts | |
| 11/25 | Searching | Disscussion on Midterm |
| 11/30 | Radix, Quick & Shell Sorts | |
| 12/2 | Undirected & Directed Graphs | |
| 12/7 | Minimum Spanning Trees | |
| 12/9 | Graph Representations and Traversal Algorithms | |
| 12/14 | Shortest Path Algorithms | |
| 12/16 | Hash Functions & Collision | |
| 12/21 | Final Exam |