MCA-2105
2015/I/O2
M.C.A. DEGREE EXAMINATION
Second Year-First Semester
ARTIFICIAL INTELLIGENCE
(Effective from the admitted batch of 2000-2001)

Time : Three Hours
Maximum: 75 Marks

First question is compulsory.
Answer any four from the remaining questions.
All questions carry equal marks.

Write all parts of the first question at one place.

1. Answer the following :- (10 x 1 1/2 15 marks) (a) What is an Al technique ?
(b) What is a heuristic function?
(c) Define a Clause
(d) What is Means-Ends analysis?
(e) State the relationship between the terms "Intelligence" and "Knowledge'.
(f) Define the term "fact" and "rule"
(g) What is back tracking ?
(h) What is fuzzy logic ?
(i) State physical symbol system hypothesis.
(j) What is a certainty factor?

2. Explain state space approach in solving any Al problem. Discuss this for water jug problem. (15 marks)

3. (a) Discuss the steps needed to convert a wff in predicate logic into clause form. (10 marks)

(b) Convert the following sentence into wff in predicate logic and convert it into clause form. Anything any one eats and isn't killed by is food (5 marks)

4. What is problem reduction? Explain AO* algorithm to tackle And-Or graphs. (15 marks)

5. (a) With a suitable example explain how TMS works. (7 marks)

(b) With suitable examples explain the advantages of script based representation over semantic nets. (8 marks)

6. (a) Explain briefly RFTE matching algorithm. (5 marks)

(b) With examples explain how unification algorithm works. (10 marks)

7. Discuss the following (5 marks each)
(a) AI programming vs Conventional programming.
(b) Hill climbing.
(c) Bayesian networks.

8. (a) Explain the operation of 'cut' and 'fail' predicates in PROLOG. (10 marks)

(b) Write a PROLOG program to reverse a given list of elements. (5 marks)