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 | ED LESSONS | HANDOUTS |
|---|---|---|---|
| 1 | Friday 2/5 |
Experimental Timing Analysis | precept1.zip Percolation Overview |
| 2 | Friday 2/12 |
Iterators | Memory Analysis |
| 3 | Friday 2/19 |
Sorting and Running Time Analysis | Running Time Analysis |
| 4 | Friday 2/26 |
Quicksort and Priority Queues | – |
| 5 | Friday 3/5 |
K-d Trees and BSTs | Kd Tree Insertion Kd Tree Bounding Boxes Kd Tree Range Search Kd Tree Nearest Neighbor |
| 6 | Friday 3/12 |
Red-black BSTs and Hash Tables | – |
| 7 | Friday 3/19 |
Midterm Review | – |
| 8 | Friday 3/26 |
WordNet and Digraph Algorithms | – |
| 9 | Friday 4/2 |
MSTs and Shortest Paths | – |
| 10 | Friday 4/9 |
Seam Carving and Maximum Flows | – |
|
The precepts below have not been updated for Spring 2021.
|
|||
| 11 | Friday 4/16 |
String Sorts and Tries | Suffix arrays (textbook) |
| 12 | Friday 4/23 |
Data Compression and Burrows–Wheeler | Burrows-Wheeler and String Search |
| 13 |