The Fall 2010 midterm for COS 226 is Tuesday, October 26 from 11-12:20pm
in Bowen 222 (same time and place as lecture).
quick-find | weighted quick-union | path compression | stacks | queues |
binary search | Knuth shuffle | insertion sort | selection sort | shellsort |
mergesort | bottom-up mergesort | quicksort | 3-way quicksort | heapsort |
binary heaps | sequential search | BSTs | 2-3 trees | left-leaning red-black trees |
separate chaining | linear probing |
A good way to practice for the midterm is to solve problems from old exams.