CS - 702

Name : ……………………………………………………………
htt
Roll No. : ……………………………………………..…………..
Invigilator’s Signature : ………………………………………..
CS/B.Tech (CSE)/SUPPLE/SEM-7/CS-702/2010
p:/
2010
ARTIFICIAL INTELLIGENCE
Time Allotted : 3 Hours Full Marks : 70
/q
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words
pap
as far as practicable.
GROUP – A
( Multiple Choice Type Questions )
er.
1. Choose the correct alternatives for the following : 10 × 1 = 10
i) Inheritable knowledge is best represented by
a) Semantic net b) SOPL

wb
c) Database d) none of these.
ii) Decomposable problem can be represented by

ut .
a) OR graph b) AND graph
c) AND-OR graph d) none of these.
iii) According to MOUS PONENS INFERENCE rule from P

a c.
and P → Q infer
a) P b) Q
c) P d) Q.
in
SE-47 [ Turn over

! !
iv) If in a problem the number of initial states is much

htt
more than the number of final states we should use
a) forward reasoning
p:/
b) backward reasoning
c) both of these
/q
d) none of these.
pap
v) A Baysian network is a
a) Tree
b) Directed graph
er.
c) Undirected graph
d) None of these.
wb
vi) Dependency directed backtracking is
a) better b) always better

ut .
c) can’t be said d) none of these.
vii) Time complexity of BFS is

a c.
a) O bd
( ) b) ed
c) eb d) O db .
( )
in
!
!
SE-47 ! 2
!
viii) The space complexity of DFS is

htt
a) O(d) b) O(b)
c) O bd
( ) d) O db .
( )
p:/
! !
ix) Which of the following algorithms does not face local

! !
/q
maxima problem ?
pap
a) Simple hill climbing
b) Steepest ascent hill climbing

er.
c) Best first
d) None of these.
wb
x) Which is not heuristic search ?
a) Hill climbing
ut .
b) Simulated annealing
a c.
c) Constraint satisfaction search
d) Best first search.

in
SE-47 3 [ Turn over

GROUP – B
htt
( Short Answer Type Questions )
Answer any three of the following. 3 × 5 = 15
2. a) Define the term ‘production system’.

p:/
b) What are the AI techniques ?
c) Define control stategy. 2+2+1

/q
3. a) How does forward reasoning differ from backward

pap
reasoning ? Explain with suitable example.
b) What do you mean by completeness of a search ? Why
is DFS not always complete ? 3+2

er.
4. “A game tree is basically AND-OR graph.” Justify the
statement.
wb
5. Write a program in prolog or lisp to find the gcd of
n numbers.
ut .
6. a) What is perception ?
b) Define intelligent agent. Explain different types of

a c.
environment related to intelligent agent.
c) How does procedural knowledge differ from declarative
knowledge. 1+2+2
in
SE-47 4
GROUP – C
htt
( Long Answer Type Questions )
Answer any three of the following. 3 × 15 = 45
7. a) Discuss and compare

p:/
i) Hill climbing
/q
ii) Best-first search
techniques.
pap
b) Explain with an example of admissible heuristic for
8-puzzle game.
8. a) What is expert system ? Why is it required ?

er.
b) Write a prolog or lisp clause for having DOUBLE (L,LL).
Every element in list L appears twice in list LL. For

wb
example DOUBLE ([1,2,3],[1,1,2,2,3,3]) is true.
c) Given the following text :

ut .
“Everyone who enters in a theatre has to buy a ticket.
Person who does not have money can not buy a ticket.
a c.
Vinod enters a theatre.”
Prove by resolution that “Vinod buys a ticket”.

5+7+3
in
SE-47 5 [ Turn over

9. The missionary and unbelievers problems 3 missionary and

htt
3 unbelievers stand at the left bank of the river. They wish to
cross the river. There is a small boat ( without boatman ) to
ferry them across but it holds at most 2 persons. Whenever

p:/
there are more missionary than unbelievers on either bank of
the river the missionary will convert the unbeliever. The

/q
probe is to find whether there is any possible sequence of
ferryings for the 6 persons to cross the river without any of

pap
the unbelievers getting converted.
a) Formulate the problem as a state space search problem

er.
b) Draw the implicit search graph.
c) Does there exist any solution to the problem ? If so,

wb
specify the solution, otherwise clearly explain why there
is no solution.
10. a) State whether the statement “In the worst case the no.
ut .
of nodes expanded by best first algorithm ( U cost ) is
the no nodes in the explicit graph” — is true or false ?

a c.
b) What is an admissible heuristic ? Is it possible for A✳ to
output optimal solution if heuristics are inadmissible ?
Explain. 7+8
in
SE-47 6
11. Write short notes on any three of the following : 3×5

htt
a) Local maxima & Global maxima
p:/
b) State space representation
c) Semantic net
/q
d) Dempster-Shafer Theory
pap
e) Minimax search procedure.

er.
wb
ut .
a c.
in
SE-47 7 [ Turn over

CS - 702

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CS - 702

Uploaded by

Copyright:

Available Formats

Name : ……………………………………………………………

1. Choose the correct alternatives for the following : 10 × 1 = 10

i) Inheritable knowledge is best represented by

a) Semantic net b) SOPL

c) Database d) none of these.

ii) Decomposable problem can be represented by

a) OR graph b) AND graph

c) AND-OR graph d) none of these.

iii) According to MOUS PONENS INFERENCE rule from P

SE-47 [ Turn over

iv) If in a problem the number of initial states is much

vi) Dependency directed backtracking is

a) better b) always better

c) can’t be said d) none of these.

vii) Time complexity of BFS is

viii) The space complexity of DFS is

ix) Which of the following algorithms does not face local

b) Steepest ascent hill climbing

x) Which is not heuristic search ?

c) Constraint satisfaction search

d) Best first search.

SE-47 3 [ Turn over

2. a) Define the term ‘production system’.

c) Define control stategy. 2+2+1

3. a) How does forward reasoning differ from backward

b) What do you mean by completeness of a search ? Why

is DFS not always complete ? 3+2

4. “A game tree is basically AND-OR graph.” Justify the

5. Write a program in prolog or lisp to find the gcd of

b) Define intelligent agent. Explain different types of

environment related to intelligent agent.

c) How does procedural knowledge differ from declarative

7. a) Discuss and compare

b) Explain with an example of admissible heuristic for

8. a) What is expert system ? Why is it required ?

b) Write a prolog or lisp clause for having DOUBLE (L,LL).

Every element in list L appears twice in list LL. For

example DOUBLE ([1,2,3],[1,1,2,2,3,3]) is true.

c) Given the following text :

“Everyone who enters in a theatre has to buy a ticket.

Vinod enters a theatre.”

Prove by resolution that “Vinod buys a ticket”.

SE-47 5 [ Turn over

9. The missionary and unbelievers problems 3 missionary and

cross the river. There is a small boat ( without boatman ) to

ferry them across but it holds at most 2 persons. Whenever

the river the missionary will convert the unbeliever. The

ferryings for the 6 persons to cross the river without any of

the unbelievers getting converted.

a) Formulate the problem as a state space search problem

b) Draw the implicit search graph.

c) Does there exist any solution to the problem ? If so,

specify the solution, otherwise clearly explain why there

of nodes expanded by best first algorithm ( U cost ) is

the no nodes in the explicit graph” — is true or false ?

b) What is an admissible heuristic ? Is it possible for A✳ to

output optimal solution if heuristics are inadmissible ?

11. Write short notes on any three of the following : 3×5

e) Minimax search procedure.

SE-47 7 [ Turn over

You might also like