CS212 Exams
Prelim 1 Information

Date: Thursday, March 11, 1999
Time: 7:30 - 9:00 pm
Place: Kimball B11

Review: Wednesday, March 10, 1999, 7:00-8:30pm, Phillips 219

This exam will be closed book. No papers, books, or notes may be used. However, we will provide you with a copy of the Scheme/Swindle Quick Reference.

Material Coverage

You are responsible for all material presented in lecture and section.  This list covers some of the bigger topics, but is by no means exhaustive.

• Substitution Model
• Recursion and Tail-recursion
• Higher Order Functions
• Mathematical Induction (Weak and Strong)
• Abstraction
• Computational Complexity (Running times, and Recurrence Equations)
• Structural Induction
• Data Structures

Recommended Study Tips:

• Review your notes from lecture and section
• Read the handouts
• If you had a partner that did all the work for the problem sets, sit down with him/her and make sure you both understand the problem sets.
• Redo the induction proof from PS2, then check your answer
• Read the induction examples, and then do some exercises yourself
• Look at these practice prelims and do them, don't just look at the answers

Sample Prelims

Note that these prelims were originally in Dylan or in earlier versions of Scheme.  I've been going through them changing the syntax over to Scheme, but there always is the possibility that I've missed something. If you come across some syntax that you don't understand, feel free to email me directly.

• Fall 1996 Prelim 1

• Spring 1997 Prelim 1

• Spring 1998 Prelim 1