COS 226 Midterm Information, Spring 2011


Material covered:

Q&A Session

Sunday, March 6, 3-5PM in Friend 006.

The precept before the exam will be devoted to Q+A and review.

List of algorithms and data structures:

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.