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. Quizzes are available online via PrairieLearn. (Sign in with Google or Microsoft using your netid@princeton.edu address. Contact the course staff if you get an "Access Denied" message.) All readings refer to Algorithms, 4th edition.
Quizzes are due at 11:59pm ET on Saturday evenings.
| # | DUE | QUIZ | READINGS |
|---|---|---|---|
| 1 | Saturday 9/7 |
Union-Find | 1.5 |
| 2 | Saturday 9/7 |
Analysis of Algorithms | 1.4 |
| 3 | Saturday 9/14 |
Stacks and Queues | 1.3 |
| 4 | Saturday 9/21 |
Elementary Sorts | 2.1 |
| 5 | Saturday 9/21 |
Mergesort | 2.2 |
| 6 | Saturday 9/28 |
Quicksort | 2.3 |
| 7 | Saturday 9/28 |
Priority Queues | 2.4 |
| 8 | Saturday 10/5 |
Binary Search Trees | 3.2 |
| 9 | Saturday 10/5 |
Balanced Search Trees | 3.3 |
| 10 | Saturday 10/26 |
Geometric Application of BSTs | – |
| 11 | Saturday 10/26 |
Hash Tables | 3.4 |
| 12 | Saturday 11/2 |
Undirected Graphs | 4.1 |
| 13 | Saturday 11/2 |
Directed Graphs | 4.2 |
| 14 | Saturday 11/9 |
Minimum Spanning Trees | 4.3 |
| 15 | Saturday 11/9 |
Shortest Paths | 4.4 |
| 16 | Saturday 11/16 |
Maxflow and Mincut | 6.4 |
| 17 | Saturday 11/23 |
Multiplicative Weights | - |
| 18 | Saturday 11/23 |
Randomness | - |