Information on midterm exam
- Wednesday, March 10, in class
- Closed book
- You may bring one 8.5-by-11 sheet with notes in your handwriting to the exam
- No calculators (or computers!)
Material Covered
- Textbook chaps. 6-15
- Lecture notes (will NOT include material from March 8 lecture)
- Programming assignments 1-4
- Problem sets 1-5
Review Sessions
We will use the precepts on March 8 and 9 as midterm review sessions.
In this regard, we will combine precepts which meet at the same time
into larger groups for this week only. Additionally, you should
attend your own precept in order to turn in your problem set 5 to your
true preceptor, but you may feel free to sit in on additional review
sessions if you feel it will give you more exposure.
Here are the locations for this coming week
- Monday 3:30-4:20, Room 105 (small auditorium)
- Monday 7:30-8:20, Room 105 (small auditorium)
- Monday 3:00-3:50, Room 103
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 |
| skip lists | splay trees |
distribution counting | linear probing |
| MSD radix sort | double hashing |
LSD radix sort | tries |
| radix 3-way quicksort | digital search trees |
batcher's mergesort | Three-way radix trie |
| Patricia tries |
Sample question
Give the result of alg X running on input Y
(we may ask other types of questions also; this is just one example)
While the 1998 midterm
is a good study guide in terms of coverage, please note that this
year's midterm will naturally be a different type of test, since it is
closed-book.