Uniform-Cost - Artificial Intelligence - Exam, Exams of Artificial Intelligence

Main points of this exam paper are: Uniform-Cost, Formulation, Internal State, Rational Agent, Model-Based Agent, Omniscient Agent, Intelligent Agent

Typology: Exams

2012/2013

Uploaded on 04/08/2013

lakshanya
lakshanya 🇮🇳

4.4

(25)

98 documents

1 / 10

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
C P E / CSC 4 8 0 A R T I F I C I A L
I N T E L L I G E N C E
M I D T E R M E X A M
FA L L 2 0 0 4
PRO F. F RA NZ J. K UR FE SS
CAL PO L Y, C O M PUTE R SC I E N C E DE P A R TM E N T
This is the Fall 2004 midterm exam for the CPE/CSC 480 class. You may use textbooks,
course notes, or other material, but you must formulate the text for your answers yourself.
The use of calculators or computers is allowed for viewing documents or for numerical
calculations, but not for the execution of algorithms or programs to compute solutions for
exam questions. The exam time is 80 minutes.
Student Name:
Signature:
Date:
pf3
pf4
pf5
pf8
pf9
pfa

Partial preview of the text

Download Uniform-Cost - Artificial Intelligence - Exam and more Exams Artificial Intelligence in PDF only on Docsity!

C P E / C S C 4 8 0 A R T I F I C I A L

I N T E L L I G E N C E

M I D T E R M E X A M

FA L L 2 0 0 4

PRO F. FRA N Z J. KU RF ES S

CAL PO L Y, COM P UTE R SC IEN CE DE PA RT MEN T

This is the Fall 2004 midterm exam for the CPE/CSC 480 class. You may use textbooks, course notes, or other material, but you must formulate the text for your answers yourself. The use of calculators or computers is allowed for viewing documents or for numerical calculations, but not for the execution of algorithms or programs to compute solutions for exam questions. The exam time is 80 minutes.

Student Name:

Signature: Date:

PA RT 1: MU LTIP LE CH OI CE QUE S TIO NS

Mark the answer you think is correct. There is only one correct answer. Each question is worth 3 points. a) Which event is considered the "birth" of the field of Artificial Intelligence?

❑ The formulation of the Turing test by Alan Turing in 1950.

❑ A workshop in the summer of 1956 at Dartmouth.

❑ The development of the Lisp programming language in 1958.

❑ The victory of the Deep Blue computer system over the chess world champion, Gary Kasparov, in

b) What is the main difference between an intelligent program and an intelligent agent?

❑ A program must be compiled first, whereas an agent is directly executable.

❑ An agent is mobile, whereas programs are stationary.

❑ An intelligent agent is autonomous, and can perform tasks largely independently.

❑ A program is a syntactical entity, whereas an agent is a semantic entity.

c) Which statement is the best characterization of rational agents?

❑ The formulation of algorithmic descriptions of building blocks for intelligent systems.

❑ The formal specification of abstract reasoning mechanisms for systems that represent and

manipulate knowledge.

❑ The construction of systems that exhibit behaviors necessary for solving tasks requiring

intelligence.

❑ An attempt to describe the way the human mind functions.

d) Which term is also used to characterize an agent with an internal state?

❑ Rational agent.

❑ Model-based agent.

❑ Omniscient agent.

❑ Intelligent agent.

e) Which of the following statements is the best characterization of a static environment?

❑ an environment that does not change while the agent is deliberating

❑ an environment that does not change through the lifetime of an agent

❑ the agent does not perceive any changes during a certain time, although changes may occur that

the agent is not capable of picking up with its sensors

❑ an environment that can only be changed through actions of the agent itself

PA RT 2: SHO RT QUE S TIO N S

In this part of the exam, you should answer the questions in about one paragraph per aspect.

  1. At a first glance, the iterative deepening search method seems to involve a substantial amount of repeat work by re-constructing the search tree from scratch each time. a. Why is this not as bad as it seems? 10 points b. Under which circumstances will iterative deepening perform much worse than depth-first search? 5 points
  1. What is the basic principle of bidirectional search? What are some necessary conditions for its use? What are possible benefits over other search algorithms? 15 points  Basic principle:  Necessary conditions:  Potential Benefits:

Step Current Node Path Cost Heuris- tic F-Cost Frontier (Queue) 0 SLO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

SLO San Fran. Denver Dallas Las Vegas Los Ang. Phoenix Houston Austin 240 201 418 369 1188 1558 1446 1331 1827 756 1271 887 196 163 243 b. Traverse the graph from the starting point San Luis Obispo to the goal Austin according to the A* Search method with the straight-line distances as heuristic (see table on p. 9). Draw the tree and complete the table. [20 points]

c. What is the effect of using miles for path costs and kilometers for the heuristic in the A* algorithm? Is this a serious problem (e.g. resulting in incorrect results)? [5 points]

Total Points: