University of Mumbai 2005-1st Sem B.E Computer Science 6th ntelligent Systems - 2006 - Question Paper

Time : three Hrs.] [Marks : 100
N.B. :
(1) ques. No.1 is compulsory.
(2) Attempt any 4 ques. out of the remaining 6 ques..

1. What do you mean by Intelligent Agent, discuss Simple Reflex, Model based, Goal based, utility based and
learning agent. State limitation of every and how it is overcome in a different kind agent. [20]

2. (a) How Best 1st Search will be applicable to 8-Puzzle game. [10]
(b) What do you mean by PEAS ? discuss properties of Task environment. [10]

3. (a) define Hill Climbing Search Algorithm, elaborate issues faced by Hill Climbing Search ? Suggest
method for every issue to overcome. [10]
(b) discuss Alpha-Beta Pruning in Min-Max Search. Why it is suitable for 2 player games. [10]

4. Consider subsequent statements
John likes all types of food
Apples are food
Chicken is food
Anything anyone eats and isn’t killed by is food
Bill eats peanuts and still alive
Sue eat every thing Bill eats
(a) Write algorithm to convert wff into cnf Translate above statement into formulas in predicate logic. [10]
(b) i) Convert formulas in clause from for provided set of statements. [10]
ii) Prove “John likes peanuts” using resolution.

5. (a) How planning issue is represented ? discuss with suitable example. [10]
(b) discuss features of PROLOG & LISP, write any 1 program in either LISP or PROLOG. Why these
languages are suitable for AI or IS ? [10]

6. (a) discuss Supervised, unsupervised and reinforcement learning with examples. [10]
(b) discuss typical steps for Natural Language Processing for written sentence. State example in which NLP
can be applied effectively. [10]

7. Write detail note on (any two) : [20]
(a) Expert system : Components and development
(b) Learning with neural network
(c) Intelligent Systems Applications

Earning:   Approval pending.