Homework

Exams

Schedule

Here is an approximate schedule for the course. This is subject to change and will be updated as we go. Slides will be added after class—links will be broken until they are added. Note that lectures will include a mixture of slides and board work, and material presented on the board is not necessarily reflected in the slides. Another set of slides that roughly matches the material we cover can be found here.

Week Date Topic Reading and Background
1 Lec 01 1/24 Introduction and Stable Matching Chapter 1
Dis 01 1/26 Fourth Hour
2 Lec 02 1/29 Running-Time and Big-O Chapter 2.1, 2.2
Lec 03 1/31 Running-Time and Big-O
Dis 02 2/2 Fourth Hour
3 Lec 04 2/5 Running-Time and Big-O
2/7 NO CLASS DUE TO SNOW
Dis 03 2/9 Fourth Hour
4 Lec 05 2/12 Graphs Chapter 3.1, 3.2
Lec 06 2/14 Graphs Chapter 3.3, 3.4
Dis 04 2/16 Fourth Hour
5 Lec 07 2/19 Graphs Chapter 3.5, 3.6
Lec 08 2/21 Greedy Chapter 4.1
Dis 05 2/23 Fourth Hour
6 Lec 09 2/26 Greedy Chapter 4.2
Lec 10 2/28 Greedy Chapter 4.4
Dis 06 3/2 Fourth Hour
7 Lec 11 3/5 Greedy Chapter 4.5-4.6
3/7 NO CLASS DUE TO SNOW
Dis 07 3/9 Fourth Hour
SPRING BREAK
8 Lec 12 3/19 MST Wrap-Up
Lec 13 3/21 Divide and Conquer Chapter 5.1, 5.2
Lec 14 3/23 Recurrences
9 3/26 Group work led by TAs
Lec 15 3/28 Divide and Conquer Chapter 5.4
3/30 Fourth Hour (canceled)
10 Lec 16 4/2 Dynamic Programming Chapter 6.1, 6.2
Lec 17 4/4 Dynamic Programming Chapter 6.3
4/6 Fourth Hour (canceled)
11 Lec 18 4/9 Dynamic Programming Chapter 6.4
Lec 19 4/11 Dynamic Programming Chapter 6.8
Dis 08 4/13 Fourth Hour
12 Lec 20 4/16 Network Flow Chapter 7.1
Lec 21 4/18 Network Flow Chapter 7.2
Dis 09 4/20 Network Flow Chapter 7.5, 7.10
13 Lec 22 4/23 Intractability Chapter 8.1
Lec 23 4/25 Intractability Chapter 8.2
Dis 13 4/27 Fourth Hour
14 Lec 24 4/30 Intractability Chapter 8.3, 8.4?