Midterm 1 Information

1 PIMENTEL   (logins 1a - 3z and aa - akz)
10 EVANS     (logins al - ez)
145 DWINELLE (logins fa - jz)
155 DWINELLE (logins ka - zz) 

The campus map shows locations of Pimentel Hall, Evans Hall, and Dwinelle Hall.

The exam is closed note, except for:

• A 1-page (front and back) hand written crib sheet of notes that you write yourself (it may not be shared).
• The Midterm 1 Study Guide. Copies of this study guide will be provided with your exam.

Topics Covered

The exam will cover all course topics through Chapter 2.3.3 of the lecture notes, except for topics marked as Practical Guidance or Bonus Material. Those topics include:

• Primitive expressions
• Call expressions
• Import statements
• Expression trees
• Assignment statements
• Function diagrams
• Pure and non-pure functions
• Def statements and user-defined functions
• Applying user-defined functions
• Environments
• Arithmetic operators
• Local assignment
• Conditional statements
• Boolean contexts
• Boolean operators
• Iteration with while statements
• Passing functions as Arguments
• Iterative improvement
• Nested def statements
• Functions as Returned Values
• Lambda expressions
• Newton's method
• Decorators
• Data abstraction
• Tuples
• Functional pairs
• Dispatch functions
• The sequence abstraction
• Recursive lists

Particular emphasis will be given to user-defined functions, assignment, iteration, and higher-order functions.

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

Practice Exams

The previous exam most similar in topics covered to your upcoming midterm is the Fall 2011 61A Midterm 1 exam. Links to all publicly available previous exams are listed below, for your convenience.

• Fall 2011
  • Midterm 1 (solutions)
  • Midterm 2 (solutions)
  • Final (solutions)
• Fall 2012
  • Midterm 1 (solutions) Midterm 1 Alternate (solutions)

Review Sessions

The main review session, which will cover the Midterm 1 Study Guide, will be held 2pm-4pm on Saturday 9/15 in 1 Pimentel. We suggest that you work through these practice problems before the session, so that you have a chance to solve them on your own.

Berkeley HKN will also hold a review session 12pm-3pm on Sunday 9/16 in 306 Soda. They provide this review session on a volunteer basis; please thank them for their service.

Office hours held Thursday through Monday (9/13 - 9/17) will have the topic-specific themes listed below. Bring your questions about those topics. We will have time in office hours for general questions as well.

Thursday 9/13 @ 2:30pm	Hamilton	Call expressions
Thursday 9/13 @ 3pm	Albert	Expression trees
Thursday 9/13 @ 5:30pm	Joy	User-Defined functions; Applying user-defined functions; Environments
Thursday 9/13 @ 6pm	Allen	Assignment; Local assignment
Thursday 9/13 @ 7pm	Steven	Conditional Statements
Friday 9/14 @ 9:30am	Andrew	Boolean contexts and operators
Friday 9/14 @ 11am	Shu	Iteration and assignment
Friday 9/14 @ 12pm	Stephen	Passing functions as arguments
Friday 9/14 @ 1pm	Varun	Functions as return values
Monday 9/17 @ 10am	Keegan	Lambda expressions
Monday 9/17 @ 1pm	Stephen	Iterative improvement; Newton's Method
Monday 9/17 @ 1pm	Shu	Data abstraction
Monday 9/17 @ 3pm	Allen	Functional pairs; dispatch functions
Monday 9/17 @ 3pm	Varun	Lambda Expressions, Environments
Monday 9/17 @ 3:30pm	John	Recursive lists
Monday 9/17 @ 4:30pm	Julia	The Sequence Abstraction

Make-Up Exam

A make-up exam will be held 7:30pm-9:30pm in 310 Soda. You can only take this exam if you have filled out this conflict form by Friday 9/14. You will receive email before (or on) Saturday 9/15 confirming that you can take the make-up exam.