|
A good way to prepare for an exam is to solve old exam questions. Here are some old exams and additional practice questions. Here is some midterm exam information. Here is some final exam information.
| SEMESTER | EXAM | SOLUTIONS |
|---|---|---|
| Fall 2012 | Midterm | Solutions |
| Fall 2012 | Final | Solutions |
| Spring 2012 | Midterm | Solutions |
| Spring 2012 | Final | Solutions |
| Fall 2011 | Midterm | Solutions |
| Fall 2011 | Final | Solutions |
| Fall 2010 | Midterm | Solutions |
| Fall 2010 | Final | Solutions |
| Fall 2009 | Midterm | Solutions |
| Fall 2009 | Final | Solutions |
| Fall 2008 | Midterm | Solutions |
| Fall 2008 | Final | Solutions |
| Spring 2008 | Midterm | Solutions |
| Spring 2008 | Final | Solutions |
Be warned that old courses might have covered
different material and used different policies for exams. For example,
at least the following were changed in Spring 2009: quicksort uses the
first element as the partition element; shellsort uses a different
increment sequence; red-black BSTs are left-leaning 2-3 trees; KMP and grep
implementations are completely different; and LZW uses a different
starting code.
Exam policy. Exams are closed book and closed note, although you are permitted to bring one 8.5-by-11 cheatsheet (one side for the midterm and both sides for the final), written in your own handwriting. No calculators or computational aids are permitted.
