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.
|Union–Find, Analysis, Percolation||Running Time Analysis|
|Stacks, Queues, and Advanced Java||Memory Analysis|
|Selection Sort, Insertion Sort, and Mergesort||–|
|Quicksort and Heaps||–|
|Symbol Tables, Red-Black Trees, Midterm Review||–|
The precepts below have not been updated for Spring 2022.
|BSTs and K-d Trees||Kd Tree Insertion
Kd Tree Bounding Boxes
Kd Tree Range Search
Kd Tree Nearest Neighbor
|Red-black BSTs and Hash Tables||–|
|WordNet and Digraph Algorithms||–|
|MSTs and Shortest Paths||–|
|Dynamic Programming and Seam Carving||–|
|String Sorts and Tries||Suffix arrays (textbook)|
|Data Compression and Burrows–Wheeler||–|
Attendance. You are expected to attend the precept for which you have officially registered. If you are unable to attend your precept on a certain week but can attend a different precept, then email both your preceptor and the preceptor whose precept you would like to attend informing them about the change for that week.
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, see Colleen Kenny and explain your situation.