D7

4C
BD

6B
D6
Paper / Subject Code: 48843 / Honours/Minor degree programs Game Theory using AI & ML

46

97
80
7D
E4

BD

6B
D6
DC

6D

4
97
80
7D
E4

D4
06

6B
D6
DC

6D
48

80
7D
4

4
D2

CE

D6
0

D
8

4B
B8

6D
Duration: 3hrs [Max Marks: 80]

6
24

D
D4
E
F9

7
D

6D

D
48

4B
8
C2

6D
B
N.B.: 1) Question No 1 is Compulsory.

D
4
2

E
9
74

D7
BD
D

80
F

DC
(2) Attempt any three questions out of the remaining five.

B8
C2
B9

46
4

4
2
(3) All questions carry equal marks.

E
9
4
06

BD
8D

80
F

C
7

C2
9
(4) Assume suitable data, if required and state it clearly.

68

D
24
9B

E4
B

06
DD

74
6

D
F

DC
0

48

B
8
C2
B9
68

9B
D7

4
2

06

CE
D

4
06
1 Attempt any FOUR [20]

8D
2F
46

97
D

48
68

6D
B
D7

C
BD

2
F9
DD

4
6

80
46
a Define pure and mixed strategy with suitable example.

97
[05]

0
E4

8
C2
68

24
9B
7
BD

6B
DC

74

8D
2F
6

0
D
E4

48
b Find all the Pure strategy Nash Equilibrium in the following simultaneous [05]
D4

9
68
06

9B
7

4C
B

D2
DC

6D

D
48

06
game, the Payoff matrix s as follow, B

2F
97
7D
4

B8
D4
D2

8
06

CE

4C
B
6
D

F9
DD
Player 2
8

06
4B
B8

6
24

97

C2
D4

68
6

L C R
E
F9

D7
D

6B
80

DC

74
4B
8
C2

Player 1

46
4

80
B

D
2

B9
06

T 2,0 1,1 4,2

E
9
74

7
D
D

D6
F

DC

6D
48

06
B
8
C2
B9

M 3,4 1,2 2,3

B

7D
E4

D4
D2

68
06
9
4
06

B 1,3 0,2 3,0

F

C
7

6D

DD
8

4B
8
C2
9
68

D
4
B

Analyze the drawbacks of the Hill Climbing Heuristic Search policy.

B

c [05]

D4
2

06

CE
9
DD

74

D7
6

D
2F
0

48

B
8
B9
8

46
9B
D7

4C

4
6

D2

06

d What is planning in AI? Explain partial order planning in detail. [05]

E
DD

06

BD
2F
46

DC
97

8
8
68

24
B
D7

C
BD

E4
B

6
F9
DD

74
6

e Differentiate Artificial Intelligence vs Machine learning [05]

0
46

DC
0
E4

8
8
C2
B9
68

24
9B
7
BD
DC

06
D

74
6

8D
2F
6

Explain the functions of Support Vector Machine and Kernel.

80

f [05]
D
E4

48
D4

9
06

9B
7

4C
6B
6

D2
DC

6D

D
48

2F
7
80
7D
4

B8
D4
D2

9
06

CE

4C
B
D6
D

F9
8

06
4B
B8

6D

6
24

97
D

C2
D4

68

State and explain Bertrand’s model of oligopoly.

E

2 a [10]
7
D

6B
80

DC

74
4B
B8

46
4

80
D
2

B9
6

E
F9

D7
D
D

D6
80

b What is Nash equilibrium condition in game theory? Discuss the Nash [10]
DC

06
B
8
2

46
24
9B

7D
C

E4

68
06
4

equilibrium condition for following strategic games.

D
D
F

C
7

6D

DD
8

4B
8
C2
B9

D
4
9B

D4
2

i. Matching Pennies
06

E
74

D7
D
2F

C
48

B
B8
B9

6D

46
4C

ii. Stag Hunt

D2

CE
F9
06

BD
80
97

B8
C2
68

6D
24

E4
6B

F9
DD

74

DC
80

48
8

3 a What are the heuristic techniques in AI? Explain the use of heuristics in the [10]
C2
9

9B
D7

6B
D6

D2

06
74

following techniques in detail with suitable example.

2F
80
D

48
B8
9
D7

4C
B
6

D2
F9
DD

i. Best first search

06
46

B8
2
B9
68

ii. A* algorithm
D7

4C
D

F9
D

06
4B

46

97
D

C2
68
CE

b Explain local search techniques in AI? Discuss the simulated annealing in [10]
D7
BD

6B
D

74
46

80
7D
4

hill climbing algorithm.

B9
CE

D6
6D

06
B
D

7D
4

D4

68
06

CE

