F

85
EE
2
A9

4D
ED
Paper / Subject Code: 89284 / Artificial Intelligence

34
C2
2E

5B
E6
92

D2
DE

D
48
EA

2E

B4
2E

63
D8

2C
E2

5
EE
9

48
2C

D
EA
8D
Time: (3 Hours) Max Marks: 80

C2
2E

63
82

2
CD

EE
D2
9
DE
9E

A
2

2
2E
F6

2E
D8
NOTE: - Q1 is compulsory

82

2C

6
EE
4D

A9
E
9E
Solve any three from remaining.

2C

ED
8D

2
5B

2E
82

2C
F

92
CD
4D

DE
48

9E
Q1. Solve any four from following. [20]

ED
A
22
63

F6

E
D8
a. Compare the importance of Partial order planning over Total order planning.

92
2
5

E8
EE

4D

DE
8
b. What data is used to evaluate award and punishment of robot navigation?

2C

ED
EA
4

69
C2

63

5B

D8
c. Explain the categorization of Intelligent System.

82
F

92
E2
E
D2

D
48

9E

2C
d. How AI will help in the Robotics application.

EA
8D
B4
2
2E

F6

2
C
e. Generate the parse tree for a sentence “The cat ate the fish”.

E6

2
85

CD
E8
2
A9

4D

DE
D
f. What do you mean by state space representation? Explain with example the necessity

2E

34

69

22
E
2E

5B

D8
C
of it

E6
92

DF

E8
D2
DE

E
48

2C
A

2E

8D
4

69
E
E

3
D8

5B

82
2C

6
2
E2

DF

CD
EE
A9

8
2C

9E
D
Q2. a. What actions would you take to prove “Some who are intelligent can’t read” using
8D

34

22
C2
2E
2E

5B
82

F6
prepositional logic [10]

E6
CD

E8
D2
9
E
9E

4D
48
EA

2E
1. Whoever can read is literate.
D
2

69
2E
F6

63
D8

5B
82

2C
2. Dolphins are not literate.
E2

DF
E
4D

A9
9E

48
C

ED

2E
3. Some dolphins are intelligent.
D

B4
2
5B

F6

2E

63
D8
82

C
92

85
EE
4D

D2
DE
48

9E

34
22
63

C2
5B

E
F6

E
8

E6
b. Solve the Air cargo transport problem using Planning. It involves loading and

2
2
D
8
EE

4D

D2
9
DE
48

EA

2E
69

unloading cargo onto and off of planes and flying it from place. Initial State is
2
C2

63

2E
D8
82

2C
F

2
5
EE
D2

cargo 1 and plane 1 is at Mumbai airport, cargo 2 and plane 2 is at Delhi

D

A9
E
48

2C

ED
8D
B4

9
C2
2E

63

airport. Goal State is cargo 2 should be at Mumbai airport and cargo 1 should
6

2E
2
F

92
85

CD
E8
EE
D2
A9

4D

DE
be at Delhi airport. [10]

EA
34

69

22
C2
2E
E

D8
6
E2

E2
5

E8
EE
D2
A9

D
48

2C
8D

8D
4

69
C2
2E
2E

63

82
CD

DF
5

CD
EE
D2
A9
DE

48

9E

Q3. a. Apply A* algorithm on the following graph. Heuristic values are

4
22

22
C2
2E
E

3
D8

5B

F6
E6
E2

h(S) = 15, h(A) = 14, h(D) = 12, h(B) = 10, h(E) = 10, h(C) = 8 , h(F) = 10,
E8
D2
A9

4D
48
2C

E
D

69

h(G) = 0. [10]
2
E
2E

3
D8

5B
82

2C

6
92

DF
EE
DE

S is the start node and G is the goal node.

9E

48
2C

D
A

B4
2
E
F6

2E

63
8
82

2C
92
CD

85
EE
4D

DE
9E

ED
A

34
22

C2
6

2E
8
DF

E6
2
CD
E8

D2
9
DE

EA

2E
B4

22

2E
F6

2C
2
85

CD
E8
D

A9
E

ED
34

8D
B4

22
F6

2E
6

92
85

D
E8
EE

DE
C

EA
34

B4

22
F6

D8
6

.
E2
85

8
EE

9E

2C
34

8D
B4
C2

82

b. Explain the Depth Limit search and Depth first iterative deepening search. [10]
6

DF
85

CD
EE
D2

9E
34

B4

22
C2
2E

F6
6

85

E8
EE
2

4D
ED

