There is one quiz associated with each lecture (with a few exceptions) and related readings. So, you will typically have two quizzes to complete per week. Each quiz consists of two or three questions, designed to ensure that you understand the basics. All readings refer to Algorithms, 4th edition.
Quiz platform. Quizzes are available online via PrairieLearn. To sign in, use a Google or Microsoft account associated with your netid@princeton.edu email address. Contact the course staff in Ed if you get an "Access Denied" message.
Due dates. Quizzes are due at 11:59pm ET on Saturday evening.
| # | DUE | QUIZ | READINGS |
|---|---|---|---|
|
The quizzes below have not been updated for Fall 2025.
|
|||
| 1 | Saturday 9/6 |
Union-Find Analysis of Algorithms |
1.5 1.4 |
| 2 | Saturday 9/13 |
Stacks and Queues | 1.3 |
| 3 | Saturday 9/20 |
Elementary Sorts Mergesort |
2.1 2.2 |
| 4 | Saturday 9/27 |
Quicksort Priority Queues |
2.3 2.4 |
| 5 | Saturday 10/4 |
Binary Search Trees Balanced Search Trees |
3.2 3.3 |
| 6 | Saturday 10/25 |
Geometric Application of BSTs Hash Tables |
3.4 – |
| 7 | Saturday 11/1 |
Undirected Graphs Directed Graphs |
4.1 4.2 |
| 8 | Saturday 11/8 |
Minimum Spanning Trees ShortestPaths |
4.3 4.4 |
| 9 | Saturday 11/15 |
Maxflow and Mincut | 6.4 |
| 10 | Saturday 11/22 |
Multiplicative Weights Randomness |
– – |