Past Quizzes

This is the complete set of quizzes from Informatics 41 in Fall 2004, Fall 2005, Fall 2006, and Fall 2007. You should try to solve the problems yourself, and ask in your discussion section if you can't. We have deliberately not included answers here, to encourage you to do as we suggest.

These quizzes are the best guide available to the kinds of questions we might ask on this quarter's quizzes, but they are not a perfect match. We may cover topics at a different pace, in a different order, or of an entirely different nature; that means that Quiz N on this list will not be an exact mach for what's on Quiz N this quarter. Look at Quiz N+1 or Quiz N–1 on this list for the topics covered in this quarter's homework and lab assignments for the previous week. You should be well prepared if you come to class, come to section, do your assignments in a timely way, and ask questions where necessary.

QUIZZES FROM FALL 2007

1. First Quiz: Course advice, evaluating expressions
   
2. Second Quiz: Evaluating expressions with function definitions, writing simple functions
   
3. Third Quiz: Evaluating list expressions, functional programming, defining and processing structures, networks
   
4. Fourth Quiz: Selecting from a list, binary search trees
   
5. Fifth Quiz: Binary trees, organization of the restaurants program
   
6. Sixth Quiz: List lookup, combining previously defined functions
   
7. Seventh Quiz: Map, filter, foldr
   
8. Eighth Quiz: Sum selected items in list of structures, functions as arguments to a function, Deus X
   
9. Ninth Quiz: Bits and bytes, O-notation, vectors
10. Tenth Quiz: Accumulators, tail recursion, operating systems, compression
    

QUIZZES FROM FALL 2006

1. First Quiz: Course advice, evaluating expressions, writing simple functions
   
2. Second Quiz: Evaluating boolean expressions, defining and processing structures
   
3. Third Quiz: Evaluating list expressions, processing lists (sum, find, filter) and using previously defined functions
   
4. Fourth Quiz: Removing from a list, binary search trees
   
5. Fifth Quiz: Binary trees, list lookup, processing two lists, combining previously defined functions
   
6. Sixth Quiz: Map, filter, foldr
   
7. Seventh Quiz: Update item in list, lambda expressions, Deus X
   
8. Eighth Quiz: Bits and bytes, representing graphics, computer organization, O-notation, security
   
9. Ninth Quiz: Vectors, accumulators, tail recursion, compression
   

QUIZZES FROM FALL 2005

1. First Quiz: Course advice, evaluating expressions, writing simple functions
   
2. Second Quiz: Evaluating boolean expressions, writing cond expressions, defining and processing structures
   
3. Third Quiz: Evaluating list expressions, processing lists (count, map, filter operations), changing a structure
   
4. Fourth Quiz: Filtering a list, binary search trees
   
5. Fifth Quiz: Traversing a binary search tree, processing lists containing lists, using previously defined functions
   
6. Sixth Quiz: Map, filter, foldr
   
7. Seventh Quiz: Update item in list, lambda expressions, Deus X
   
8. Eighth Quiz: O-notation, bits and bytes, operating systems, vectors
   
9. Ninth Quiz: O-notation and execution time, accumulators, tail-recursion, compression
   

QUIZZES FROM FALL 2004

1. First Quiz: HtDP Chapters 1-2
   
2. Second Quiz: HtDP Chapters 3-6
   
3. Third Quiz: HtDP Chapters 7-10, Fluency Chapters 3, 5, 6
   
4. Fourth Quiz: HtDP Chapters 11-14, Fluency Chapter 4
   
5. Fifth Quiz: HtDP Chapters 15-18
   
6. Sixth Quiz: HtDP Chapters 19-24
   
7. Seventh Quiz: HtDP Chapters 25-27
   
8. Eighth Quiz: HtDP Chapter 29
   
9. Ninth Quiz: HtDP Chapters 30-37, Fluency Chapters 8, 9, 11