BSc (Hons) Computer Science with Network Security BSc (Hons) Web Technologies

Cohorts: BCNS/08/FT & BWT/08/FT

Examinations for 2010 2011 / Semester 1

MODULE: Artificial Intelligence
MODULE CODE: SCG3112 Duration: 2 Hours 30 minutes

Instructions to Candidates:
1. This paper contains four questions. 2. Answer all four questions. 3. Always start a new question on a fresh page. 4. Total marks 100. 5. Questions may be answered in any order but your answers must show the question number clearly. This question paper contains 4 questions and 4 pages.

Page 1 of 4 2010/S1

QUESTION 1: (25 MARKS)

a) What does a computer need in order to pass the Total Turing Test? (4 marks)

b) Explain the term Cognitive Modelling Approach. (6 marks)

c) Define four points to support what is rational at any given time. (8 marks)

d) Draw the complete diagram to demonstrate the Utility-Based Agents. (7 marks)

QUESTION 2: (25 MARKS)

a) Name and describe the four main dimensions on which strategies can be evaluated in Search Strategies. (8 marks) b) Explain in detailed about the drawback of the Depth-First Search. (4 marks)

c) Describe the term Evaluation Function. (3 marks)

d) The Minimax Algorithm is designed to determine the optimal strategy for MAX, and thus to decide what the best move is. Describe the five steps of this algorithm. (10 marks)
Page 2 of 4 2010/S1

QUESTION 3: (25 MARKS)

a) The object of knowledge representation is to express knowledge in computer-tractable form, such that it can be used to help agents perform well. A knowledge representation language is defined by the Syntax and the Semantics. Differentiate between Syntax and Semantics. (6 marks) b) Distinguish between Ontological Commitments and Epistemological

Commitments. (6 marks)

c) A useful analogy can be made between knowledge engineering and programming. Both activities can be seen as consisting of four steps. What are they? (8 marks)

d) Taking a grocery shopping domain as an example, explain how would you break it down into smaller clusters of knowledge, work on each cluster separately and then examine how they fit together. One good way of decomposing the domain into clusters is to consider the tasks facing the agent. Give the name you would choose after dividing the domain into five clusters. (5 marks)

QUESTION 4: (25 MARKS)

a) A famous problem in mathematics concerns colouring adjacent planar regions. Like cartographic maps, it is required that, whatever colours are actually used, no two adjacent regions may not have the same colour. Two regions are considered adjacent provided they share some boundary line segment. Consider the following map below.

Page 3 of 4 2010/S1

i) ii)

Draw a graph to show how would you represent the said regions. Write down a Prolog representation to represent your above information by unit clauses, or facts.

iii)

How would you declare colourings for the regions in Prolog also using unit clauses.

iv)

Write a Prolog definition of a Conflictive colouring, meaning that two adjacent regions have the same colour. Write another version of conflict that has more logical parameters.

v)

(4 + 8 + 6 + 3 + 4 marks)

***END OF QUESTION PAPER***

Page 4 of 4 2010/S1