Unless otherwise noted, ASSIGNMENT items are due via Moodle by 5:00PM on the listed date. Read the READ items before class and post reading reactions on Slack by 11:59PM on the day the reading is listed.
M Mar 25
- No reading reactions required for today's readings. But read them anyway!
- [TASK] Slack setup
- [READ] Course information.
- [READ] Preface from Kleinberg & Tardos, up through the middle of page xvi (i.e., the end of "Problems and Solved Exercises").
- Class notes
T Mar 26
- [ASSIGNMENT CHECKPOINT] Problem set #1
W Mar 27
- [READ] Sections 2.1, 2.2, and 2.4 from K&T. Reading reaction hashtag: #reading1. This is fairly long, but should be mostly review.
- Class notes
F Mar 29
- [ASSIGNMENT] Problem set #1.
- [WORKSHEET] Questions about asymptotics
- [READ] Why Proofs? Reading reaction (#reading2) due Sunday, not today.
- Class notes
M Apr 1
- [READ] Section 1.1 of K&T up through the section entitled "Designing the Algorithm" (#reading3)
- [READ] Layla's proof-writing tips & tricks (you may but don't have to react on Slack to this one).
- Class notes
T Apr 2
- [ASSIGNMENT CHECKPOINT] Problem set #2 (tex source)
W Apr 3
- [READ] The rest of section 1.1 of K&T, plus section 2.3 (#reading4)
- Class notes
- Slides
F Apr 5
- [ASSIGNMENT] Problem set #2 (tex source)
- [READ] A 2015 article about the National Resident Matching Program (#reading5)
- [READ, Optional] If you're interested in exploring the notion of fairness in matching problems, here's an interesting paper from 1987. No reading reaction required (but of course, react away if you want).
- Class notes
M Apr 8
- [READ] Sections 3.1 and 3.2 of K&T (#reading6)
- Class notes
- Slides
T Apr 9
- [ASSIGNMENT CHECKPOINT] Problem set #3 (tex source)
W Apr 10
- [READ] Section 3.3, the preamble to Chapter 4, and Section 4.1 of K&T (#reading7)
- We'll discuss the upcoming exam contents and some study guidance in class.
- This is Layla's exam review guide
- Class notes
- Slides
F Apr 12
- [ASSIGNMENT] Problem set #3 (tex source)
- Class notes
- Slides
M Apr 15
- In-class exam
W Apr 17
F Apr 19
- [ASSIGNMENT] Problem set #4
- [READ] Section 4.4 of K&T (#reading8)
- Class notes
- Slides
M Apr 22
- [READ] Section 4.5 of K&T (#reading9)
- Class notes
- Slides
T Apr 23
- [ASSIGNMENT CHECKPOINT] Problem set #5
W Apr 24
- [READ] Section 4.6 of K&T; Wikipedia on priority queues (stopping after Usual Implementations); and Wikipedia on heaps (stopping after "Implementation"). (#reading10)
- Class notes
- Slides
F Apr 26
- [ASSIGNMENT] Problem set #5
- Class notes
- Slides
M Apr 29
- Midterm break. Sweet dreams!
T Apr 30
- [ASSIGNMENT CHECKPOINT] Problem set #6
W May 1
- [READ] Chapter 5 preamble and Section 5.1 of K&T. Also, Theorem 6.21 of David Liben-Nowell's Connecting Discrete Mathematics and Computer Science (#reading11)
- Class notes
- Slides
F May 3
- [ASSIGNMENT] Problem set #6
- Layla's exam 2 review guide