This is a list of readings for the term. The readings are from the required text Algorithm Design by Kleinberg and Tardos, unless otherwise indicated.

Pre-class reading quizzes are due online on Canvas at 11:00 PM on the given due date.  They aim to provide a light assessment of your understanding of the textbook material after an initial reading. You’ll also find it helpful to refer back to these readings in completing the assignments and studying for the exams.

The exact content of the readings and/or quiz due dates may change slightly, but not drastically.

Topic Assigned Readings Quiz Due Date
Intro and SMP Chapter 1, plus the USMP worked example video July 4
Asymptotic Analysis Chapter 2 July 7
Graphs Chapter 3, sections 3.1-3.6 July 7
Greedy Algorithms Part 1 Chapter 4, sections 4.1-4.2 July 11
Greedy Algorithms Part 2 Chapter 4, sections 4.4, 4.5, 4.7 July 14
Divide and Conquer Chapter 5, sections 5.1-5.3, plus the Master Theorem on Wikipedia July 18
Dynamic Programming Part 1 Chapter 6, sections 6.1-6.3 July 21
Dynamic Programming Part 2 Chapter 6, sections 6.4, 6.6 July 25
NP-Completeness Part 1 Chapter 8, sections 8.1, 8.3, 8.4, plus a quick skim of 8.10 July 28
NP-Completeness Part 2 Chapter 8.5, plus a complete read of 8.10 August 1