This preview shows pages 1–3. Sign up to view the full content.
1
CS 2710 / ISSP 2160: Artificial Intelligence
MIDTERM EXAM
Fall 2009
This exam is closed book and closed notes.
It consists of several parts.
The first part is true/false.
The second part is problem solving.
The third part is short answer. Each question is labeled with
its point value. If you are spending too much time on a question, skip it and go on, coming back if
you have time.
Student Name___________________________________________
Please also put your name on every page (in case pages get accidentally unstapled)
Question
Score
I. True/False
110 (20 pts)
II. Problem Solving
70 points
Search
1 (15 pts)
Constraints
2 (15 pts)
Games
3 (15 pts)
Propositional Logic
4 (10 pts)
First Order Logic
5 (15 pts)
III. Short Answer
13 ( 10 pts)
Total
100 pts
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document 2
Part I
– True/False. 20 points total.
Each problem is worth 2 points.
Incorrect answers are worth 0 points.
Skipped questions are
worth 1 point.
1. True/False.
Depthfirst search is an optimal uninformed search technique.
2. True/False.
On problems with many repeated states, GRAPHSEARCH is more efficient than
TREESEARCH.
3. True/False.
The minimum remaining value heuristic is a domaindependent method for
deciding which variable to choose next in a backtracking search.
4. True/False.
Every existentially quantified sentence in firstorder logic is true in any model that
contains exactly one object.
5. True/False.
The clauses P(F(A,G(A))) and P(F(x,y)) resolve to produce the empty clause.
6. True/False.
Simple hill climbing is a complete algorithm for solving constraint statisfaction
problems.
7. True/False.
Breadthfirst search is complete if the state space has infinite depth but finite
branching factor.
8. True/False.
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 10/22/2011 for the course CS CS 2710 taught by Professor Wiebe during the Fall '11 term at Pittsburgh.
 Fall '11
 wiebe
 Artificial Intelligence

Click to edit the document details