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 evenings.
| # | DUE | QUIZ | READINGS |
|---|---|---|---|
| 1 | Saturday 2/1 |
Union-Find | 1.5 |
| 2 | Saturday 2/1 |
Analysis of Algorithms | 1.4 |
| 3 | Saturday 2/8 |
Stacks and Queues | 1.3 |
| 4 | Saturday 2/15 |
Elementary Sorts | 2.1 |
| 5 | Saturday 2/15 |
Mergesort | 2.2 |
| 6 | Saturday 2/22 |
Quicksort | 2.3 |
| 7 | Saturday 2/22 |
Priority Queues | 2.4 |
| 8 | Saturday 3/1 |
Binary Search Trees | 3.2 |
| 9 | Saturday 3/1 |
Balanced Search Trees | 3.3 |
| 10 | Saturday 3/15 |
Geometric Application of BSTs | – |
| 11 | Saturday 3/15 |
34HashTables | |
| 12 | Saturday 3/22 |
Undirected Graphs | 4.1 |
| 13 | Saturday 3/22 |
Directed Graphs | 4.2 |
| 14 | Saturday 3/29 |
Minimum Spanning Trees | 4.3 |
| 15 | Saturday 3/29 |
Shortest Paths | 4.4 |
| 16 | Saturday 4/5 |
Maxflow and Mincut | 6.4 |
| 17 | Saturday 4/12 |
Multiplicative Weights | - |
| 18 | Saturday 4/12 |
Randomness | - |