PRACTICE TEST QUESTIONS

Problem 1 - Chapter 1 - Introduction

Define and contrast the terms dualism and materialism.

Problem 2 - Chapter 2 - Intelligent Agents

Part A

Determine what type of agent architecture is most appropriate for the following environments and defend your choice:

��������������� Playing the stock market

������� Restocking the shelves of the HU bookstore

Part A

Write a PAGE description for each agent.� Characterize the environments as being accessible, deterministic, episodic, static, and continuous or not.

Problem 3 - Chapter 3 - Problem Solving by Searching

Assume the following search space for your first class in a new building on campus.� The cost is the number of paces between each room.

State Name	Next-State Name	Cost
Room A	Room B	4
Room A	Room C	1
Room B	Room D	3
Room B	Room E	8
Room C	Room C	0
Room C	Room D	2
Room C	Room F	6
Room D	Room C	2
Room D	Room E	4
Room E	Room G	2
Room F	Room G	8

Part A

Draw this search space as a directed graph (i.e. states are nodes and actions are directed arcs, labeled with their costs.

Part B

For each of the following, during each cycle of the search algorithm show the subtree.

• Breadth-First Search
• Depth-First Search
• Uniform-Cost Search
• Iterative Deepening

The START STATE is Room A and the GOAL STATE is Room G. When multiple nodes tie for their turn to search, they should be searched in alphabetical order front-to-back (ie, left-to-right). eg, after the first cycle of breadth-first search, the subtree should look like:

	Room A
	Room C
Room B

Problem 4 - Chapter 4 - Creating a Search Space

Note: this is a paper-and-pencil question.

Consider the following list of words:

���� CAB CAD CAT COD CUD DAB HAT ROB ROD ROT

and the following puzzle:

���� Change "cat" to "rob" by changing only one letter at a time, 
�����and using only words contained in the above list as intermediaries.� 

You may consider this as a search task with "cat" as the start node and "rob" as the goal node. Draw the complete search space. Also propose and justify a good heuristic function (h) for this task. Finally, show how best-first search could be used to solve this puzzle. (Just use f=h as your scoring function.)