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 9/7 Introduction and Stable Matching Chapter 1
Dis 01 9/8 Fourth Hour
2 Lec 02 9/12 Running-Time and Big-O Chapter 2.1, 2.2
Lec 03 9/14 Running-Time and Big-O
Dis 02 9/15 Fourth Hour
3 Lec 04 9/19 Running-Time and Big-O
Lec 05 9/21 Big-Omega and Theta / Graphs Chapter 3.1, 3.2
Dis 03 9/22 Fourth Hour
4 Lec 06 9/26 Graphs Chapter 3.2
Lec 07 9/28 Graphs Chapter 3.3, 3.4
Dis 04 9/29 Fourth Hour
5 10/3 MOUNTAIN DAY – NO CLASS
Lec 08 10/5 Graphs Chapter 3.5, 3.6
Dis 05 10/6 Fourth Hour
6 10/10 FALL BREAK – NO CLASS
Lec 09 10/12 Greedy Chapter 4.1
Dis 06 10/13 Fourth Hour
7 Lec 10 10/17 Greedy Chapter 4.2
Lec 11 10/19 Greedy Chapter 4.4
Dis 07 10/20 Fourth Hour
8 Lec 12 10/24 Greedy Chapter 4.5-4.6
Lec 13 10/26 MST wrap-up / Union-Find
10/27 Fourth Hour (CANCELED)
9 Lec 14 10/31 Divide and Conquer Chapter 5.1, 5.2
Lec 15 11/2 Divide and Conquer Chapter 5.4
Dis 08 11/3 Fourth Hour
10 Lec 16 11/7 Dynamic Programming Chapter 6.1, 6.2
Lec 17 11/9 Dynamic Programming Chapter 6.3
Dis 09 11/10 Fourth Hour
11 Lec 18 11/14 Dynamic Programming Chapter 6.4
Lec 19 11/16 Dynamic Programming Chapter 6.8
Dis 10 11/17 Fourth Hour
12 Lec 20 11/21 Network Flow Chapter 7.1
11/23 THANKSGIVING — NO CLASS
11/24 THANKSGIVING — NO FOURTH HOUR
13 Lec 21 11/28 Network Flow Chapter 7.2
Lec 22 11/30 Network Flow Chapter 7.5, 7.10
Dis 11 12/1 Fourth Hour
14 Lec 23 12/5 Intractability (guest lecture) Chapter 8.1
Lec 24 12/7 Intractability (guest lecture) Chapter 8.2
Dis 12 12/8 Fourth Hour
15 Lec 25 12/12 Intractability Chapter 8.3