Tentative Schedule

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

Lec.DateDayTopicAssignments
1Aug 26TIntroduction, Karatsuba/Strassen
2Aug 28ThAsymptotic analysis, recurrences
3Sep 2TIntro to proofs for algorithmsQuiz 1, HW 1 out
4Sep 4ThProbabilistic analysis, randomized quicksort
5Sep 9TLinear time selection/medianQuiz 2
6Sep 11ThSorting: O(n) algorithms and Ω(n log n) lower bound
7Sep 16TBalanced Search TreesQuiz 3, HW 1 due, HW2 out
8Sep 18ThAmortized Analysis
9Sep 23THeapsQuiz 4
10Sep 25ThUnion-Find
11Sep 30TUniversal and Perfect HashingQuiz 5, HW2 due, HW3 out
Oct 1WRecitation 5
12Oct 2ThDynamic Programming I
13Oct 7TDynamic Programming IIQuiz 6
Oct 8WRecitation 6
14Oct 9ThBasic Graph Algorithms I
15Oct 14TBasic Graph Algorithms IIQuiz 7, HW3 due
Oct 15WRecitation 7
Oct 16ThNo Class: Fall break
Oct 21TMidterm Exam
HW4 out
16Oct 23ThSingle-Source Shortest Paths
17Oct 28TAll-Pairs Shortest PathsQuiz 8
18Oct 30ThMinimum Spanning Trees
19Nov 4TMatroids and Greedy AlgorithmsQuiz 9, HW4 due, HW5 out
Nov 5WRecitation 8
20Nov 6ThMax-Flow Min-Cut
21Nov 11TMax-Flow II: Bipartite Matching, Edmonds-KarpQuiz 10
Nov 12WRecitation 9
22Nov 13ThLinear Programming
23Nov 18TNP-Completeness IQuiz 11, HW5 due, HW6 out
Nov 19WRecitation 10
24Nov 20ThNP-Completeness II
Nov 25TNo Class: Thanksgiving break
Nov 27ThNo Class: Thanksgiving break
25Dec 2TAdvanced Topics I
Quiz 12
26Dec 4ThAdvanced Topics II
HW6 due
Dec 16TFinal Exam
9am - 12pm