COS 226 Midterm Information, Fall 2014

Time and location:

The midterm is during lecture on Tuesday, October 21 from 11-12:20pm.
The exam will start and end promptly, so please do arrive on time.
The midterm room is either in Friend 101 or CS 105, as documented below.
- L01 (traditional lecture): Friend 101.
- L02 (flipped lecture): CS 105.
Failure to go to the right room can result in a serious deduction on the exam. There will be no makeup exams except under extraordinary circumstances, which must be accompanied by the recommendation of a Dean.

Rules:

Closed book, closed note.
You may bring one 8.5-by-11 sheet (one side) with notes in your own handwriting to the exam.
No electronic devices (including calculators, laptops, and cell phones).

Midterm week office hours:

Friday 3-4pm in CS 207 (Kevin).
Friday 4:30-6:30pm in Friend 108 (Jérémie).
Saturday 2-4pm in 221 Nassau (Robert)
Sunday 2:30-4:30pm in 221 Nassau (Shivam)
Monday 1-3pm in 221 Nassau (Josh)
Monday 3-4pm in CS 207 (Kevin).

Q + A session:

5:30-7:30pm Monday, October 20 in CS 105.

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

Material covered:

Algorithms, 4th edition, Sections 1.3–1.5, Chapter 2, and Chapter 3.
Lectures 1–11.
Programming assignments 1–5.

List of algorithms and data structures:

quick-find	quick-union	weighted quick-union
resizing arrays	linked lists	stacks	queues
insertion sort	selection sort	Knuth shuffle
mergesort	bottom-up mergesort
quicksort	3-way quicksort	quickselect
binary heaps	heapsort
sequential search	binary search	BSTs
kd-trees	interval search trees
2-3 trees	left-leaning red-black BSTs
separate chaining	linear probing

A good way to practice for the midterm is to solve problems from old exams. There are also (ungraded) exercises in Blackboard that you may use for practice.