COS 226 Midterm Information, Fall 2008
The Fall 2008 midterm is Thursday, October 23 from 11-12:20
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, Chapters 1-4, 6-9, 12-14.
While you are not responsible for reading about topics that we do
not cover in lecture or that are beyond the scope of the course,
you are responsible for exercising good judgement about choosing what to read.
- Lectures 1-11.
- Programming assignments 1-5.
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.