Artificial Intelligence - May 2016

Computer Engineering (Semester 7)

TOTAL MARKS: 80
TOTAL TIME: 3 HOURS (1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Assume data if required.
(4) Figures to the right indicate full marks.

Attempt any four (4) questions from the following

1(a) Draw and explain architecture of Expert System.(5 marks) 1(b) Explain Hill-climbing algorithm with an example.(5 marks) 1(c) Give PEAS description for a Robot Soccer player. Characterize its environment.(5 marks) 1(d) Explain Turing test designed for satisfactory operational definition of intelligence.(5 marks) 1(e) Prove that A* is admissible if it uses a monotone heuristic.(5 marks) 2(a) Explain decision tree learning with an example. What are decision rules? How to use it for classifying new samples?(10 marks) 2(b) Write first order logic statement for following statements:
(i) If a perfect square is divisible by a prime p then it is also divisible by square of p.
(ii) Every perfect square is divisible by some prime.
(iii) Alice does not like Chemistry and History.
(iv) If it is saturday and warm, then Sam is in the park.
(v) Anything anyone eats and is not killed by is food.(10 marks) 3(a) Design a planning agent foa a Blocks World problem. Assume suitable initial state and final state for the problem.(10 marks) 3(b) Find the probability inference by enumeration of entries in a full joint distribution table shown in figure 1.
(i) No cavity when toothache is there
(ii) p (Cavity toothache or catch)

4(b) Apply alpha-Beta pruning on example given in Figure 2 considering first node as max.

(10 marks)

5(b) Consider the graph given in Figure 3 below. Assume that the initial state is A and the goal state is G Find path from the initial state to the goal state using DFS. Also report the solution cost.

(10 marks)