|Time:||3pm-6pm Thursday December 13|
|Location:||220 Hearst Gym|
The campus map shows locations of the Hearst Gym.
The exam is closed note, except for:
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:
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:
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.
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|