Total No. of Questions : 6] SEAT No.

P5794 [Total No. of Pages : 2

BE/Insem./Oct.-584

1
5:2
B.E. (Computer Engineering)

3:1
ARTIFICIAL INTELLIGENCE AND ROBOTICS

81
8/2 1
(2015 Pattern) (Semester - I)

9
01
8 0 30
.23 01
Time : 1 Hour] [Max. Marks : 30
8/0
Instructions to the candidates :
8.2 G
P

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6.

.24 CE

2) Neat diagrams must be drawn wherever necessary.

16

3) Figures to the right side indicate full marks.

4) Assume Suitable data if necessary.

1
5:2
5) Justify your answer with an example wherever necessary.
49

3:1
81
91
01
Q1) a) Define artificial intelligence and elaborate the applications of artificial
30
8/2

intelligence in the real world. [6]

01
8/0

b) Explain importance of pruning CLOSED and OPEN lists of A* algorithm.

GP
80

[4]
.23
CE

OR
16

Q2) a) Explain in detail A* algorithm with an example. [6]

8.2

1
.24

5:2
b) Explain Depth Bounded DFS (Depth Limited DFS) algorithm with an
49

example. [4]
3:1
81
91
01
30

Q3) a) Explain in detail Rule Based Expert System with a neatly labelled diagram.
8/2

[6]
01
8/0

b) Explain problem decomposition with an example. [4]

GP
80

OR
.23
CE
16

Q4) a) Explain with an example Goal Stack Planning (STRIPS algorithm). [6]
8.2

b) Give and explain examples of real time Constraint Satisfaction Problem.[4]

.24
49

P.T.O.
Q5) a) Explain unification algorithm, clearly stating the various output of the
algorithm. [6]
b) Explain in brief the building blocks of conceptual dependency (CDs)

1
5:2
used to represent knowledge. [4]

3:1
OR

81
8/2 1
9
Q6) a) What is semantic network? How is it used to represent inheritance, explain

01
8 0 30
with an example.
.23 01 [6]
b) Explain with an example Backward Chaining.
8/0 [4]
P

eee
8.2 G
.24 CE
16

1
5:2
49

3:1
81
91
01
30
8/2
01
8/0
GP
80
.23
CE
16
8.2

1
.24

5:2
49

3:1
81
91
01
30
8/2
01
8/0
GP
80
.23
CE
16
8.2
.24
49

BE/Insem./Oct.-584 2