Total No. of Questions : 8] SEAT No.

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

Instructions to the candidates:

E

1) Attempt Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

81

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

b) Define and explain Constraints satisfaction problem. [9]

01
02

OR
1/2
GP
7/0

Q2) a) Explain with example graph coloring problem. [9]

CE
81

8
23
b) How AI technique is used to solve tic-tac-toe problem. [9]
.23

ic-
16

tat
8.2

0s

Q3) a) Explain Wumpus world environment giving its PEAS description.

.24

6:2
91

[9]
49

9:3
30

b) Explain different inference rules in FOL with suitable example. [8]

30
01
02

OR
1/2
GP

Q4) a) Write an propositional logic for the statement,

7/0

[10]
CE
81

i) "All birds fly"

.23

ii) "Every man respect his parents"

16
8.2

b) Differentiate between propositional logic and First order logic. [7]

.24
49

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

Q8) a) What are the types of planning? Explain in detail. [6]

1/2
GP

b) Explain Classical Planning and its advantages with example. [6]

7/0
CE
81

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