F

AA
1
2

6F
C1
6C
25
Paper / Subject Code: 89284 / Artificial Intelligence

FD

31
D0

15
2F

6F
C1
6C
25

A
7E

FD

31
D0

15
2F
F7

6F
C1
C
5
7E
3C

02

F6

FD
15
F7
8E
Time: 3 Hours Marks: 80

1
6C
5
E
C
5D

C
2
7
3
1) Q.1 is compulsory

D0

15
2F
7
E
47

F
8

C1
6C
25
7E
C
D
AA
2) Attempt any three from remaining five questions

E3

D0

5
5

2F
F7

C1
47
31

25
7E
3C
D
A

F6
F

D0
5
A

7
D6

E
47

52
Q1) Solve any four of the following:

F
1

7E
3C
3

5D
F

02
6F
C1

7
8E
a) Describe different categories of AI [5]

ED
47

CF
D

1
15

25
3

D
F

A
b) Describe the characteristics of a medical diagnosis system using the PEAS properties [5]

77
F

E3
C1
6C

D0
75
1A
D6

CF
c) Explain Goal based Agent with a block diagram [5]

8
A4
15
2F

7E
3

5D
F

E3
d) Compare and contrast propositional logic and first order logic [5]

1
6C
25

F7
D6
C

7
1

D8
e) What do you mean by hill climbing. Explain. [5]

A4
D0

5
2F

3C
3
F
1

F
1
6C

75
25

1A
7E

D6

8E
5C

4
D0

C
F7

5D
F

AA
1
52

6F

E3
C1
C
7E
3C

Q2)

47
2

F6

D8
D0

15
a) Perform α - β pruning on the following graph, clearly indicating the
F7

F3
8E

1F

AA
2

75
5
7E

α and β cuts and the final value of root node.

3C

6
5D

[10]

5C
2

F6

FD

31

A4
0
F7
8E

ED

1
47

52

6F
C1
C

1A
3C
5D
AA

02

FD
7

15
F
F7

F3
8E

MAx
D
47

2
31

C1
6C
25
E
3C

D6
5D
AA

77
6F

D0

15
F
8E

1F
47

52
F
FD

31

6C
7E
C
C
5D

5C
AA

2
B
6F

3
C1

D0

2F
7
E

C1
47

MIN
F
FD

31

D8
15

25
7E
3C
AA

F6
6F
C1
6C

D0
5

7
8E
47

52
CF
FD

31
15
2F

7E
5D
AA

02
6F

D G I
C1
6C
25

F
F7
H
8E

ED
7
FD

31

4
0

15
2F

3C

MAX
5D
A
ED

77
6F
C1
6C
25

8E
47

CF
FD
77

31
0

15
2F

D
A
ED
CF

E3
C1
6C

8
5

9
25

8 3 9
A

6 4 2 4 7 4 2 4 1 7
D6

5 8 3
7
77

31
E3

D8
A4
D0

15
2F

1F
CF

6F
D8

6C

75

J
25

K
1A
7E

L M N O P Q R S T U V W X Y Z a
5C

D
E3

A4
D0
75

2F
7

F3
F
1
CF
D8

1
6C
25

1A
7E

6
5C

D
E3

D0
75

2F
7

F3

b) What do you understand by informed and uninformed search methods? Explain in detail
1F
1
CF
D8

6C
4

25
7E

D6
5C
AA

E3

D0
75

2F

with example. [10]

7

1F
C1
CF
31

D8
4

25
7E

5C
AA

F6
6F

E3

D0
75

C1
2
CF
31

D8
4

25
7E
AA

F6

Q3)
F

E3

D0
75

7
D6

52
CF

a) Consider the following statements: [10]

31

D8
4

7E
F

AA

02
F

a) All people who are earning are happy

E3
C1

75

7
D6

ED
CF
31

b) All happy people smile

D8
4
15

AA

77
F

E3

c) Someone is earning
C1
6C

75
D6

CF
31

D8

Perform the following tasks:

4
5

AA
C1

E3
C1

i) Represent above statements in FOL

75
D6
6

31

D8
4

ii) Convert each to CNF

5
2F

AA
C1

F
C1

iii) Prove that someone is smiling using resolution technique. Draw the resolution tree
75
5

D6
02

31

4
5
2F

AA
ED

C1

F
C1
25

