The exam covers Modules 5—9 of the course, corresponding to Chapters 5—8 of the text (Excluding 8.4).

The exam has 50 points, split approximately evenly between multiple choice and Racket coding questions.

See the menu for examples of the types of problems you may see on the exam.

See the menu for the most important concepts by chapter.

• Procedures as parameters
• Procedures that return procedures
• Computability and Uncomputability

• Compound data
• Data abstraction principles
• The game of Nim

• Representing lists
• Processing lists
• The Movie Query System

• Binary trees and their properties
• Binary tree traversals
• Binary search trees
• Expression trees