COS 226 Midterm Information, Fall 2006


Material covered:

List of algorithms and data structures covered so far:

quick-find weighted quick-union path compression stacks queues
insertion sort selection sort quicksort mergesort heapsort
binary heaps binary search linear probing double hashing separate chaining
BSTs randomized BSTs 2-3-4 trees red-black trees R-way tries
TSTs MSD radix sort LSD radix sort 3-way radix quicksort Lists

A good way to practice for the midterm is to solve problems from old exams.