b) What do you understand by forward chaining and backward chaining. Explain in detail
D6
6

31
D0

5
2F

F
C1

[10]
C1
25
7E

D6
6
D0

5
2F
7

F
C1
CF

C1
25
7E

26341 Page 1 of 3
6
E3

D0

5
2F
7

C1
CF
D8

25
7E

6
E3

D0

2F
F7
8

5
7E
3C

75D8E3CF77ED0252F6C15C1FD6F31AA4
5D

02
 D8 ED 6C 6F 75
E3 02 15 31 D8
CF 5 C1
F
AA E3
5D 7 7E
2F
6 D6 4 75
CF
8 C1 F 77
E3 D0
25 5 31 D8 ED
CF
7 2F
C1
F
AA E3 0 25
7E 6 D6 4 75
CF 2F
D0 C1
5 F 31 D8 77
ED 6C
3C 25 15 Q.4
F7
C1
F
AA E3 0

G1

C
2F

B
A
4 25 C1

SB
SA

SD
CF

AB
6

AG1
7E D6 7 2F

Edge
75

26341
Node
C1 F 7E FD
D0 5 31 D8 6C 6F
25 C1 AA E3 D0 15 31
2F F 4 CF 25 C1 AA
7E 6 D6

A
C1 F 75 7 7E
2F FD 47

4
3
7
5
9
3
6
9
5
D0 5 31 D8 6C 6F 5D

Cost
25 C1 AA E3 D0 15 31
2F F 25 8E

Heuristic
6 D6 4 75
CF
7 2F
C1
FD
AA 3C
02
C1
5 F 31 D8 7E 6C 6F 47
5D F7
5 C1 AA E3 D0 15 31 7E
F 8E

F
E
2F

D
4 25 C1 D0

CF
CS
BC
BA
6 CF AA

CG2
D6 7 3C

Edge
75 2F 25

Node
FD

B
C1
5 F 31 D8 7E 6C 6F 47
5D F7 S
2F
C1 AA E3 D0 15 31 7E 6C
F D6 4 CF 25 C1 AA 8E
3C
D0 15
F 75 7 7E
2F FD 47 25 C1
F

6
5
6
7
5
6
1
2
31 D8 6C 6F 5D F7 2F
path from S to any of the goal nodes.

Cost
E3 D0 31 7E 6C D6
AA 25 5C 8E F

Heuristic
4 CF 31 AA D0 15
75 7 2F AA 1F
47
3C 2 52 C1
F

G2
5 F 7E 6C D6 F7
D8
E3 F 31 D8 7 ED 6CD0 D 6F 1 47
25 5C A E 1 3 5D
1 3 0 5

FD
DS

DE

G3
G2
G1
1

DC
CF 2 A
F 2 C

FG3
EG3
C A 8E

Edge
5

Node
77
ED
F6 D 6F 4 7 F 77 2 1 F A 3C
5D F6
C

C1 47
02 5C 31 8E ED C 1
D6
F 5 D
F7
A 3 7E

Page 2 of 3
52 1F A 3C 02 5C 1A 8E D0
F6 D 6 47 F 52 1 F A 3 C

0
0
0
8
2
7
2
2
1
C1 5D 7 F6 47 25
2

Cost
F3 7E C D6
5 F7
D

5C 1A 8E F 3 D 7E

Heuristic
1F 3
D0 15 1A 8
A4 CF 25 C1 E3 D0
7 2 F A C

75D8E3CF77ED0252F6C15C1FD6F31AA4
D6 7
F3 5 D 7E F 6 D6 47 F 25
1A 8E C 1 F 5D 7 7
2F F
D0
2 5C 3 1 8 E D
6C
1
A4 3C
F7 52 1F A E 3C 02
75 F D A4 5
Paper / Subject Code: 89284 / Artificial Intelligence

D8 7E 6C 6F 75 F7 2F
E3 D0 15 3 1A D 8E
7E 6C
CF 25 C1 D0 15
77 2F FD A4 3C
F 2 5 C1
ED 6C 6 75D 7 2 F6 F
G3

F3 7E
E

02 15
C1 1AA 8E3 D0 C 15
52 25
F6 FD
6F 4 75
CF
7 2F
C1
FD
C1 D8 7E 6C
5C 31 D0 15 6F
AA E3

