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 HANDOUTS ED LESSONS TARJAN
1 Friday
9/8
Precept 1  Union-Find  
  Analysis Drills  
  Percolation  
2 Friday
9/15
Precept 2  Stacks and Queues  
  Iterators  
  Memory Usage  
Persistence,
Extendable Arrays,
and Amortization
3 Friday
9/22
Precept 3  Comparable & Comparator  
  Sort Stability  
  Mergesort  
4 Friday
9/29
Precept 4  Quicksort  
  Priority Queues  
5 Friday
10/6
Precept 5  Elementary Symbol Tables  
  Balanced Search Trees  
Balanced BSTs
6 Friday
10/27
Precept 6  K-d Trees  
  Hash Tables  
Line Segment Intersection,
Hashing
7 Friday
11/3
Precept 7  Graphs and Digraphs  
Non-recursive DFS
8 Friday
11/10
Precept 8  Minimum Spanning Trees  
  Shortest Paths  
9 Friday
11/17
Precept 9  Dynamic Programming  
  Maxflow/Mincut  
10 Friday
12/1
Precept 10  Randomness  
  Mulitplicative Weights  
11 Friday
12/8
Precept 11
Jeopardy!
 Intractability  

Attendance. You are expected to attend the precept for which you have officially registered. To earn participation credit, you must mark yourself present at the beginning of precept. To request an attendance waiver (e.g., for illness, travel, religious observance), post in the appropriate Ed Discussion forum.

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 Sue Giranda and explain your situation.