TIME | ROOM | PERSON |
---|---|---|
Sat 8-10pm | Friend 017 | Dan Larkin |
Sun 5-7pm | CS 003 | Diego Perez Botero |
Mon 3:30-5:30pm | CS205 | Maia Ginsburg |
Mon 7-9pm | CS 003 | Dushyant Arora |
Mon 8-10pm | Friend 017 | Ankit Garg |
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 | shellsort |
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 | Graham scan | kd trees | interval search trees |
A good way to practice for the midterm is to solve problems from old exams.