| Date | Topic | Reference |
|---|---|---|
| Tue Sep 2 | Introduction to CPS130 (1) (postscript) | Ch. 1, 29.3, 29.4 |
| Thu Sep 4 | Introduction to Algorithm Analysis (2) (postscript) | Ch. 2.2, 4, 33.1, 33.2 |
| Tue Sep 9 | Asymptotic Growth (3) (postscript) | Ch. 33.2, 2.1 |
| Thu Sep 11 | Master Method (4) (postscript) | Ch. 4.1, 4.2, 4.3 |
| Tue Sep 16 | Sorting (5) (postscript) | Ch. 1.2, 1.3, 8.1, 8.2 |
| Thu Sep 18 | Analysis of Quicksort (6) (postscript) | Ch. 6.1, 6.2, 8.2, 8.3, 8.4 |
| Tue Sep 23 | Computing Statistics (7) (postscript) | Ch. 10 |
| Thu Sep 25 | Heaps (8) (postscript) | Ch. 7 |
| Tue Sep 30 | Binary Search Trees (9) (postscript) | Ch. 13.1, 13.2, 13.3 |
| Thu Oct 2 | Review | - |
| Tue Oct 7 | Exam 1: Putting Things in Order | |
| Thu Oct 9 | Splay Trees (10) (postscript) | Ch. 18.1, 18.2 |
| Tue Oct 14 | Fall Break | - |
| Thu Oct 16 | Hashing (11) (postscript) | Ch. 12 |
| Tue Oct 21 | Analysis of Hashing (12) (postscript) | Ch. 12 |
| Thu Oct 23 | Stable Marriage (13) (postscript) | - |
| Tue Oct 28 | String Matching (14, Greg Keim) (postscript) | Ch. 34.1, 34.5, 34.3, 34.4 |
| Thu Oct 30 | Matrix Algorithms (15, Hai Shao) (postscript) | Ch. 31.1, 31.4 |
| Tue Nov 4 | Graph Algorithms (16) (postscript) | Ch. 23 |
| Thu Nov 6 | Bipartite Matching (17) (postscript) | Ch. 27.2, 27.3 |
| Tue Nov 11 | Weighted Graphs (18) (postscript) | Ch. 27.2, 24 |
| Thu Nov 13 | Computing Minimum Spanning Trees (19) (postscript) | Ch. 24.2, 22 |
| Tue Nov 18 | Review | - |
| Thu Nov 20 | Exam 2: Graphs and Stuff | |
| Tue Nov 25 | Shortest Paths (20) (postscript) | Ch. 25.1, 25.2 |
| Thu Nov 27 | Thanksgiving | - |
| Tue Dec 2 | Dynamic Programming: Segmentation (21) (postscript) | Ch. 16.1, 16.2 |
| Thu Dec 4 | Dynamic Programming: LCS (22) (postscript) | Ch. 16.3 |
| Tue Dec 9 | Complexity (23) (postscript) | Ch. 36.1, 36.2, 36.4, 37.3 |
| Thu Dec 11 | Traveling Salesperson (24) (postscript) | Ch. 36.5.5, 37.2 |
| Mon Dec 15 | Final Exam (9am-noon) | |