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

htt
Roll No. : ………………………………………………………..
Invigilator’s Signature : ………………………………………..
CS/B.Tech (CSE)/SEM-7/CS-702/2010-11
p:/
2010-11
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 )
1. Choose the correct alternatives for the following : 10 × 1 = 10
er.

i) An algorithm that gives optimal solution is

a) Hill Climbing b) BFS

wb

c) Blind search d) A*.

ii) A formula with no free variables is

a) formula b) clause
ut .

c) a sentence d) paragraph.

iii) In First Order logic, resolution condenses the ................

a c.

of logical inference down to a single rule.

a) Traditional syllogism b) Logical sequence

in

c) Logical reference d) None of these.

7201 [ Turn over

CS/B.Tech (CSE)/SEM-7/CS-702/2010-11

iv) Uninformed search is also known as

htt
a) Brute force search b) Hill climbing search

c) Worst case search d) Blind search.

v) Horn clause is a clause with ................... positive

p:/
literals.

a) At most one b) At most two

/q
c) At least one d) At most four.

vi) Which of the following is a declarative knowledge ?

pap

a) A set of production rules

b) Using LISP code to define a value

c) Describing the objects using a set of attributes and

associated values
er.

d) A knowledge about the order in which to pursue

the subgoals.
wb

vii) Which of the following is not true about backward

chaining ?

a) Backward chaining is a goal directed reasoning

process
ut .

b) Backward chaining would be much better to use

when trying to prove theorems
a c.

c) For arriving at a new fact, backward chaining is

more natural

d) A medical diagnostic program is a query system

in

that would probably use.

7201 2
 CS/B.Tech (CSE)/SEM-7/CS-702/2010-11

viii) “John is tall”. This statement can be completely

htt
expressed in

a) FOPL
p:/
b) Propositional logic
/q
c) Fuzzy logic
pap

d) Default logic.

ix) Which is not heuristic search ?

er.

a) Constrained satisfaction search

b) Depth first search

wb

c) Simulated annealing
ut .

d) Steepest ascent Hill climbing.

x) Resolution can be used for

a c.

a) question answering b) theorem proving

c) both (a) and (b) d) none of these.

in

7201 3 [ Turn over

CS/B.Tech (CSE)/SEM-7/CS-702/2010-11

GROUP – B
htt
( Short Answer Type Questions )
Answer any three of the following. 3 × 5 = 15
p:/
2. A problem-solving search can proceed in either the forward

or the backward direction. What factors determine the choice

/q
of direction for a particular problem ?
pap

3. With suitable example explain the characteristics of

monotonic and partially commutative production system.

er.

4. Give one example of a problem in which solutions requiring

wb

minimum search are more appropriate than optimal

solutions. Give reasons for your choices.

ut .

5. Discuss the benefits of production system.

a c.

6. Write a program in prolog to compute the factorial of a

number using iteration/tail recursion.

in

7201 4
 CS/B.Tech (CSE)/SEM-7/CS-702/2010-11

GROUP – C
( Long Answer Type Questions )
htt
Answer any three of the following. 3 × 15 = 45

7. Prove each of the following statements :

p:/
a) Breadth first search is a special case of uniform cost

search. 5
/q
b) Breadth first, depth first and uniform cost search are

special cases of Best First Search. 5

pap

c) Uniform cost search is a special case of A* search. 5

8. a) Represent the following sentences by default logic. Also

mention the sets D and W.

er.

i) Typically molluscs are shell-bearers

ii) Cephalopods are molluscs

wb

iii) Cephalopods are not shell-bearers. 6

b) Draw a decision tree corresponding to the following

ut .

expression :

If ( Weather = Hot ∧ Humidity = High ) ∨

a c.

( Weather = Cool ∧ Humidity = Moderate ) ∨

( Weather = Rainy ∧ Wind = Strong ).

Then start reading a story book. 9

in

7201 5 [ Turn over

CS/B.Tech (CSE)/SEM-7/CS-702/2010-11

9. a) Using the Euclidean distance of a node ( x, y ) from a

1
htt
2 2 2
fixed node ( 2, 2 ), i.e., h = [ ( x " 2) + (y " 2) ] solve the

water-jug problem by A* algorithm. Does this heuristic

function return an optimal
! path ? Consequently, can
p:/
you call it an admissible heuristic ? 8

b) Show the computation for the first 3 ply moves in a tic-

/q
tac-toe game using the α-β cut-off algorithm. 7

10. Test whether the following production systems are

pap

commutative. Justify your answer.

a) Knowledge base :

If A & B then C
er.

If C then D

If A & D then E.
wb

Initial Working Memory = { A, B }

Knowledge base :
ut .

If A & B then C

If X & Y then C
a c.

If A then E

If B then F.

Initial WM = { A, B, X, Y }. 8
in

7201 6
 CS/B.Tech (CSE)/SEM-7/CS-702/2010-11

b) Give the following initial and the goal state for the
htt
Block’s world problem. Construct a set of operators

( rules ) and hence generate a plan to reach the goal

state from the initial state.

p:/
Initial State : On ( C, A )
/q
Clear ( C ),

On ( B, Table ),
pap

Clear ( B ).

Goal State : On ( B, A )
er.

On ( C, B ). 7
wb
ut .
a c.
in

7201 7 [ Turn over