CS Comprehensive Exam
Data Structures by Topic *ILLUSTRATIVE FOR LECTURE

1. Lists
   1. Unsorted Linked
      1. Fall 2007 #2*
      2. Fall 2006 #2*
      3. Spring 2006 #3*
      4. Fall 2005 #1
      5. Fall 2005 #2*
      6. Fall 2004 #1*
      7. Spring 2001 #1
      8. Fall 1998 #2
   2. Sorted Linked
      1. Spring 2007 #2*
      2. Spring 2003 #2*
      3. Spring 2002 #2*
      4. Fall 1999 #2*
   3. Stack Linked
      1. Fall 2001 #2*
   4. Queue Array
      1. Spring 2005 #1*
      2. Spring 2000 #2
2. Trees
   1. General
      1. Fall 2001 #1*
      2. Fall 2000 #4
   2. Binary
      1. Fall 2007 #3*
      2. Spring 2007 #1
      3. Fall 2006 #3*
      4. Spring 2006 #2
      5. Spring 2005 #2*
      6. Spring 2004 #2*
      7. Spring 2003 #1*
      8. Fall 2002 #1*
      9. Spring 2000 #1*
      10. Spring 1999 #2*
      11. Fall 1998 #1
   3. Binary Search Tree
      1. Spring 2007 #3
      2. Fall 2003 #1
      3. Spring 2001 #2
   4. Heap/Priority Queue
      1. Fall 2005 #3
      2. Fall 2004 #2
3. Search
   1. Spring 2004 #1
   2. Fall 2000 #3
4. Sorting
   1. Fall 2006 #1
   2. Fall 1999 #1
   3. Spring 1999 #1
5. Hashing
   1. Spring 2002 #1
6. Big-Oh
   1. Fall 2007 #1*
   2. Spring 2006 #1
   3. Fall 2003 #2
   4. Fall 2002 #2