Final Exam Information

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:

Copies of study guides will be provided with your exam.

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:

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:

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.

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:00pmHigher-order functionsPhill320 Soda
Monday 12/3 @ 2:00pmLambda expressionsSteven320 Soda
Monday 12/3 @ 3:00pmNewton's methodVarun320 Soda
Monday 12/3 @ 4:00pmEnvironment diagramsAllen320 Soda
Tuesday 12/4 @ 1:00pmSequences and nested tuplesJoy651 Soda
Tuesday 12/4 @ 2:00pmLists and dictionariesAlbert651 Soda
Tuesday 12/4 @ 3:00pmNon-local assignmentAndrew651 Soda
Tuesday 12/4 @ 4:00pmMap, filter, and reduceVarun310 Soda
Tuesday 12/4 @ 5:00pmIdentity, equality, and mutable valuesJulia310 Soda
Wednesday 12/5 @ 1:00pmClasses, instances, and inheritancePhill271 Soda
Wednesday 12/5 @ 2:00pmDot expressions and bound methodsAllen271 Soda
Wednesday 12/5 @ 3:00pmBelow-the-line object-oriented programmingShu271 Soda
Wednesday 12/5 @ 4:00pmRecursionKeegan271 Soda
Wednesday 12/5 @ 5:00pmRecursive data structuresHamilton271 Soda
Thursday 12/6 @ 1:00pmOrders of growthSteven271 Soda
Thursday 12/6 @ 2:00pmTrees and tree-structured setsJoy271 Soda
Thursday 12/6 @ 3:00pmScheme and lexical vs. dynamic scopeStephen271 Soda
Thursday 12/6 @ 4:00pmScheme lists and parsing SchemeKeegan271 Soda
Thursday 12/6 @ 5:00pmTail callsShu271 Soda
Friday 12/7 @ 1:00pmIterators and iterablesAndrew310 Soda
Friday 12/7 @ 2:00pmGenerators and generator functionsStephen310 Soda
Friday 12/7 @ 3:00pmStreamsAlbert310 Soda
Friday 12/7 @ 4:00pmThe Logic languageJulia310 Soda
Friday 12/7 @ 5:00pmAnswering Logic queriesHamilton310 Soda