| Date | Syllabus | Homework |
|---|---|---|
| 9/10 | Course Overview | |
| 9/12 | Algorithms & Recursions | |
| 9/17 | Performance Analysis | |
| 9/19 | Arrays | |
| 9/24 | Moon Festival | |
| 9/26 | Stacks | |
| 10/1 | Stacks & Queues | HW1: Expression Converter |
| 10/3 | Queues | |
| 10/8 | Trees | |
| 10/10 | National Day | |
| 10/15 | Binary Search Trees | |
| 10/17 | AVL Trees | HW2: Binary Search Tree |
| 10/22 | Red-Black, Splay and Hoffman Trees | |
| 10/24 | Multi-way Search Trees | |
| 10/29 | B+ & 2-3 Trees | |
| 10/31 | Searching | |
| 11/5 | Midterm | |
| 11/7 | Bubble, Insertion, Selection & Tree Sorts | |
| 11/12 | Merge, Quick & Radix Sorts | |
| 11/14 | Discussion on Midterm | |
| 11/19 | Heap and Shell Sorts & Comparisons | |
| 11/21 | Undirected & Directed Graphs | HW3: Sorting Algorithms |
| 11/26 | Break for ISCSLP2018 | |
| 11/28 | Break for ISCSLP2018 | |
| 12/3 | Advanced Graphs | |
| 12/5 | Shortest Path Algorithms | |
| 12/10 | Heaps | |
| 12/12 | Hash Functions | HW4: Shortest Path |
| 12/17 | Collision | |
| 12/19 | File Organization | |
| 12/22 | Break! | |
| 12/24 | Final Exam | |
| 12/26 | Break | |
| 12/31 | Bridge Holiday | |
| 1/2 | Discussion on Final Exam |