COS 226 Midterm Information, Spring 2008



The Spring 2008 midterm is Wednesday, March 12 from 11-12:20 in Frist 302 (same time and location as lecture).



Rules:


Material covered:


List of algorithms and data structures covered so far:

quick-find weighted quick-union path compression stacks queues
insertion sort selection sort shellsort mergesort bottom-up mergesort
quicksort 3-way quicksort heapsort binary heaps binary search
BSTs randomized BSTs 2-3-4 trees left-leaning red-black trees

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