Class Number | Date | Topics | Reading | HW Assigned | HW Due |
---|---|---|---|---|---|
1 | 9/7 | Introduction, Strassen's Matrix Multiplication Algorithm | Skim CLRS 1-3 , 28.2 | ||
2 | 9/12 | Recurrences and asymptotic notation | CLRS 4 | HW 1 | |
3 | 9/14 | Heapsort, Loop invariants, Lower bounds for sorting | CLRS 6, 7, 8.1 | ||
4 | 9/19 | Counting Sort, Radix Sort, Deterministic Selection | CLRS 8.2-8.3, 9.1, 9.3 | ||
5 | 9/21 | Randomized Algorithms, | CLRS 5 | HW 2 | HW 1 |
6 | 9/26 | Indicator Random Variables | |||
7 | 9/28 | Quicksort, Randomized Selection | CLRS 7, 9.2 | ||
8 | 10/3 | Skip Lists | Read this paper | ||
10/7 (no class on 10/5) | HW 3 | HW 2 | |||
9 | 10/10 | Augmenting Data Structures | CLRS 13, 14 | ||
10 | 10/12 | Dynamic Programming | CLRS 15 | ||
11 | 10/17 | Dynamic Programming | CLRS 15 | ||
12 | 10/19 | Greedy Algorithms | CLRS 16 | HW 4 | HW 3 |
13 | 10/24 | Greedy Algorithms/Amortized Analysis | CLRS 16, 17 | ||
14 | 10/26 | Amortized Analysis | CLRS 17 | ||
15 | 10/31 | Disjoint Sets | CLRS 21 | Midterm out | HW 4 |
16 | 11/2 | Graph Algorithms, BFS, DFS, Topological Sort | CLRS 22.1-22.4 | HW 5 | |
11/4 | Midterm due | ||||
17 | 11/9 | Strongly Connected Components, Minimum Spanning Trees | CLRS 22.5, CLRS 23 | ||
18 | 11/14 | Single-source shortest paths, relaxation, Bellman-Ford | CLRS 24.1, 24.5 | ||
19 | 11/16 | Shortest paths in dags, Dijkstra's algorithm | CLRS 24.2-24.3 | HW 6 | HW 5 |
20 | 11/21 | All pairs shortest paths | CLRS 25 | ||
21 | 11/23 | NP-completeness | CLRS 34 | ||
22 | 11/28 | NP-completeness | CLRS 34 | ||
23 | 11/30 | NP-completeness | CLRS 34 | HW 7 | HW 6 |
24 | 12/5 | Approximation Algorithms | CLRS 35 | ||
25 | 12/7 | Approximation Algorithms | CLRS 35 | ||
26 | 12/12 | Additional topics | CLRS 26 | HW 7 | |
TBD | Final |