Below are links to the precept handouts. This material is not a replacement for going to precept: some material in precept will not appear in these handouts and not all of the material in these handouts will be covered during precept.
| # | DATE | TOPICS | HANDOUT |
|---|---|---|---|
| 1 | Friday 1/31 |
Union-Find Analysis of Algorithms |
Precept 1 |
| 2 | Friday 2/7 |
Stacks and Queues | Precept 2 |
| 3 | Friday 2/14 |
Elementary Sorts Mergesort |
Precept 3 |
| 4 | Friday 2/21 |
Quicksort Priority Queues |
Precept 4 |
| 5 | Friday 2/28 |
Elementary Symbol Tables Balanced Search Trees |
Precept 5 |
| 6 | Friday 3/7 |
no precept | – |
| 7 | Friday 3/21 |
Hash Tables Kd-Trees |
Precept 6 |
| 8 | Friday 3/28 |
Graphs and Digraphs | Precept 7 |
| 9 | Friday 4/4 |
Minimum Spanning Trees Shortest Paths |
Precept 8 |
| 10 | Friday 4/11 |
Dynamic Programming Maxflow |
Precept 9 |
| 11 | Friday 4/18 |
Randomness Multiplicative Weights |
Precept 10 |
| 12 | Friday 4/25 |
Intractability Algorithm Design |
Precept 11 |
Changing precepts. If you would like to attend a different precept on a continuing basis, you must officially register for that precept through TigerHub. If the precept is closed, monitor enrollments and change precepts when a student drops. If you have a scheduling problem that can’t be solved unless you move into a closed precept, contact Kobi Kaplan and explain your situation.