NOTE: The topics on future dates are estimates.
| 1/9/12 | Introduction (Why algorithms, growth rates ) Chapter 1, Coin Changing (program on web page) |
| 1/11/12 | Coin Changing (memioziation), Selection (9.2), Closest Point algorithm (33.4) |
| 1/13/12 | Closest Point algorithm (33.4), |
| 1/16/12 | *** MLK Day, no class *** |
| 1/18/12 | Recurrence Relations: 4.4 recursions trees, simplified master method (Handout 1 on main web page) general version is in 4.5, proof 4.6. |
| 1/20/12 | substitution (4.3), Selection analysis (9.2), Randomized Algorithms. |
| 1/23/12 | Randomized Algorithms: Hiring (5.1), (5.2), Hashing: Intro. Chaining (11.1, 11.2) |
| 1/25/12 | Hashing: Chaining (11.1, 11.2), Expected performance |
| 1/27/12 | Hashing: linear probing, Expected performance Double Hashing (11.4), |
| 1/30/12 | Dynamic Programming: Rod cutting (15.1 ), Subset Sum (Handout 2) |
| 2/1/12 | Dynamic Programming: Subset Sum, LCS 15.4, |
| 2/3/12 | Greedy : Knapsack (16.2), Activity Selection (16.1) |
| 2/6/12 | MIDTERM 1 |
| 2/8/12 | Graphs: representation (22.1), BFS (22.2) |
| 2/10/12 | BFS (22.2) |
| 2/13/12 | DFS (22.3) |
| 2/15/12 | Topological Sort (22.4), SCCs (22.5) |
| 2/17/12 | MST (23.1): Prims, correctness (23.2), on Prim's expected performance |
| 2/20/12 | *** President's day, no class *** |
| 2/22/12 | Shortest paths (24), Bellman Ford (24.1) |
| 2/24/12 | Shortest paths: Dijkstra (24.3), Acycllic shortest paths (24.2) |
| 2/27/12 | MIDTERM 2 |
| 2/29/12 | All Pairs SP: Floyd Warshall (25.2), Network Flows: 26.1,2 |
| 3/2/12 | Network Flow: Ford-Fulkerson (26.2), Applications: Matching (26.3), edge disjoint paths (notes) |
| 3/5/12 | Applications of NF, contd., Data Compression: Huffman codes (16.3), Lempel-Ziv (Handout 4.1) |
| 3/7/12 | Lempel Ziv + Huffman = Gzip (Handout 4.2) |
| 3/9/12 | Easy/hard problems, Class P, Poly verification (34, 34.1, 34.2) |
| 3/12/12 | Class NP, P=NP?, NP Completeness (34.3), reductions: 3SAT reduces to CLIQUE (34.5.1) |
| 3/14/12 | Approximation Algorithms: Vertex cover (35.1) (deterministic) and Max-3-CNF (35.4) (randomized) |
| 3/16/12 | String matching: Naive Exact and Approximate String Matching (Edit distance). (Handout 6) |
| 3/19/12 | Students grade staff, mini-review |
| 3/21/12 | FINAL EXAM, 8-10 am, 226 Wellman |