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 |
|---|---|---|---|
| 1 | Saturday 2/1 |
Union-Find Analysis of Algorithms |
1.5 1.4 |
| 2 | Saturday 2/8 |
Stacks and Queues | |
| 3 | Saturday 2/15 |
Elementary Sorts Mergesort |
2.1 2.2 |
| 4 | Saturday 2/22 |
Quicksort Priority Queues |
2.3 2.4 |
| 5 | Saturday 3/1 |
Binary Search Trees Balanced Search Trees |
3.2 3.3 |
| 6 | Saturday 3/22 |
Geometric Application of BSTs Hash Tables |
3.4 – |
| 7 | Saturday 3/29 |
Undirected Graphs Directed Graphs |
4.1 4.2 |
| 8 | Saturday 4/5 |
Minimum Spanning Trees ShortestPaths |
4.3 4.4 |
| 9 | Saturday 4/12 |
Maxflow and Mincut | 6.4 |
| 10 | Saturday 4/19 |
Multiplicative Weights Randomness |
– – |