COS 226 Midterm Information, Spring 2002
- Closed book, closed note.
- You may bring one 8.5-by-11 sheet with notes in your own
handwriting to the exam
- No calculators (or computers!)
Material Covered
- Textbook chaps. 6-10, 12-15
- Lecture notes 1-10
- Programming assignments 1-4
- Exercises 1-5
Partial list of algorithms covered so far
| insertion sort | linear search |
selection sort | binary search |
| bubble sort | interpolation search |
shellsort | BSTs |
| pointer sorting | root insertion BSTs |
quicksort | 2-3-4 trees |
| mergesort | red-black trees |
heapsort | randomized BSTs |
| binomial queues | hashing |
binary quicksort | separate chaining |
| splay trees | Patricia tries |
distribution counting | linear probing |
| MSD radix sort | double hashing |
LSD radix sort | tries |
| 3-way radix quicksort | digital search trees |
3-way radix trie | binary heaps |