Please note that this schedule is my prediction of the pace at which we will be able to move through topics, but reality may differ from this prediction. The schedule will evolve to adjust to the real pace as the semester progresses.
In the reading column, an entry such as A1.1 indicates Section 1 of Appendix 1, A2 indicates the entire Appendix 2, and 1.1 indicates Section 1 in Chapter 1. Sometimes I have indicated an ending page number, such as 2.2–p.24. In those cases, you should read up through the indicated page, though if the page ends with a transitional paragraph, you needn't concern yourself with it.
| Date | Reading | Topic | Homework |
|---|---|---|---|
| 9/2 | The Shortest Path Problems | ||
| 9/4 | Dijkstra's Shortest Path Algorithm | ||
| 9/5 | 2.2–p.24, p.27–28, note (pdf) | Machine Models, Complexity analysis | |
| 9/8 | 2.1 (p.20–22) (txt), 3.1, note (pdf) | Pseudocode, Asymptotics | |
| 9/9 | 2.1–p.20, 2.2, note (pdf) | Insertion Sort | |
| 9/11 | Insertion Sort (continued) | ||
| 9/12 | note (pdf) | SSUM | |
| 9/15 | note (pdf) | TSP | |
| 9/16 | 10.4, B.5.2–B.5.3, note (pdf) | Binary Trees | |
| 9/18 | 6, note (pdf) | Heaps, priortity queues, heapsort | |
| 9/19 | 12.1–12.3, 13.2, notes (pdf and pdf) | BST and rotations | hw1 |
| 9/22 | 13.1, note (pdf) | RB Trees | |
| 9/23 | 13.3, note (pdf) | RBT insertion | |
| 9/25 | 13.4, note (pdf) | RBT deletion | |
| 9/26 | note (pdf) | Splay trees | |
| 9/29 | note (pdf) | Augmented BST | |
| 9/30 | Catch-up | ||
| 10/2 | Review | hw2 | |
| 10/3 | Test 1 | ||
| 10/6 | note (pdf) | Set Theory Review & Recurrences | |
| 10/7 | NO CLASS (Nobel Conference) | ||
| 10/9 | note (pdf) | Flight Problem | |
| 10/10 | 15.1, note (pdf) | Rod Cutting | |
| 10/13 | note (pdf) | Subset Sum Revisited | |
| 10/14 | note (pdf) | SSUM variant & Knapsack Problem | |
| 10/16 | 15.4, note (pdf) | Longest Common Subsequence (LCS) | |
| 10/17 | p.405, note (pdf) | Longest Increasing Subsequence | hw3 |
| 10/20 | No class (reading day) | ||
| 10/21 | No class (reading day) | ||
| 10/23 | 15.2, note (pdf) | Matrix Chain Multiplication | |
| 10/24 | notes (pdf) and (pdf) | Activity Scheduling, Chemical Storage | |
| 10/27 | note (pdf) | Huffman Codes | |
| 10/28 | continued | ||
| 10/30 | Review | ||
| 10/31 | Test 2 | hw4 | |
| 11/3 | B.4, note (pdf) | Graph Theorey Review | |
| 11/4 | 22.1, note (pdf) | Data Structures for Graphs | |
| 11/6 | 22.3, note (pdf) | Depth-first search (DFS) | |
| 11/7 | DFS continued | ||
| 11/10 | 22.4, note (pdf) | Algorithms on DAGS | |
| 11/11 | Algorithms on DAGS (continued) | ||
| 11/13 | 22.5, note (pdf) | Path-based dfs for strong components | |
| 11/14 | Path-based dfs (continued) | ||
| 11/17 | 22.2, note (pdf) | Breadth-first search | |
| 11/18 | 23.2 | Prim's alg | |
| 11/20 | 23.2 | Kruskal alg | |
| 11/21 | 24.3 | Dijkstra's shortest-path alg | |
| 11/24 | p.798-800, note (pdf) | Binary Search | |
| 11/25 | Extra Office Hour | hw5 | |
| 11/27 | No class (Thanksgiving) | ||
| 11/28 | No class (Thanksgiving) | ||
| 12/1 | 4, note (pdf) | Master Theorem | |
| 12/2 | note (pdf) | Integer Multiplication | |
| 12/4 | p.79-83, note | Strassen's Matrix Multiplication | |
| 12/5 | 31 | Number-theoretic Algorithms | |
| 12/8 | 31 | Number-theoretic Algorithms (continued) | |
| 12/9 | 35.1, note | Vertex Cover | |
| 12/11 | Metric TSP | hw6 | |
| 12/12 | Review; evaluation | ||