Final Exam Information

The campus map shows locations of the Hearst Gym.

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
• The Midterm 2 Study Guide.
• The Final Study Guide.

Topics Covered

The exam will cover all course topics through Chapter 4.3 of the lecture notes, except for topics marked as Practical Guidance or Bonus Material, and not including Chapters 2.4.8 (constraint programming). 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
• For statements
• Ranges
• Strings
• Map, filter, and reduce on sequences
• Generator expressions
• Mutable data
• Nonlocal statements
• Identity vs. equality
• Lists
• List comprehensions
• Implementing mutable recursive lists
• Message passing
• Dictionaries
• Implementing dictionaries
• Class statements
• Invoking methods
• Dot expression evaluation
• Dot expression assignment
• Bound methods vs functions
• Class vs instance attributes
• Inheritance
• Using multiple inheritance
• Implementing instances with dispatch dictionaries
• Implementing bound methods
• Implementing classes with dispatch dictionaries
• Implementing single inheritance
• String coercion to str and repr strings
• Interfaces
• Property methods
• Special methods
• Type dispatching
• Data-directed programming
• Type Coercion
• Recursive functions
• Tree-recursive functions
• Memoization
• Order of growth
• Recursive list processing
• Tree-structured data
• Trees with internal values
• Sets
• Exceptions
• The Scheme language
• Scheme lists
• Parsing (syntactic analysis)
• Eval/Apply mutual recursion
• Dynamic vs lexical scope
• Tail calls
• Iterators
• Generators and generator functions
• Streams
• The Logic language

Scheme: The exam may contain Scheme examples and may ask you to write Scheme expressions. However, the Scheme language special forms will be limited to lambda, mu, if, and define. Built-in procedures will be limited to cons, car, cdr, list and numeric predicates and procedures.

Logic: The exam may contain Logic examples, but will not include the details of unification or the implementation of the Logic interpreter.

Particular emphasis will be given to:

• Higher-order functions
• Environment diagrams
• Sequences (tuples, lists, recursive lists, Scheme lists)
• Non-local assignment
• Mutable values
• Object-oriented programming
• Recursion and recursive data
• Parsing
• Eval/Apply mutual recursion with dynamic/lexical scope
• Iterators, generators, and streams

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)
• Summer 2012
  • Midterm 1 (solutions)
  • Midterm 2 (solutions)
  • Final (solutions)
• Fall 2012
  • Midterm 1 (solutions) Midterm 1 Alternate (solutions)
  • Midterm 2 (solutions) Midterm 2 Alternate (solutions) Final (solutions)

Review Sessions

The main review session will be held 2pm-5pm on Saturday 12/8 in 2050 Vally Life Sciences Building (VLSB).

Office hours held during the week of 12/3 through 12/7 have a special schedule and the topic-specific themes listed below. Bring your questions about those topics. We will have time in office hours for general questions as well.

Monday 12/3 @ 1:00pm	Higher-order functions	Phill	320 Soda
Monday 12/3 @ 2:00pm	Lambda expressions	Steven	320 Soda
Monday 12/3 @ 3:00pm	Newton's method	Varun	320 Soda
Monday 12/3 @ 4:00pm	Environment diagrams	Allen	320 Soda
Tuesday 12/4 @ 1:00pm	Sequences and nested tuples	Joy	651 Soda
Tuesday 12/4 @ 2:00pm	Lists and dictionaries	Albert	651 Soda
Tuesday 12/4 @ 3:00pm	Non-local assignment	Andrew	651 Soda
Tuesday 12/4 @ 4:00pm	Map, filter, and reduce	Varun	310 Soda
Tuesday 12/4 @ 5:00pm	Identity, equality, and mutable values	Julia	310 Soda
Wednesday 12/5 @ 1:00pm	Classes, instances, and inheritance	Phill	271 Soda
Wednesday 12/5 @ 2:00pm	Dot expressions and bound methods	Allen	271 Soda
Wednesday 12/5 @ 3:00pm	Below-the-line object-oriented programming	Shu	271 Soda
Wednesday 12/5 @ 4:00pm	Recursion	Keegan	271 Soda
Wednesday 12/5 @ 5:00pm	Recursive data structures	Hamilton	271 Soda
Thursday 12/6 @ 1:00pm	Orders of growth	Steven	271 Soda
Thursday 12/6 @ 2:00pm	Trees and tree-structured sets	Joy	271 Soda
Thursday 12/6 @ 3:00pm	Scheme and lexical vs. dynamic scope	Stephen	271 Soda
Thursday 12/6 @ 4:00pm	Scheme lists and parsing Scheme	Keegan	271 Soda
Thursday 12/6 @ 5:00pm	Tail calls	Shu	271 Soda
Friday 12/7 @ 1:00pm	Iterators and iterables	Andrew	310 Soda
Friday 12/7 @ 2:00pm	Generators and generator functions	Stephen	310 Soda
Friday 12/7 @ 3:00pm	Streams	Albert	310 Soda
Friday 12/7 @ 4:00pm	The Logic language	Julia	310 Soda
Friday 12/7 @ 5:00pm	Answering Logic queries	Hamilton	310 Soda