COS 226 Midterm Information, Fall 2009
The Fall 2009 COS 226 midterm is Thursday, October 29 from 11-12:20pm
in Bowen 222 (same time and location as lecture).
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 calculators (or computers!)
Material covered:
- Algorithms in Java, 3rd edition, Chapter 1 (online pdf).
- Algorithms, 4th edition, Chapters 3 and 4 (course packet).
- Lectures 1–10.
- Programming assignments 1–5.
Review Sessions
We will use the precepts on Thursday as midterm review sessions.
You are free to sit in on additional review
sessions if you feel it will give you more exposure.
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 |
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.