To view the lecture overheads your browser must support a postscript previewer. There is no guarantee that the lecture in class matches the lecture overheads because questions arise during the lecture. The lecture overheads only represent the plan for the lecture.
Lecture 1: Course information and
review
Lecture 2: Linked lists
Lecture 3: Multiple linked lists and implementing nodes and pointers with arrays
Lecture 4: Analysis of algorithms
Lecture 5: Analysis of recursive algorithms
Lecture 6: Trees and traversals
Lecture 7: Binary search trees, I
Lecture 8: Binary search trees, II
Lecture 9: AVL trees, I
Lecture 10: AVL trees, II
Lecture 11: Splay trees
Lecture 12: B-trees
Lecture 13: Multidimensional search trees
Lecture 14: Hashing I
Lecture 15: Hashing II
Lecture 16: Priority queues and binary
heaps
Lecture 17: d-heaps
Lecture 18: Leftist heaps and skew heaps
Lecture 19: Calendar queue
Lecture 20: Quicksort and mergesort
Lecture 21: Radix sort and cache performance of sorting
Lecture 22: Minimum spanning tree and dynamic equivalence (Union, Find)
Lecture 23: Evaluating performance
Lecture 24: Course summary
Special Lecture: Nearest Neighbor Search by Kevin Zatloukal
Lectures below this line are from Spring quarter 1997
ladner@cs.washington.edu