Precepts

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