Computer Science 188 - Spring 1997 - Hansson - Midterm 1

Computer Science 188 - Spring 1997 - Hansson - Midterm 1 -...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 188, Midterm, Spring 1997 CS 188, Spring 1997 Midterm Professor Hansson Problem #1 (10 points) You've been assigned to proofread a new AI textbook by Prof. Victor Bogon from the University of Kansas at Oceanview. Indicate whether Prof. Bogon's statements below are true or false: 1. "Alpha-beta pruning is a way to speed up the Minimax algorithm, but in some cases, may cause you to choose a worse action/operator." 2. "Minimax requires an admissible heuristic." 3. "With an admissible and consistent heuristic, A* finds the shortest-path solution to a goal state." 4. "If a sentence is satisfiable, it is also valid." 5. "The sentence P->Q is valid." 6. "The sentence P->Q is satisfiable." Problem #2 (10 points) Prof. Bogon's memory is very bad. Answer the following questions for him. One or two sentences should be enough for each answer. 1. What does a "table-driven agent" do, and what are its inputs and outputs? 2. What does it mean to "expand a state" in a search algorithm? 3. What is a "sound" inference procedure? What is a "complete" inference procedure? 4. What is "conjunctive normal form"? Problem #3 (5 points) file:///C|/Documents%20and%20Settings/Jason%20Raft. ..0Spring%201997%20-%20Hansson%20-%20Midterm%201.htm (1 of 11)1/27/2007 5:22:39 PM
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS 188, Midterm, Spring 1997 In the following state-space graph, Prof. Bogon has labeled the nodes with heuristic function values. The start and goal state(s) are labeled S and G. You are to check whether the heuristic function is admissible or not. If it is not admissible, indicate the smallest set of heuristic-values which would have to be changed to make it admissible. All operator-costs are equal to 1. Note that the operators are directed, as indicated by the arrows. Admissible? Circle either YES or NO If the heuristic is not admissible, which heuristic values would you change to make it admissible: _____ Problem #4 (5 points) Represent the following statements in FOL (first-order logic). 1. "All Germans speak the same languages." [Use Speaks(x,l) to mean that person x speaks language l.] 2. "Only one unicorn exists." 3. "More than one unicorn exists." 4. "There exist exactly two unicorns." Problem #5 (15 points) file:///C|/Documents%20and%20Settings/Jason%20Raft. ..0Spring%201997%20-%20Hansson%20-%20Midterm%201.htm (2 of 11)1/27/2007 5:22:39 PM
Background image of page 2
CS 188, Midterm, Spring 1997 In this problem, you will apply different search algorithms to the same search tree. The start state is denoted by S and the goal state by G. You are to number the nodes in the tree according to the order in
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/17/2009 for the course CS 188 taught by Professor Staff during the Spring '08 term at University of California, Berkeley.

Page1 / 11

Computer Science 188 - Spring 1997 - Hansson - Midterm 1 -...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online