b) What is planning in AI? Discuss partial order planning and hierarchical planning in detail [10]
[10]
a) For the given graph, the table below indicates the path costs and the heuristic values. S is the
start node and G1, G2 and G3 are the goal nodes. Perform A* search to find the shortest distance

1F CF 25 C1
D6 47 77 2F FD
F3 5D ED 6C 6F
1A 8E 15 31
A4 3C 02
52 C 1 AA
75 F7 F6 FD
D8 7E C1 6F
E3
C
D0
25 5 C1 31
A
 D8 ED 6C 6F 75
E3 02 15 31 D8
CF 5 C1
F
AA E3
5D 7 7E
2F
6 D6 4 75
CF
8 C1 F 77
E3 D0
25 5 31 D8 ED
CF
7 2F
C1
F
AA E3 0 25
7E 6 D6 4 75
CF 2F
D0 C1
5 F 31 D8 77
ED 6C
3C 25 15
F7 2F
C1
F
AA E3 0 25
Q 5)
7E 6 D6 4 75
CF
7 2F
C1

26341
C1 F 7E FD
D0 5 31 D8 6C 6F
25 C1 AA E3 D0 15 31
2F F 4 CF 25 C1 AA
7E 6 D6 75 7 2F FD
D0 C1
5 F 31 D8 7E 6C 6F 47
5D
25 C1 AA E3 D0 15 31
2F F 4 CF 25 C1 AA 8E
6 D6 75 7 2F FD 3C
02
C1
5 F 31 D8 7E 6C 6F 47
5D F7

a) Applications of AI
5 C1 AA E3 D0 15 31 7E
F 8E

b) Simulated annealing
2F 4 CF 25 C1 AA D0
6 D6 75 7 2F FD 3C 25 Q.6 Write short notes on :
C1
5 F 31 D8 7E 6C 6F 47
5D F7 2F
C1 AA E3 D0 15 31 7E 6C
F D6 4 CF 25 C1 AA 8E
3C
D0 15
F 75
D8 7 7E
2F
6C
FD 47 F7 25
2F
C1
F
31 D0 1 6F 5D 7E 6C D6
AA E3 5C 31 8E F
4 CF 25 AA D031 15
75 7 2F 1F
47
3C 2 AA
52 C1
D8 7E 6C
F
D6
5 7 F F7 D F
E3 D0 5C 1 31 D8 ED 6C 6F 47
5D
A E 1 3
a) Explain the concept of genetic programming

CF 25 1 3 0 5 1
77 2 F D A 4 C 2 5 C 1 A 8E
ED
F6
C1 6F 7 5D F 77 2 F6 F A 47
3C
02 5C 31 8E ED C 1
D6
F 5 D
F7
A 3 7E

Page 3 of 3
**************
52 1F A 3C 02 5C 1A 8E D0
F6 D 6 47 F 7
52 1 F A 3 C 25
C1 F3 5D 7E F6 D6 47 F7 2
5C 1A 8E C F 5 D
1F A4 3
D0
25
15
C1 3 1A 8
7E
D0
CF 2 A E3
7 F C

75D8E3CF77ED0252F6C15C1FD6F31AA4
D6 7
F3 5 D 7E F 6 D6 47 F 25
1A 8E C 1 F 5D 7 7
2F
D0
2 5C 3 1 8 E D
6C
1
A4 3C A E
components: initial state, actions, successor function, goal test, path cost.

F7 52 1F 3C 02
75 F D A4 5
Paper / Subject Code: 89284 / Artificial Intelligence

D8 7E 6C 6F 75 F7 2F
E3 D0 15 3 1A D 8E
7E 6C
CF 25 C1 D0 15
77 2F FD A4 3C
F 2 5 C1
ED 6C 6 F3 75D 7 2 F6 F
15 7E C
02
52 C1 1AA 8E3 D0 15
F6 FD 4 CF 25 C1
C1 6F 75
D8 7 7E
2F
6C
FD
5C 31 D0 15 6F
AA E3
[20]
[10]
[10]
b) What is formulation of a problem. Formulate the Wumpus world problem in terms of following

1F CF 25 C1
D6 47 77 2F FD
F3 5D ED 6C 6F
1A 8E 15 31
A4 3C 02
52 C 1 AA
75 F7 F6 FD
D8 7E C1 6F
E3
C
D0
25 5 C1 31
A