DEPARTMENT OF INFROMATION TECHNOLOGY / SOFTWARE ENGINEERING

Artificial Intelligence - BSEH351

Assignment 2

INSTRUCTION TO CANDIDATES

This paper carries five (4) questions. Answer ALL.

All questions carry 25 marks
Marks are indicated in brackets at the end of each question. Total marks are 100.
Question 1
What is intelligence? How do we measure it? Are these measurements useful? [3]
What would convince you that a given machine is truly intelligent? [2]
What is an autonomous rational agent? [2]

(a) The field of Artificial Intelligence emerged from a number of older disciplines.
List the three that you think are most important, and explain why. [6]

(b) Describe two examples (from different sub-fields of AI) where scientific models of
human intelligence have led to useful real world applications. [4]

Things that might come under the heading “AI” are increasing being incorporated into
everyday systems and devices. Discuss the use of AI techniques in:
a. Word processing/typesetting systems.
b. Mobile phones.
c. Web-based shopping sites.
d. Photocopier machines. [8]
Question 2

(a) What is meant by “Weak AI” and “Strong AI”? Do you think the distinction is
useful? [3]
(b) How do you think artificial neural network systems fit in with the above definitions
and classifications? What level of achievement is required of an artificial neural
network before you would accept it as an example of AI? [4]

Knowledge Representation

(c) Study the following Semantic Network below

Represent the semantic network in

i. Natural Language [2]
ii. Prolog syntax [6]

Represent the following knowledge in a series of semantic frames [10]

Question 3: N-Queens Problem

N-Queens is a combinatorial problem based on chess. Regarding queens can attack

vertically, horizontally, and diagonally in chess, N-Queens problem asks:
How can N queens be placed on an NxN chessboard so that no two of them attacks
each other?

(a) Write a back tracking algorithm to solve the n-queens problem [10]
(b) Demonstrate the n-queens problem solution and solve them via Hill Climbing
[10]
(c) Describe the Alpha-Beta Pruning Algorithm [5]
Question 4:

Translate the following sentence into First Order Logic.

(a) Every rose has thorn [3]

Search Strategies

(b) Define a heuristic function [2]

Consider the above Facebook network graph, where each node represents a Facebook
user and the links represent a friend –friend relation. If you can weight a node(user) by
the number of links (friends he/she makes) emanating from that node. i.e. if a person
has 5 friends then the weight of that person is 5 respectively.
(c) If you were engineer at Facebook designing an AI to link people, device your own
heuristic function you can use to make friend suggestions to Facebook users.
You may use the weights or otherwise. [5]
(d) Illustrate how you can use the heuristic to suggest a relationship between Peter
and Susan [5]
(e) Illustrate how the same solution can be achieved using

1. British Museum [5]

2. Breadth first Search [5]