There is one quiz each week, covering that week’s lectures and related readings. Each quiz typically includes 2–3 questions per lecture, with a few exceptions. The questions are designed to check your understanding of the basic concepts.
Quiz platform. Quizzes are available via PrairieLearn. Select “Princeton University (princeton.edu)” and use your NetID and password for Princeton CAS authentication. Contact the course staff on Ed if you cannot access the quizzes.
Readings. All readings refer to Algorithms, 4th edition.
Due dates. Quizzes are due at 11:59pm ET on Saturday evenings.
| # | DUE | QUIZ | READINGS |
|---|---|---|---|
| 1 | Saturday 9/5 |
Course Policies | – |
| 2 | Saturday 9/12 |
Union-Find Analysis of Algorithms |
1.5 1.4 |
| 3 | Saturday 9/19 |
Stacks and Queues I Stacks and Queues II |
1.3 |
|
The quizzes below have not been updated for Fall 2026.
|
|||
| 4 | Saturday 9/26 |
Elementary Sorts Mergesort |
2.1 2.2 |
| 5 | Saturday 10/3 |
Quicksort Priority Queues |
2.3 2.4 |
| 6 | Saturday 10/10 |
Binary Search Trees Balanced Search Trees |
3.2 3.3 |
| 7 | Saturday 10/17 |
Hash Tables | 3.4 |
| 8 | Saturday 10/31 |
Geometric Applications of BSTs Undirected Graphs |
– 4.1 |
| 9 | Saturday 11/7 |
Directed Graphs Minimum Spanning Trees |
4.2 4.3 |
| 10 | Saturday 11/14 |
Shortest Paths | 4.4 |
| 11 | Saturday 11/21 |
Reductions Intractability |
– – |
| 12 | Saturday 12/5 |
Multiplicative Weights | – |