CS 188: Artificial Intelligence, Fall 2006

About the Exam

The final will be held on Thursday, December 14th, starting promptly at 8am and ending at 11am.

The final will be closed notes, books, laptops, and people. However, you may use a one-page cheat sheet of your own design (group design ok but not recommended) along with your two cheat sheets from the first and second midterm if desired. You may also use a basic calculator, which will not be required, but which may be helpful.

Practice Exams

Practice exams:

Note that last term's syllabus was somewhat different in order, and so the exam topics do not align perfectly.

You can also look at old exams from previous semesters.

Review Sessions and Office Hours

The Primary Review Session: Tuesday, 12/12, 5-7pm, 306 Soda Hall.

Monday:

• 2-3pm in 775 Soda with Dan Klein: Search

Tuesday:

• 2-3pm in 711 Soda with John DeNero: MDPs
• 5-7pm in 306 Soda with John DeNero: Bayes nets, CSPs, MDPs, Reinforcement learning

Wednesday:

• 10:00-11:00am in 547 Soda with Tamara Miller: Hidden Markov Models
• 11:00-12:00am in 547 Soda with Tamara Miller: Classification
• 12:00-1:00pm in 775 Soda with Dan Klein: Assorted topics
• 1:30-2:30pm in 711 Soda with Dan Gillick: Assorted topics

Possible Final Topics

All topics from the first and second midterms

Classification:

• Basic concepts: hypothesis classes, generalization, overfitting, experimental methodology
• The naive Bayes classifier
• The perceptron classifier
• The nearest neighbor classifier
• Estimation and smoothing
• Purposes of held-out (validation) data

Advanced Topics:

• Clustering and the K-means algorithm
• Applications to vision