- Time: 3pm - 6pm Thursday 12/15 (exam will start promptly at 3pm)
- Location: RSF, Pauley Ballroom, 220 Hearst Gym, 145 Dwinelle, 155 Dwinelle. Seating assignments will be emailed to you on Wednesday 12/14.
The exam is closed note, except for:
- Two 1-page (front and back) hand written sheets of notes that you create yourself (they may not be shared).
- The Midterm 1 Study Guide. A copy of this study guide will be provided with your exam.
- The Midterm 2 Study Guide. A copy of this study guide will be provided with your exam.
- The Final Study Guide. A copy of this study guide will be provided with your exam.
You will write your answers on the exam itself. Scratch paper will be provided.
Please bring your Cal student ID or another photo ID.
The exam will cover all course topics, which includes all of Composing Programs, except for:
- Newton's method (1.6.5),
- The linked list data abstraction (2.3.7)
- Implementing lists & dictionaries (2.4.7)
- Dispatch dictionaries (2.4.8)
- Propagating constraints (2.4.9)
- Implementing classes and objects (2.6)
- Logic programming (4.4)
- Unification (4.5)
- Parallel computing (4.8)
The textbook and lecture differ substantially in their descriptions of iterators (4.2.1), iterables (4.2.2), and streams (4.2.6). Please study the lecture examples rather than the textbook.
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.
The best way to study for the final is to work through practice problems. The course staff has put together the following resources:
Review Session: See the weekly meeting schedule for topic review sessions. Eta Kappa Nu (the EECS honors society) will also be hosting a unofficial review session on Thursday, 10/8 9am-11:30am in 306 Soda.
Office Hours: See the office hours schedule.
If you cannot attend the final, email email@example.com immediately. There is no official make-up exam.