Student name:

Student ID: Page 1 of 6 IKE 2018

Part I

1. (10 points) We wish to build an agent which will monitor and penguin migration in Antarctica.
So as not to disturb the penguins, it should always stay more than 5m away from all penguins.

a. Describe the environment in which this agent works.

The environment is partially observable, stochastic, dynamic, single-agent,

sequential, continuous

b. What is meant by the term ’performance measure’ with reference to agents, give an example
of an appropriate performance measure for this task.

An objective criterion for success of the agent’s behavior

c. Tessa thinks the agent should be built using a simple reflex based architecture, whereas Tina
thinks a model-based reflex agent would be better. Describe the differences between these
two architectures and explain which is more appropriate in this situation.
Student name:
Student ID: Page 2 of 6 IKE 2018

Reflex is better. Since the environment is partially observable.

2. (8 points) Explain the Turing Test, giving 3 advantages and 3 disadvantages of using this as a
test for Artificial Intelligence.

Page 2
Student name:
Student ID: Page 3 of 6 IKE 2018

3. (10 points) a. Peter and Paul are arguing. Peter says that breadth-first search is better, whereas
Paul says Depth-first. Given the search tree below, show two reorderings of the branches,
one where Peter is right and one where Paul is. Remember to label which is which.

b. Give an example of when branch ordering can be used to improve the search. Explaining
breifly how the branch ordering is decided upon.

Page 3
Student name:
Student ID: Page 4 of 6 IKE 2018

4. (6 points) Rewrite each of these statements as logical statements;

a. There’s no smoke without fire.

b. Everybody needs somebody to love.
c. All good things come to an end.

5. (8 points) a. Given the entropy formula for a two class problem is E(S) = −p+ log2 p+ −
p− log2 p− state the version which can be used for a three class problem.

b. Using the formulas for entropy and information gain (given below) calculate the best split-
ting point for the following dataset, to predict the power of a crane, based on its speed.
Gain(S, A) = E(S) − v∈V alues(A) |S|S|
V|
E(SV ) and SV = {s ∈ S|A(s) = V }
P

Speed Power
1 Low
1 Medium
2 Low
2 High
3 Medium
6 Medium
6 Low
6 High
7 Medium
7 Low
8 Low
8 Medium
9 Medium
9 Medium
10 Low

Page 4
Student name:
Student ID: Page 5 of 6 IKE 2018

6. (8 points) Last month, five webpages had pagerank as shown. Since then some of the links have
changed. Calculate what the new pagerank would be in the first iteration of the algorithm. Which
page/s will change rank in this iteration.
What happens in the next iteration?

Page 5
Student name:
Student ID: Page 6 of 6 IKE 2018

Page 6