Nov Dec 2022
Nov Dec 2022
Nov Dec 2022
8
23
PA-1451 [Total No. of Pages : 2
ic-
[5926]-67
tat
0s
T.E. (Computer Engineering)
6:2
02 91
ARTIFICIAL INTELLIGENCE
9:3
0
(2019 Pattern) (Semester - II) (310253)
30
7/0 13
0
1/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP
8
C
23
2) Neat diagrams must be drawn wherever necessary.
ic-
3) Assume suitable data, if necessary.
16
tat
8.2
0s
Q1) a) Explain Min Max and Alpha Beta pruning algorithm for adversarial
.24
6:2
91
search with example. [9]
49
9:3
30
30
OR
1/2
GP
7/0
8
23
b) How AI technique is used to solve tic-tac-toe problem. [9]
.23
ic-
16
tat
8.2
0s
6:2
91
[9]
49
9:3
30
OR
1/2
GP
[10]
CE
81
P.T.O.
Q5) a) Explain Forward chaining algorithm with the help of example. [9]
8
23
b) Write and explain the steps of knowledge engineering process. [9]
ic-
tat
OR
0s
Q6) a) Explain Backward chaining algorithm with the help of example
6:2
[9]
02 91
9:3
b) Write a short note on : [9]
0
30
i) 7/0 13
Resolution and
0
1/2
ii) Unification
.23 GP
E
81
8
C
23
Q7) a) Write a short note on planning agent, state goal and action
ic-
representation. [6]
16
tat
8.2
0s
b) Explain different components of planning system. [6]
.24
6:2
91
c) Explain the components of AI. [5]
49
9:3
30
OR
30
01
02
8
c) Write note on hierarchical task network planning. [5]
23
.23
ic-
16
tat
8.2
0s
.24
6:2
91
49
9:3
30
30
01
02
1/2
GP
7/0
CE
81
.23
16
8.2
.24
49
[5926]-67 2