Tentative Schedule

This schedule is very preliminary: the number of lectures and order of the topics are likely to change.

Lec. Date Day Topic Notes
1 Sep 1 Th Introduction, Karatsuba/Strassen
[Lecture notes | CLRS 1, 2, 4.2]
2 Sep 6 T Asymptotic analysis, recurrences
[Lecture notes | CLRS 3, 4]
HW1 out
Prof. Dinitz out of town
3 Sep 8 Th Probabilistic analysis, randomized quicksort
[Lecture notes | CLRS 5, 7, Appendix C]
Prof. Dinitz out of town
4 Sep 13 T Linear time selection/median
[Lecture Notes | CLRS 9]
HW1 due, HW2 out
5 Sep 15 Th Sorting: O(1) algorithms and Ω(n log n) lower bound
[Lecture Notes | CLRS 8]
6 Sep 20 T Balanced Search Trees
[Lecture Notes | CLRS 12, 13, 18]
HW2 due, HW3 out
7 Sep 22 Th Amortized Analysis
[Lecture Notes | CLRS 17]
8 Sep 27 T Splay Trees
[Lecture Notes]
HW3 due, HW4 out
9 Sep 29 Th Universal and perfect hashing
[Lecture Notes from CMU | CLRS 11]
10 Oct 4 T Union-Find
[Lecture Notes | CLRS 21]
HW4 due, HW5 out
11 Oct 6 Th Dynamic Programming I
[Lecture Notes | CLRS 15]
12 Oct 11 T Dynamic Programming II
[Lecture Notes | CLRS 15]
HW5 due, HW6 out
13 Oct 13 Th BFS, DFS, topological sort, strongly-connected components
[Lecture Notes | CLRS 22]
14 Oct 18 T Shortest Paths
[Lecture Notes | CLRS 24, 25]
HW6 due
Oct 20 Th No Class (Monday schedule)
Oct 25 T Midterm
 HW7 out
15 Oct 27 Th Minimum Spanning Trees
[Lecture Notes | CLRS 23]
16 Nov 1 T Matroids and Greedy Algorithms
[Lecture Notes | CLRS 16.4]
 HW7 due, HW8 out
17 Nov 3 Th Max-Flow Min-Cut
[Lecture Notes from Avrim Blum | CLRS 26]
18 Nov 8 T Max-Flow: Edmonds-Karp
[Lecture Notes from Avrim Blum | CLRS 26]
 HW8 due, HW9 out
19 Nov 10 Th Linear Programming I
[Lecture Notes from Avrim Blum | CLRS 29.1, 29.2]
20 Nov 15 T Linear programming II: Duality
[Lecture Notes from CMU | Lecture Notes from 600.669 | CLRS 29.4]
 HW9 due, HW10 out
21 Nov 17 Th NP-completeness I
[Lecture Notes | CLRS 34]
HW8 due, HW9 out
Nov 22 T No Class: Thanksgiving break
Nov 24 Th No Class: Thanksgiving break
22 Nov 29 T NP-completeness II
[Lecture Notes from Avrim Blum | CLRS 34]
HW10 due, HW11 out
23 Dec 1 Th Approximation algorithms
[Lecture Notes | CLRS 35]
24 Dec 6 T Online algorithms
[Lecture Notes from Avrim Blum]
HW11 due
25 Dec 8 Th Machine Learning Theory
[Lecture Notes]
Dec 18 2pm-5pm Final Exam