| Date | Syllabus | Homework |
|---|---|---|
| 9/22 | Course Overview | |
| 9/27 | Program, Algorithm & Recursion | |
| 9/29 | Performance Analysis | |
| 10/4 | Advanced Analysis | |
| 10/6 | Arrays | |
| 10/11 | Break | |
| 10/13 | Stacks | |
| 10/18 | Prefix, Infix and Postfix | |
| 10/20 | Queues | |
| 10/25 | Trees | |
| 10/27 | Linked List & Binary Tree Traversal | |
| 11/1 | Binary Search Trees | |
| 11/3 | AVL Trees | |
| 11/8 | Red-Black Trees | |
| 11/10 | Splay Trees | |
| 11/15 | B Trees | |
| 11/17 | B+ and 2-3 Trees | |
| 11/22 | Huffman Tree & Searching | |
| 11/24 | Bubble, Insertion & Tree Sorts | |
| 11/29 | Midterm Exam | |
| 12/1 | Discussion on Midterm | |
| 12/6 | Selection, Merge & Shell Sorts | |
| 12/8 | Quick and Radix Sorts | |
| 12/13 | Binary Heap, Heap Sort & Heap Variants | |
| 12/15 | Undirected & Directed Graphs | |
| 12/20 | Advanced Graphs | |
| 12/22 | Minimum Spanning Trees | |
| 12/27 | Shortest Path Algorithms | |
| 12/29 | Graph Traversal Algorithms | |
| 1/3 | Hash Functions | |
| 1/5 | Collision | |
| 1/10 | Final Exam |