West Bengal Institute of Technology (WBIT) 2008 M.C.A 303 Intelligent Systems ( ) - Question Paper

iv)    The study of the nature of the knowledge is called

a) belief    b) hypothesis

c) epistemology    d) meta-knowledge.    _H

v) The process of adding new knowledge to a knowledge-base and refining or improving knowledge that was previously acquired is called

b) knowledge representation

d) none of these.

vi)    If in a problem the number of initial states is much more than the goal states, we should use    .

a)    forward reasoning

b)    backward reasoning

c)    both forward and backward reasonings

d)    none of these.    

vii)    Inheritable knowledge is best represented by

a) semantic net    b) database

c) first order logic    d) none of these.    _

viil) Decomposable problem can be represented by

a) OR-Graph    ' b) AND-Graph

c) AND-OR Graph    d) None of these.    |

ix) The space complexity of the Depth-First search ( b-branching factor, d-depth ) is

a) 0(b^d)

d) 0(d^b).

x) Skolem function is used in

a) unification algorithm

c) conversion to clause form d) none of these.

gtaay>.

GROUP -B ( Short Answer Type Questions )

Answer any three of the following.    3x5=15

2.    What is state space ? Discuss four properties of search algorithm.    1+4

3.    What is predicate logic ? What is Skolem Function ?    2 + 3

4.    What is Modus Ponens Rule ? A game tree is basically an AND/OR graph." Justify the statement.    2 + 3

5.    Compare between the heuristic and non-heuristic searching principles. Explain the pros and cons of any one of the commonly used heuristic search mechanisms. 2 + 3

6.    Give physical interpretation with apprdpriate example of forward tracking and backtracking with reference to searching principle. Give example of a practical expert system that makes use of both these principles at different search points as the search progresses.    3 + 2

GROUP -C ( Long Answer Type Questions )

Answer any three of the following questions.    3 x 15 = 45

7.    a) Write down the computational steps of Best-first search.    6

b)    What is the difference between blind and informed search ?    5

c)    What is plateau ? How is it overcome ?    4

8.    a) You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any

measuring markers on it. There is a pump that can be used to fill the jugs with water. How can you get exactly 2 gallons of water into the 4-gallon jug ? Write down the production rules and control strategy.    10

b) When will A * give optimal solution ?    5

9.    Consider the game tic-tac-toe. MAX gives cross ( x ) and MIN gives circle ( O ). Assume MAX will give first move.    .

a)    Draw the game tree ( considering the winning strategy of MAX ).    10

b)    How does a - p pruning procedure improve search space ?    5

10.    0 What is Bayes theorem ?    , 2

b)    When one has a cold, one usually has a high temperature ( 80% of the time ). At any one time around 1 in every 10,000 people has a cold and that 1 in every

. 1,000 people has a high temperature. Now suppose that you have a high temperature. What is the likelihood that you have a cold ?    9

c)    Write a PROLOG or LISP program to search an element in a list,    4

11.    a) Using the resolution principle, prove that all lecturers are determined. Any one

who is determined and intelligent will give good service. Mary is an intelligent lecturer. Show that Mary will give good service.    6