UNIVERSITY EXAMINATIONS

September/October/November 2022

COS3751
Techniques of Artificial Intelligence

100 Marks

Duration 2 Hours
EXAMINERS:
FIRST: Prof F Bankole
SECOND: Prof E van der Poel
EXTERNAL: Prof S Viriri

Use of non-programmable calculator is permissible

Take home examination

This paper consists of 8 pages.

Instructions
1. You are expected to provide your own answers to the questions. Getting
answers from the Internet (or other sources) could result in disciplinary
action.
2. You may type your answers in a word processor (and then print to PDF for
submission) or handwrite your answers (and then scan to PDF).
3. Answer all questions.
4. The mark for each question is given in brackets next to each question.
5. Read each question carefully before answering: always make sure you
provide an answer to what is being asked.
6. Follow the instructions as sent to you by the university to submit your
answers.
7. Make sure you leave yourself enough time to upload your answers before
the end of the allowed time.
Remember to complete the Honesty Declaration when submitting your
answers. By submitting your answers, you are confirming that this is your
own, unaided work.

[TURN PAGE]
 COS3751
QUESTION PAPER 2 October/November 2022

Question 1 Intelligent Agents & State Space [15]

(a) Explain the term “fully observable environment” in Artificial Intelligence. (5)
(b) What is deterministic or stochastic environment? Describe your response using a game of chess. (5)
(c) Distinguish between discrete and continuous environment. Give an example of each. (5)

[TURN PAGE]
 COS3751
QUESTION PAPER 3 October/November 2021

Question 2 Searching [17]

(a) Define the concept abstraction and why is it important in state description? (3)
(b) Considering the following diagram:

(i) Employing an A-star search, where L is the goal whereby there is horizontally and vertically movement
and the cost to move from one square to the next is 1 while employing Manhattan-distance heuristic.
Supposing the start node is S. Calculate the frontier after S is expanded. Include f, g, h values for each
node place in the frontier. (6)
(ii) Identify all nodes that will be expanded using A-star search? (8)
 COS3751
QUESTION PAPER 4 October/November 2021

Question 3 Adversarial Search [12]

Consider the game tree in Figure 2 and then answer the questions that follow. (The static utility
values for the leaf nodes are provided below each leaf node, and node A is a MAX node.)

(a) Provide the backed-up utility values for all the non-leaf nodes in the tree if a minimax search is
performed. (4)
(b) Suppose that alpha/beta pruning is applied during the search. Write down the α and β values
associated with nodes B, E, F and G (after the search completes). NB: Write down the node as
well as the α and β values for that node. The search should use left to right order. (6)
(c) Is there any benefit in applying alpha/beta pruning to this search? (2)
 COS3751
QUESTION PAPER 5 October/November 2021

Question 4 Constraint Satisfaction Problems [19]

Consider the following cryptarithmetic puzzle:

S U N
+ M O O N
P L U T O

Re-write the puzzle in terms of a Constraint Satisfaction Problem (CSP).

(a) Define the variables for the puzzle. (2)

(b) Define the constraints on the variables. (6)
(c) What is the meaning of the term “minimum remaining values (MRV)” heuristic and “usefulness” in the
constraint satisfaction problem. (3)
(d) Provide the solution to this cryptarithmetic puzzle problem. Show all your steps and calculations. (8)
 COS3751
QUESTION PAPER 6 October/November 2021

Question 5 Resolution Refutation [22]

The following statements are specified in English:

1. Whatever anyone eats and is not poisoned by it is called food.

2. Mark drinks any type of drink.
3. Orange juice is a drink.
4. Chicken is food.
5. Bill eats peanuts and is not poisoned by it.
6. Dora eats all that Bill eats.

(a) Convert the statements to First Order Logic statements. The first statement has been shown below as
example. Convert the rest using a standardized variable. (6)
1. ∀y,z[eats(y,z)∧￢poisoned from eating(y,z)⇒food(z)]

(b) Convert all of the FOL statements above to Conjunctive Normal Form (CNF) (including the statement
that was provided). Hint: Please ensure all the statement are in CNF. (7)
(c) Employ resolution refutation to prove that Mark eats peanuts, using the assumptions provided in the
paragraph above. (9)
 COS3751
QUESTION PAPER 7 October/November 2021

Question 6 Machine Learning [15]

Consider the following data in Table 1, which comprises of three binary input attributes (A1, A2, and A3), and
one binary output y:

Example A1 A2 A3 y
X1 0 1 0 0
X2 0 1 1 0
X3 1 0 0 0
X4 1 1 1 1
X5 1 1 0 1

Table 1: Data Set

Using the principles of Information Gain build a decision tree for the data. Show the computations made to
determine the attribute to split at each node. Use the table A for the entropy calculations. Also show the
decision tree: branch and leaf nodes, as well as edges and appropriate labels for the edges. (15)
 COS3751
QUESTION PAPER 8 October/November 2021

Entropy Table

©
UNISA 2022