finalF04

FinalF04 - COMS W4701y Artificial Intelligence FINAL EXAM December 21st 2004 Name UNI DIRECTIONS This exam is closed book closed notes closed

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

View Full Document Right Arrow Icon
COMS W4701y: Artificial Intelligence FINAL EXAM December 21 st , 2004 Name: UNI: DIRECTIONS This exam is closed book, closed notes, closed laptop, closed calculator and closed cell phone. It consists of three parts. Each part is labeled with the amount of time you should expect to spend on it. If you are spending too much time, skip it and go on to the next section, coming back if you have time. Point value of individual questions also bears on amount of time. The first part is multiple choice. The second part is short answer. The third part is problem solving and it includes one essay. Note: longer problem and essay are last two questions. Save enough time for the end. Important: Answer Part I by circling answers on the test sheets and turn in the test itself. Answer Part II on the test sheet itself. Use a separate test booklet for each question in Part III. Part I – Multiple-choice questions. 16 points total. 15 minutes. Circle the one answer that best answers the question. 1. Given a choice between moves A and B in the following tree, which would minimax choose (assuming MAX is to move at the root)? a. A b. B 2. The results of exhaustive backward-chaining (to find all solutions) are independent of the search order a. T b. F 50 50 50 50 49 200 A B 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
3. Every partial-order plan with no open conditions and no possible threats has a linearization that is a correct solution a. T b. F 4. Which of the following statements is not true of Bayesian learning? a. Prior knowledge can be combined with observed data to determine hypotheses b. They can accommodate hypotheses that make probabilistic predictions c. It is computationally feasible to estimate the required probabilities by counting in training data d. New instances can be classified by combining the predictions of multiple hypotheses, weighted by their probabilities 5. You are given a vocabulary with three propositions, A,B and C. How many models are there for the sentence (A B) V B? a. 6 b. 8 c. 3 d. 2 6. P lanning and constraint satisfaction are alike in that they both a. are more efficient than A* search b. allow for the use of domain-independent heuristics that exploit structure c. can be used for game playing as well as problem solving d. are a good algorithmic fit for solving crossword puzzles 7. An ontology a. provides a vocabulary for expressing knowledge b. uses frames for hierarchical inferencing c. is more promiscuous than perspicacious d. represents relations, objects and properties 8. Local search, such as hill-climbing, a. operates using many current states b. uses more memory than depth-first search 2
Background image of page 2
c. is not suited for pure optimatization problems d. does not retain the paths followed by search Part II. Short Answer.
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 12/17/2011 for the course CS cs47 taught by Professor Sav during the Fall '04 term at Columbia.

Page1 / 12

FinalF04 - COMS W4701y Artificial Intelligence FINAL EXAM December 21st 2004 Name UNI DIRECTIONS This exam is closed book closed notes closed

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