About the Exam

The final will be held on Tuesday, May 19th from 8am to 11am in 390 Hearst Mining.

The final will be closed notes, books, laptops, and people. However, you may use up to two (two-sided) note sheets of your own design (group design ok but not recommended).

You may also use a basic, non-programmable calculator, which is not required, but which may be helpful. Your TI-86 is not allowed. Neither is your iPhone.

Practice Exams

You can also look at much older exams from other versions of the class.

Review Sessions and Office Hours

Thursday 5/14 11am-1pm in Hearst Mining 390: Nimar will review questions from the Fall 2008 final exam

Friday 5/15 11am-1pm in Soda 310: John will review some important concepts and techniques (MDPs, Bayes nets and classification)

Office hours:

  • Friday: John 3pm-4pm in Soda 711
  • Monday: Nick 2pm-5pm in Soda 711

    Possible Exam Topics

    Note: exam questions will in many cases ask you to extend or combine basic ideas and algorithms from class. Make sure you understand the fundamentals in addition to being able to procedurally execute algorithms. The exam will not test your knowledge of Python, however questions may assume familiarity with the projects (see past exams for examples).


    Constraint Satisfaction Problems:


    Markov Decision Processes:

    Reinforcement Learning:


    Bayes' Nets:

    Hidden Markov Models:


    Applications and Advanced Topics:

    Note: larger questions will not assume knowledge of these topics, but they may appear in true/false and short answer questions.