| DATE | TIME | ROOM | PERSON |
|---|---|---|---|
| Mon 10/14 | 3:00-5:00 pm | CS 004 | Ruth |
| Mon 10/14 | 7:20-8:20 pm | Outside CS 406 | Tengyu |
| Tue 10/15 | 1:00-2:00 pm | CS 312 | Josh |
| Tue 10/15 | 2:00-3:00 pm | CS 208 | Guna and Josh |
| Tue 10/15 | 3:30-4:30 pm | CS 313 | Katie |
| Wed 10/15 | 10:30-12:30 pm | CS 313 | Katie |
| Wed 10/15 | 2:00-3:00 pm | CS 208 | Guna |
| Thurs 10/17 | 12:30-1:30 pm | CS 312 | Josh |
| Thurs 10/17 | 1:30-3:30 pm | CS 324 | Bob |
| Thurs 10/17 | 4:00-4:30 pm | CS 312 | Josh |
| Sun 10/20 | 5:00-8:00 pm | Outside CS 306 | Debbie |
| Mon 10/19 | 12:00-3:00 pm | CS 324 | Bob |
| Mon 10/19 | 3:00-5:00 pm | CS 004 | Ruth |
| Mon 10/21 | 7:20-9:20 pm | Outside CS 406 | Tengyu |
| Tue 10/21 | 9:30-10:30 am | CS 312 | Josh |
Monday 10/21: 4:30-6:30 PM in CS 105
The precept before the exam will be devoted to Q+A and review.
| quick-find | weighted quick-union | path compression | stacks | queues |
| binary search | Knuth shuffle | insertion sort | selection sort | Graham scan |
| 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 |
The best way to practice for the midterm is to solve problems from old exams, particularly those from the study guide.