COMS 4231
Fall 2002

Analysis of Algorithms

Professor Cliff Stein

Syllabus (Tentative)

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