UPRM - ECE Department ICOM5015/ICOM6087/CIIC5015

ICOM5015 – Artificial Intelligence

University of Puerto Rico
College of Engineering
Department of Electrical and Computer Engineering

Name: Student ID:

Instructions
Carefully read these instructions! Seriously!

This exam must be solved individually. Cheating in the exam will be handled according to the regulations
of the University of Puerto Rico.

You have 45 Minutes to solve the exam.

You can use only a sheet of formulas. You are not allowed borrow from or lend to anyone any material. Make
sure your pen has enough ink, or if you use pencil bring your own eraser.

You are not allowed to use calculator or computer – you do not need them anyway.

Turn off your cellular phone to avoid disturbing your classmates and yourself. You must keep it in your
pocket or backpack at all times.

You are not allowed to use any kind of electronic device during the exam – MP3 players, tablet
computers, cellular phones, beepers, laptops, etc. If you take any electronic device in your hands during the
exam, your action may be treated as an attempt to cheat.

Make sure your handwriting is legible. I will make a reasonable effort, when grading, to understand your
answers, but I may take off credit when I cannot fully understand your handwriting.

Suggestions
You may answer the exam in English or Spanish, as you feel comfortable.

If you do not understand a question, ask me for clarification.

State clearly any assumption you may need to solve any problem.

Divide your time proportionately to the points of each problem. If the time you assigned for one question
expires, go on solving another question. You may get partial credit for correct processes towards the
solution of a problem, but only if the process is correct. You may attempt to finish incomplete problem
solutions if you have time left before handing in your exam.

I wish you success!

March 28, 2018 Instructions - i

UPRM - ECE Department ICOM5015/ICOM6087/CIIC5015

Warm up questions
1. Match the correct statements (10 points):
According to the four visions of Artificial Intelligence, an agent that

Passes the Turing test no matter the underlying

Thinks humanly
mechanisms

Acts rationally The laws of thought

Acts humanly Is based on cognitive models

Thinks rationally Attempts to achieve the best expected outcome

2. Only agents in a fully observable environment can be rational (10 points)

TRUE

FALSE

Justify your answer

3. A perfectly rational Tic-Tac-Toe agent always wins (10 points).

TRUE

FALSE

Justify your answer

March 28, 2018 Problems and Solutions - 1

UPRM - ECE Department ICOM5015/ICOM6087/CIIC5015

4. The environment for a Monopoly player agent is (select all that apply) (10 points)

a. Fully observable b. Partially observable

c. Deterministic d. Strategic e. Stochastic

f. Episodic g. Sequential

h. Static i. Semidynamic j. Dynamic

k. Discrete l. Continuous

m. Single agent n. Multiagent

o. Known p. Unknown

q. Competitive r. Collaborative

5. Depth-first is:

Complete TRUE FALSE

Optimal TRUE FALSE

Space Complexity _____________________________________

Time Complexity _____________________________________

Describe and justify any assumptions or constraints for optimality or completeness and
explain the terms for space and time complexity. If needed, give an example or counter-
example to justify your assumptions.

March 28, 2018 Problems and Solutions - 2

UPRM - ECE Department ICOM5015/ICOM6087/CIIC5015

6. Breath-first search is:

Complete TRUE FALSE

Optimal TRUE FALSE

Space Complexity _____________________________________

Time Complexity _____________________________________

Describe and justify any assumptions or constraints for optimality or completeness and
explain the terms for space and time complexity. If needed, give an example or counter-
example to justify your assumptions.

7. Figure 1 shows four graphs where the number inside the nodes represent the value of the heuristic
function ℎ(𝑛) for node 𝑛, an estimation of the distance from node 𝑛 to the goal. The number on the
arcs represents the actual distance function 𝑔(𝑛) traveled along each arc. Write on the side of each
graph if ℎ(𝑛) is admissible or consistent – it could be both or none - (10 points).

March 28, 2018 Problems and Solutions - 3

UPRM - ECE Department ICOM5015/ICOM6087/CIIC5015

Figure 1. Graphs for question 7

March 28, 2018 Problems and Solutions - 4

UPRM - ECE Department ICOM5015/ICOM6087/CIIC5015

Problem
8. Consider the state space shown in Figure 2, where A is the starting state and L satisfies the goal test.
The labels of each arc represent the cost of traversing them. The estimated cost from the node to the
goal node L is given inside each node. For each of the following search strategies, indicate whether
the goal state is reached, and which nodes are in the explored set at the end of the execution. In case
of ties, chose the next node in alphabetical order.

Is ℎ (𝑛) admissible? Justify your answer (5 points).

Is ℎ (𝑛) consistent? Justify your answer (5 points).

Depth-First Search (5 points)

Goal Reached TRUE
(circle choice) FALSE
Nodes in the explored set at the end
Frontier Discipline
Distance of computed route
Iterative Deepening Search (5 points)
Goal Reached TRUE
(circle choice) FALSE
Nodes in the explored set at the end
Frontier Discipline
Distance of computed route
A* (10 points)
Goal Reached TRUE
(circle choice) FALSE
Nodes in the explored set at the end
Frontier Discipline
Distance of computed route

March 28, 2018 Problems and Solutions - 5

UPRM - ECE Department ICOM5015/ICOM6087/CIIC5015

Figure 2. Graph for problem 8

March 28, 2018 Problems and Solutions - 6