CS 61A

Structure and Interpretation of Computer Programs, Spring 2015

Instructor: John DeNero

Midterm 2 Information

The campus map shows locations of all rooms.

The exam is closed note, except for:

Topics Covered

The exam will cover all course topics through Chapter 2.9 of Composing Programs, except for Newton's method (1.6.5), implementing lists & dictionaries (2.4.7), dispatch dictionaries (2.4.8), propagating constraints (2.4.9), and implementing classes and objects (2.6).

Particular emphasis will be given to mutable data, object-oriented programming, recursion, and recursive data (such as linked lists and trees).

You should be prepared to answer questions that relate closely to the projects and homework assignments (not including challenge problems). You should also know how to draw an environment diagram by hand.


Past exams and solutions

Review materials and guides