FACULTY OF INFORMATION TECHNOLOGY

BACHELOR IN BUSINESS INFORMATION TECHNOLOGY

END OF SEMESTER EXAMINATION
BBT 3201: INTRODUCTION TO ARTIFICIAL INTELLIGENCE CONCEPTS
DATE: 18th November 2019 TIME: 2 Hours
Instructions:
1. This examination consists of FIVE questions.
2. Answer Question ONE (COMPULSORY) and any other TWO questions.

Question ONE
a) Choose the options that are correct regarding artificial intelligence(AI) and machine
learning (ML), (2 marks)
i. ML is an alternate way of programming intelligent machines.
ii. ML and AI have very different goals.
iii. ML is a set of techniques that turns a dataset into a software.
iv. AI is a software that can emulate the human mind to an extent.
b) Which of the following sentence is FALSE regarding regression? (2 marks)
i. It relates inputs to outputs.
ii. It is used for prediction.
iii. It may be used for interpretation.
iv. It discovers causal relationships.
c) An agent is composed of; (2 marks)
i. Architecture and Program
ii. Perception Sequence
iii. Agent Function
iv. Architecture
d) A heuristic is a way of trying (2 marks)
i. To discover something or an idea embedded in a program
ii. To search and measure how far a node in a search tree seems to be from a goal
iii. To compare two nodes in a search tree to see if one is better than the other
iv. Only (a) and (b)
v. Only (a), (b) and (c).
e) Explain two ways in which Mathematics is a foundation of AI. (4 marks)
f) Distinguish between the following;
i. Strong AI and weak AI. (2 marks)
ii. The law of thoughts and rational agent approach to AI. (2 marks)
iii. Deterministic and stochastic task environments. (2 marks)
iv. Utility and simple-reflex agents. (2 marks)
g) Puddleglum, a guitar student spends majority of his time practicing under the guidance of
a music expert with the goal of singing Christmas carols at the end of the year.
i. Define learning. (2 marks)
ii. Using a diagram, explain how g) above fits into the general learning agent. (8 marks)
(Total: 30 marks)

Page 1 of 3
Question TWO
Suppose you’re playing a game of Tic-Tac-Toe with your computer program that uses the
Minimax algorithm to determine the next move. The scoring mechanism is shown below:

• A winning end state is 1 point.

• A losing end state is -1 points.
• A draw state is 0 points.

Consider the figure below representing choices in a two-player game. Perform the minimax
algorithm to establish the choice made by the current player.

It is the computers’ (player X) turn and the board state is as shown below:

O X
X
X O O

Draw the decision tree resulting from the board configuration given above all the way down to
the end states and highlight the choice of move you would pick in the tree.
(Total: 15 marks)

Question THREE
You are designing a menu for a special event. There are several choices, each represented
as a variable: (A)ppetizer, (B)everage, main (C)ourse, and (D)essert.
The domains of the variables are as follows:
• A: (v)eggies, (e)scargot
• B: (w)ater, (s)oda, (m)ilk
• C: (f)ish, (b)eef, (p)asta
• D: (a)pple pie, (i)ce cream, (ch)eese

Because all of your guests get the same menu, it must obey the following dietary constraints:
• Vegetarian options: The appetizer must be veggies or the main course must be
pasta or fish (or both).
• Total budget: If you serve the escargot, you cannot afford any beverage other than
water.
• Calcium requirement: You must serve at least one of milk, ice cream, or cheese.

a) Draw the constraint graph over the variables A, B, C, and D. (7 marks)

b) Imagine we first assign A=e. Cross out eliminated values to show the domains of the
variables after;
A e
B w s m
C f b p
D a i ch
i. DFS (2 marks)
ii. DFS with forward checking. (6 marks)
(Total: 15 marks)

Page 2 of 3
Question FOUR
a) Consider the following Bayesian network where N = having pneumonia and F = fever.The
domain of N and F is {+,-}.Compute P(F | N=-) using inference by enumeration and
Bayes rule. (8 marks)

b) Consider the factorized joint probability

P(A,B,C,D) = P(D|B,C) x P(C|A) x P(B|A) x P(A)
i. Draw the corresponding Bayesian network. (2 marks)
ii. State whether the following are true given the bayes net in i above.
i. A ⊥ D (1 mark)
ii. B ⊥ C | A (2 marks)
iii. B ⊥ C | D (2 marks)
(Total: 15 marks)

Question FIVE
a) Consider the following state space graph with an initial state of A and goal G. The
heuristics are given in the table below.

state h(n)
A 6
B 3
C 4
D 3
E 3
F 4
G 0
H 1

Solve (a) using the GBFS and A* algorithms.

Note : Use a closed set,show all generated successors and break ties in alphabetic order.
(Total: 15 marks)

_____ End of Examination _____

Page 3 of 3