Below are links to the precept handouts. These handouts are not a substitute for attending 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 9/4 |
Percolation | Precept 1 |
| 2 | Friday 9/11 |
Union-Find Analysis of Algorithms |
Precept 2 |
| 3 | Friday 9/18 |
Stacks and Queues | Precept 3 |
|
The precepts below have not yet been updated for Fall 2026.
|
|||
| 4 | Friday 9/25 |
Elementary Sorts Mergesort |
Precept 4 |
| 5 | Friday 10/2 |
Quicksort Priority Queues |
Precept 5 |
| 6 | Friday 10/9 |
Elementary Symbol Tables Balanced Search Trees |
Precept 6 |
| 7 | Friday 10/16 |
no precept | - |
| 8 | Friday 10/30 |
Hash Tables K-d Trees |
Precept 7 |
| 9 | Friday 11/6 |
Graphs and Digraphs Minimum Spanning Trees |
Precept 8 |
| 10 | Friday 11/13 |
Shortest Paths Dynamic Programming |
Precept 9 |
| 11 | Friday 11/20 |
Reductions Intractability |
Precept 10 |
| 12 | Friday 12/4 |
Multiplicative Weights 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 using Stellic via 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 without moving into a closed precept, contact Kobi Kaplan and explain your situation.