34

69
C2

12281 Page 1 of 2
B
6
92

DF
85
EE
2
ED
EA

34

B4
C2

6
92
E2

85
EE
2
ED
EA
8D

34
C2

E6
92
E2

2
ED
EA

2E
8D

22CD8DE2EA92ED2C2EE63485B4DF69E8
 F
85
EE
2
A9

4D
ED
Paper / Subject Code: 89284 / Artificial Intelligence

34
C2
2E

5B
E6
92

D2
DE

D
48
EA

2E

B4
2E

63
D8

2C
E2

5
EE
9

48
2C

D
EA
8D

C2
2E

63
82

2
CD

EE
D2
9
DE
9E

A
2
Q4. a. Apply the alpha beta pruning on following example by considering the root node a

2
2E
F6

2E
D8
82

2C

6
EE
4D

A9
E
9E
max. [10]

2C

ED
8D

2
5B

2E
82

2C
F

92
CD
4D

DE
48

9E

ED
A
22
63

F6

E
D8

92
2
5

E8
EE

4D

DE
8

2C

ED
EA
4

69
C2

63

5B

D8
82
F

92
E2
E
D2

D
48

9E

2C
E

EA
8D
B4
2
2E

F6

2
C

E6

2
85

CD
E8
2
A9

4D

DE
D

2E

34

69

22
E
2E

5B

D8
C

E6
92

DF

E8
D2
DE

E
48

2C
A

2E

8D
4

69
E
E

3
D8

5B

82
2C

6
2
E2

DF

CD
EE
A9

8
2C

9E
D
8D

34

22
C2
2E
2E

5B
82

F6
E6
CD

E8
D2
9
E
9E

4D
48
EA

2E
D
2

69
2E
F6

63
D8

5B
82

2C
E2

DF
E
4D

A9
9E

48
C

ED

2E
D

b. Explain PEAS descriptors also state PEAS description for online English tutor.

B4
2
5B

F6

2E

63
D8
82

C
[10]

92

85
EE
4D

D2
DE
48

9E

34
22
63

C2
5B

E
F6

E
8

E6
2
2
Q5. a. Explain Problem formulation also give the initial state, goal test, successor function,
D
8
EE

4D

D2
9
DE
48

EA

2E
and cost function for the following.
69

2
C2

63

2E
D8
82

2C
F

2
5

Choose the formulation that is precise enough to be implemented.

EE
D2

A9
E
48

2C

ED
8D
B4

Problem statement: A 3 foot tall monkey is in a room where some bananas are
9
C2
2E

63

2E
2
F

92
85

CD

suspended from the 8 foot tall ceiling. He would like to get bananas. The room
E8
EE
D2
A9

4D

DE

EA
34

69

contains two stackable, movable, climbable 3 foot high crates. [10]

22
C2
2E
E

D8
6
E2

E2
5

E8
EE
D2
A9

D
48

2C
8D

8D
4

69

b. Explain the concept of PAC learning [10]

C2
2E
2E

63

82
CD

DF
5

CD
EE
D2
A9
DE

48

9E
4
22

Q6 .Write detailed note on following. (Any two) [20]

22
C2
2E
E

3
D8

5B

F6
E6
E2

E8

a. Hill Climbing Algorithm and it’s Limitations.

D2
A9

4D
48
2C

E
D

69
2

b. Forward and Backward Chaining

E
2E

3
D8

5B
82

2C

6
92

DF
EE
DE
9E

c. Language models of Natural Language Processing

48
2C

D
A

B4
2
E
F6

2E

63
8
82

2C
92
CD

85
EE
4D

DE
9E

ED
A

34
22

C2
6

2E
8
DF

E6
2
CD
E8

D2
9
DE

EA

2E
B4

22

_________________
2E
F6

2C
2
85

CD
E8
D

A9
E

ED
34

8D
B4

22
F6

2E
6

92
85

D
E8
EE

DE
C

EA
34

B4

22
F6

D8
6

E2
85

8
EE

9E

2C
34

8D
B4
C2

82
6

DF
85

CD
EE
D2

9E
34

B4

22
C2
2E

F6
6

85

E8
EE
2

4D
ED

34

69
C2

12281 Page 2 of 2
B
6
92

DF
85
EE
2
ED
EA

34

B4
C2

6
92
E2

85
EE
2
ED
EA
8D

34
C2

E6
92
E2

2
ED
EA

2E
8D

22CD8DE2EA92ED2C2EE63485B4DF69E8