Computer Science 226
Algorithms and Data Structures
Spring 2010

Course Information | Assignments | Exercises | Lectures | Exams | Booksite


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. 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 trees are 2-3 trees, KMP and grep implementations are completely different, and LZW uses a different starting code.

Spring 2010 Midterm Solutions
Fall 2009 Midterm Solutions
Fall 2009 Final Solutions
Spring 2009 Midterm Solutions
Spring 2009 Final Solutions
Fall 2008 Midterm Solutions
Fall 2008 Final Solutions
Spring 2008 Midterm Solutions
Spring 2008 Final Solutions
Fall 2007 Midterm Solutions
Fall 2006 Midterm Solutions
Fall 2006 Final Solutions
Fall 2005 Midterm Solutions
Fall 2005 Final Solutions
Fall 2004 Midterm No solutions
Fall 2004 Final No solutions
Spring 2004 Midterm Solutions
Spring 2004 Final Solutions
Spring 2003 Midterm Solutions
Spring 2003 Final Solutions

Exam policy.   Exams are closed book and closed note, although you are permitted to bring one 8.5 x 11 cheatsheet, written in your own handwriting. No calculators or computational aids are permitted.

Regrade policy.   You may request regrades on individual exam questions. Regrade requests should be based on the perception that the grader either misunderstood your answer or made a mistake in evaluating it. Regrades must be made in writing, and submitted within one week of when the exams are returned.