Failure to go to the right room can result in a serious deduction on the exam. There will be no makeup exams except under extraordinary circumstances, which must be accompanied by the recommendation of a Dean.
There will be a midterm review session from 6-8 PM in Friend 101 on Sunday Oct 25th.
We will review some key concepts discussed in lectures and will do Q&A. You can bring general questions. If they are of interest to a larger audience, we will address them.
Other questions can be posted to Piazza so course staff can answer them.
You can find the review slides here
Solutions to some exercises are here
| quick-find | quick-union | weighted quick-union | |
| resizing arrays | linked lists | stacks | queues |
| insertion sort | selection sort | Knuth shuffle | |
| mergesort | bottom-up mergesort | ||
| quicksort | 3-way quicksort | quickselect | |
| binary heaps | heapsort | ||
| sequential search | binary search | BSTs | |
| kd-trees | interval search trees | ||
| 2-3 trees | left-leaning red-black BSTs |
A good way to practice for the midterm is to solve problems from old exams. There are also (ungraded) exercises in Blackboard that you may use for practice.