Calicut University 2006 B.E Computer Science ARTIFICIAL INTELLIGENCE - Question Paper

C 20280

EIGHTH SEMESTER 13.TECII. (ENGLN'I EIRING) DEGREE
EXAMINATION, JUNE 2006
CS 2K 803. ARTIFICIAL INTELLIGENCE
Time: 11)rce Hours Maximum : 100 Marks

Part A
ans all ques..
1. (a) Write short. notes on forward chaining and backward chaining with suitable example.

(b) Explain the alpha-beta procedure with an example and discuss the search efficiency of it.

(c) Explain about resolution in the propositional calculus.

(d) Define briefly sernantics of quantifiers.

(e) Discuss about the back propagation method.

(f) Explain the phrase-structure grammars in understanding language strings.

(g) Discuss the basic LISP primitives.

(h) Explain the process of implementing substitution sets using association lists.

(8 x five = 40 marks)
Part 11

UNIT I
2. (a) Discuss perception and action components with suitable example.
Or
(b) Write the procedure for algorithm A « and explain the features of it.
(15 marks)

UNIT 11
3. (a) Discuss the steps to convert. arbitrary cuffs to clause form in predicate calculus.
Or
(b) Explain the process of unification and unity algorithm.
(15 marks)

UNIT III
4. (a) Explain the semantic analysis in understanding language strings.
Or
(b) Explain about probabilistic inference in detail.
(l5 marks)

UNIT IV
5. (a) discuss the subsequent :-
(i) Recursion and iteration.
(ii) Predicates.
Or
(b) Write a LISP program to solve the 8-queens issue (.`Vote. No 2 queens are on the identical
row, column or diagonal).
(15 marks)

(4 x 15 = 60 marks)

Earning:   Approval pending.