30885 Page 1 of 2
6D

DD
48

4B
6D

D4
D2

CE

D7
80

4B
6D

46
24

CE

BD
8D

9B8D24806DCE4BD46D7DD6806B974C2F
80
 D7

4C
BD

6B
D6
Paper / Subject Code: 48843 / Honours/Minor degree programs Game Theory using AI & ML

46

97
80
7D
E4

BD

6B
D6
DC

6D

4
97
80
7D
E4

D4
06

6B
D6
DC

6D
48

80
7D
4

4
D2

CE
Explain the use of Computing the SVM for Classification.

D
4 a [10]

D6
0

D
8

4B
B8

6D

6
24

D
D4
E
F9

7
D

C
b Discuss types of learning can be accomplished by Hidden Markov Model?

6D
[10]

D
48

4B
8
C2

6D
B

D
Discuss state transition diagram of HMM.

4
2

E
9
74

D7
BD
D

80
F

DC
B8
C2
B9

46
4

4
2

E
9
4
06

BD
8D

80
F

C
7

C2
9
68
5 a Find the most cost-effective path to reach the final state from initial state [10]

D
24
9B

E4
B

06
DD

74
6

D
using A* Algorithm. Given an initial state of a 8-puzzle problem and final

DC
0

48

B
8
C2
B9
68

9B
state to be reached-

D7

4
2

06

CE
D

4
06

8D
2F
46

97
D

48
68

6D
B
D7

C
BD

2
F9
DD

4
6

80
46

97
0
E4

8
C2
68

24
9B
7
BD

6B
DC

74

8D
2F
6

0
D
E4

48
D4

9
68
06

9B
7

4C
B

D2
DC

6D

D
48

06
B

2F
97
7D
4

B8
D4
D2

8
06

CE

4C
B
6
b What is Uncertainty? Explain Bayesian network with example. [10]

F9
DD
8

06
4B
B8

6
24

97

C2
D4

68
6

E
F9

D7
D

6B
80

DC

74
4B
8
C2

46
4

80
B

D
2

B9
06

E
9
74

7
D
6 a Use the k-means algorithm and Euclidean distance to cluster the following 8 [10]
D

D6
F

DC

6D
48

06
B
8
C2
B9

data points into 3 clusters: C1=A1=(2,10), C2=A4=(5,8), C3=A7=(1,2)

7D
E4

D4
D2

68
06
9
4
06

C
7

6D

DD
8

4B
8
C2
9
68

D
4

Data points: A1=(2,10), A2=(2,5), A3=(8,4), A4=(5,8), A5=(7,5), A6=(6,4),

B
B

D4
2

06

CE
9
DD

74

D7
6

D
2F

A7=(1,2), A8=(4,9).
0

48

B
8
B9
8

46
9B
D7

4C

4
6

D2

06

E
DD

06

BD
Form the distance matrix with Euclidean distance and solve the problem up
2F
46

DC
97

8
8
68

24
B
D7

C
BD

E4
B

to two iterations.
6
F9
DD

74
6

0
46

DC
0
E4

8
8
C2
B9
68

24
9B
7
BD

b What is association rule learning? How to evaluate the association rules? [10]
DC

06
D

74
6

8D
2F
6

80
D

Illustrate the working with suitable example.

E4

48
D4

9
06

9B
7

4C
6B
6

D2
DC

6D

D
48

2F
7
80
7D
4

B8
D4
D2

9
06

CE

4C
B
D6
D

F9
8

06
4B
B8

_________________
6D

6
24

97
D

C2
D4

68
E

7
D

6B
80

DC

74
4B
B8

46
4

80
D
2

B9
6

E
F9

D7
D
D

D6
80

DC

06
B
8
2

46
24
9B

7D
C

E4

68
06
4

D
D
F

C
7

6D

DD
8

4B
8
C2
B9

D
4
9B

D4
2

06

E
74

D7
D
2F

C
48

B
B8
B9

6D

46
4C

4
D2

CE
F9
06

BD
80
97

B8
C2
68

6D
24

E4
6B

F9
DD

74

DC
80

48
8
C2
9

9B
D7

6B
D6

D2

06
74

2F
80
D

48
B8
9
D7

4C
B
6

D2
F9
DD

06
46

B8
2
B9
68
D7

4C
D

F9
D

06
4B

46

97
D

C2
68
CE

D7
BD

6B
D

74
46

80
7D
4

B9
CE

D6
6D

06
B
D

7D
4

D4

68
06

CE

30885 Page 2 of 2
6D

DD
48

4B
6D

D4
D2

CE

D7
80

4B
6D

46
24

CE

BD
8D

9B8D24806DCE4BD46D7DD6806B974C2F
80