| Date | Syllabus | Memo |
|---|---|---|
| 9/1 | Course Overview | |
| 9/3 | Program, Algorithm & Recursion | |
| 9/8 | Performance Analysis | HW0 |
| 9/10 | Advanced Analysis | |
| 9/15 | Arrays and Linked Lists | |
| 9/17 | Stacks | |
| 9/22 | Infix, Prefix and Postfix | Amortized Analysis «Û¾§ |
| 9/24 | Queues | |
| 9/29 | Teachers Day | |
| 10/1 | Trees | HW1 |
| 10/6 | Mid-Autumn Festival | |
| 10/8 | Binary Tree Traversal | |
| 10/13 | Binary Search Trees | Trie Trees «T³Í |
| 10/15 | AVL Trees | |
| 10/20 | 2-3 Trees | HW2 |
| 10/22 | Red-Black Trees | |
| 10/27 | Splay Trees | |
| 10/29 | B Trees | Extended Binary Tree ®a§» |
| 11/3 | B+ Trees & Binary Heaps | |
| 11/5 | Huffman Trees | HW3 |
| 11/10 | Midterm Exam | |
| 11/12 | Searching | |
| 11/17 | Disscusion on Midterm & Bubble, Insertion, Tree and Heap Sorts | |
| 11/19 | Selection, Merge and Radix Sorts | |
| 11/24 | Quick & Shell Sorts | Segment Tree, Fenwick Tree ³ìº· |
| 11/26 | Undirected & Directed Graphs | |
| 12/1 | Graph Representations and Traversal Algorithms | |
| 12/3 | Shortest Path Algorithms | |
| 12/8 | Minimum Spanning Trees | HW4 |
| 12/10 | Hash Functions & Collision | |
| 12/15 | Final Exam |