COS 226 Midterm Information, Spring 2018

Time and location:


Midterm Office Hours

are the same. See the syllabus page.

Midterm Review Session

The class meeting (March 7) and precept (March 8) before the exam will be devoted to review.

Material covered:

Algorithms and data structures emphasized in this course:

quick-find quick-union weighted quick-union
resizing arrays linked lists stacks and queues
insertion sort selection sort Knuth shuffle
mergesort bottom-up mergesort Analysis of Algorithms
quicksort 3-way quicksort
binary heaps heapsort
sequential search binary search
binary search trees 2-3 trees left-leaning red-black BSTs

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