In precept, we will work out practice problems that are similar in spirit to those on the problem sets.
| # | DATE | TOPIC | HANDOUT |
|---|---|---|---|
| 1 | Friday 2/9 Monday 2/12 |
Stable matchings Asymptotic notation |
Precept 1 |
| 2 | Friday 2/16 Monday 2/19 |
Greedy algorithms | Precept 2 |
| 3 | Friday 2/23 Monday 2/26 |
Shortest paths MSTs |
Precept 3 |
| 4 | Friday 3/2 Monday 3/5 |
MSTs Min-cost arborescences |
Precept 4 |
| 5 | Friday 3/9 Monday 3/12 |
Divide-and-conquer | Precept 5 |
| 6 | Friday 3/30 Monday 4/2 |
Fast matrix multiplication Dynamic programming |
Precept 6 |
| 7 | Friday 4/6 Monday 4/9 |
Dynamic programming Edit distance |
Precept 7 |
| 8 | Friday 4/13 Monday 4/16 |
Bellman–Ford Maximum flow |
Precept 8 |
| 9 | Friday 4/20 Monday 4/23 |
Maximum flow | Precept 9 |
| 10 | Friday 4/27 Monday 4/30 |
Maximum flow Poly-time reductions |
Precept 10 |
| 11 | Friday 5/4 Monday 5/7 |
Poly-time reductions NP-completeness |
Precept 11 |
Solutions. Solutions to precept problems are not provided here. You are welcome to ask questions in office hours or on Piazza.