## CS 188: Artificial Intelligence, Spring 2007

 Announcements Course Info Schedule/Slides Assignments FAQ Section Demos Newsgroup

The midterm will be held on Tuesday, March 13th, in class, starting promptly at 9:40am and ending at 11am.

The midterm 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). You may also use a basic calculator, which will not be required, but which may be helpful.

### Practice Exams

Practice exams:

• Fall 06 Midterm and Solutions
• Spring 06 midterm, (solutions)
• Spring 06 practice midterm, (solutions)
• Spring 06 final
• Spring 06 practice final, (solutions)
• Note that last year's syllabus was somewhat different in order, and so the midterm topics do not align perfectly.

You can also look at old exams from previous semesters.

### Review Sessions

Review: Thursday 3/8, in class 9:40 - 11 AM (topics in Probability)

General Midterm Review: Sunday 3/11, 5-7 PM, 306 SODA HALL.

### Possible Midterm Topics

#### Search:

• BFS, DFS, UCS, A*, Greedy search
• Search algorithms' strengths and weaknesses
• Properties: completeness, optimality
• Local search
• Be able to phrase search problems and create heuristics

#### Constraint Satisfaction Problems:

• Basic definitions and solution with DFS
• Forward checking, arc consistency
• Be able to phrase CSPs

#### Games:

• Minimax search
• Alpha-beta pruning
• Expectimax search

#### Logic:

• Basics: Entailment, Validity, Satisfiability
• Propositional Logic
• Propositional Resolution (conversion to CNF)
• First Order Logic (relations, objects, functions)
• Quantifiers

#### Probability and Graphical Models:

• Basics: Joint Distribution, Conditional Distribution, Chain Rule, Bayes Rule
• Graphical Models, Structure, CPT representation
• Conditional independence / Bayes' ball
• Be able to draw an appropriate BN for a domain
• Inference (enumeration), prior sampling, rejection sampling, likelihood weighting