COS 226 Midterm Information, Spring 2014
UNDER CONSTRUCTION
Time and location:
- The midterm is during lecture on Wednesday, March 12 from 11-12:20pm.
- The midterm room is either McCosh 10 or McCosh 28, depending on the first two
characters of your Princeton netID.
- Princeton netID aa-ck: McCosh 28.
- Princeton netID cl-zz: McCosh 10.
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.
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).
Q + A Session
Date and room TBA.
The precept before the exam will be devoted to Q + A and review.
Material covered:
- Algorithms, 4th edition, Sections 1.3–1.5, Chapter 2, and Chapter 3.
- Lectures 1–10.
- Programming assignments 1–4.
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 BSTs |
| separate chaining |
linear probing |
A good way to practice for the midterm is to solve problems from
old exams.