A D

52 2478 8A0 069 C6B BA4 492 2BA 2D 119 92F

C
24 478A A06 69C 6B A49 92B BA2 2D1 1192 2FE EEC
7 0 9 6 A 2 A D 1 F E 7
78 8A0 69C C6B BA4 492B BA 2D 119 92FE EEC C74 4915
6 2 1
8A A06 9C6 6BA A49 92B A2 D1 192 2FE EC 749 9152 247
06 9C BA 49 2B A2 D1 192 FE EC 749 15 47 8A
06 9C 6BA 49 2B A2 D1 192 FE EC 749 15 247 8A 069
6 D 1 7 2
69 9C6 BA 492 2BA A2D 11 92F FEE EC7 491 152 478 8A0 069C C6B
C B 4 9 C 4 4
9C 6B A4 92B BA2 2D1 119 2FE EEC 74 915 524 78A A06 69C 6BA A49
6 A 92 A D 1 2F E 7 91 2 78 0 9C 6B 4 2

(c)
(a)

(b)
N.B.

Q. 1
6B BA4 492B BA 2D 119 92FE EEC C74 4915 524 478A A06 69C 6B A49 92B BA2
2 1 A

57089
BA A49 92B A2 D1 192 2FE EC 749 9152 247 78A 069 9C6 6BA 492 2BA A2D D11
4 2 B A2 D1 19 FE EC 74 15 4 8A 06 C BA 49 B 2 1 92
A4 92 A D 19 2F E 74 91 24 78 06 9C 6B 4 2B A2 D1 19 FE
92 BA 2D 119 2F EE C74 91 524 78 A0 9C 6B A4 92B A2 D1 19 2FE EC
BA 2D 11 2F EE C7 91 52 78 A0 69 6B A4 92 A D 19 2F E 74
2D 11 92F EE C7 491 52 478 A0 69C C6B A4 92 BA 2D 119 2F EE C74 91
11 92F EE C7 491 52 478 A0 69C 6B A4 92 BA 2D 119 2F EE C74 91 524
92 E C 49 52 47 A 69 6 A 92 BA 2D 11 2F EE C7 91 52 78

a) 8 puzzle
FE EC 74 15 47 8A 06 C6 BA 49 B 2 11 92 E C 49 52 47 A

c) Boosting
EC 74 915 24 8A 06 9C BA 49 2B A2 D1 92 FE EC 749 15 47 8A 069

Short Answers
74 915 24 78A 06 9C 6BA 49 2B A2 D1 192 FE EC 749 15 247 8A 069 C6

Fill in the blanks

91 24 78 0 9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA

c) vacuum world
52 78 A0 69 6B A4 92 A D 19 2F E 74 91 24 78 0 9C 6B 4

3. SARSA stands for

47 A 69 C6 A 92 BA 2D 11 2F EE C7 91 52 78 A0 69 6B A 92

c) both, (a) and (b)

a) Computer Vision

1.Define Turing Test.

8A 06 C6 BA 49 B 2 1 92 E C 49 52 47 A 69 C6 A 49 BA

a) Bayesian Learning
06 9C BA 49 2B A2 D1 192 FE EC 749 15 47 8A 069 C6 BA 49 2BA 2D

a)with discontinuities

4. Define classification.
2.Define rational agent.
9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA 49 2B 2 1

3. Define null hypothesis.

6B A4 92B A D 19 2FE EC 74 915 24 78A 06 9C 6B 49 2B A2 D1 192
A4 92 A 2D 119 2F E 74 91 24 78 06 9C 6B A4 2B A2 D1 19 FE

c) without discontinuities
92 BA 2D 119 2F EE C74 91 524 78 A0 9C 6B A4 92B A2 D1 19 2FE EC
Attempt All (Each of 5Marks)

BA 2D 11 2F EE C7 91 52 78 A0 69 6B A4 92 A D 19 2F E 74
1) All questions are compulsory.

2D 11 92F EE C7 491 52 478 A0 69C C6B A4 92 BA 2D 119 2F EE C74 91

11 92F EE C7 491 52 478 A0 69C 6B A4 92 BA 2D 119 2F EE C74 91 524
92 E C 49 52 47 A 69 6 A 92 BA 2D 11 2F EE C7 91 52 78

c) Set-Action-Reward-State-Action
FE EC 74 15 47 8A 06 C6 BA 49 B 2 11 92 E C 49 52 47 A
2) Figures to the right indicate marks.

EC 74 915 24 8A 06 9C BA 49 2B A2 D1 92 FE EC 749 15 47 8A 069

a)State-Action-Reaction-State-Action

4. Locally weighted regression gives us

74 915 24 78A 06 9C 6BA 49 2B A2 D1 192 FE EC 749 15 247 8A 069 C6
91 24 78 0 9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA
4) Mixing of sub-questions is not allowed.

52 78 A0 69 6B A4 92 A D 19 2F E 74 91 24 78 0 9C 6B 4
47 A 69 C6 A 92 BA 2D 11 2F EE C7 91 52 78 A0 69 6B A 92
(2 ½ Hours)

8A 06 C6 BA 49 B 2 1 92 E C 49 52 47 A 69 C6 A 49 BA
06 9C BA 49 2B A2 D1 192 FE EC 749 15 47 8A 069 C6 BA 49 2BA 2D
9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA 49 2B 2 1

Page 1 of 2
6B A4 92B A D 19 2FE EC 74 915 24 78A 06 9C 6B 49 2B A2 D1 192
1. Left, right, Top, Down are the actions of ______

A4 92 A 2D 119 2F E 74 91 24 78 06 9C 6B A4 2B A2 D1 19 FE
92 BA 2D 119 2F EE C74 91 524 78 A0 9C 6B A4 92B A2 D1 19 2FE EC

5. What are the parameters of linear Gaussian model?

BA 2D 11 2F EE C7 91 52 78 A0 69 6B A4 92 A D 19 2F E 74
b) Robotics
d) (a) or (b)

2D 11 92F EE C7 491 52 478 A0 69C C6B A4 92 BA 2D 119 2F EE C74 91

11 92F EE C7 491 52 478 A0 69C 6B A4 92 BA 2D 119 2F EE C74 91 524

5. In __________the agent learns from a series of rewards.

92 E C 49 52 47 A 69 6 A 92 BA 2D 11 2F EE C7 91 52 78
FE EC 74 15 47 8A 06 C6 BA 49 B 2 11 92 E C 49 52 47 A
EC 74 915 24 8A 06 9C BA 49 2B A2 D1 92 FE EC 749 15 47 8A 069
2. To pass the total Turing Test, the computer will need______
d) All of the above

b) Online learning
5. . The most widely used ensemble method is called ________

EEC749152478A069C6BA492BA2D1192F
74 915 24 78A 06 9C 6BA 49 2B A2 D1 192 FE EC 749 15 247 8A 069 C6
b) 8 queens problem

3. The process of removing detail from a representation is______

91 24 78 0 9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA
52 78 A0 69 6B A4 92 A D 19 2F E 74 91 24 78 0 9C 6B 4
3) Illustrations, in-depth answers and diagrams will be appreciated.

4._________ of a hypothesis as the proportion of mistakes it makes.

47 A 69 C6 A 92 BA 2D 11 2F EE C7 91 52 78 A0 69 6B A 92

(Percept, omniscient, reinforcement learning, error rate, Abstraction)

8A 06 C6 BA 49 B 2 1 92 E C 49 52 47 A 69 C6 A 49 BA
06 9C BA 49 2B A2 D1 192 FE EC 749 15 47 8A 069 C6 BA 49 2BA 2D

d) Support Vector Machine.

9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA 49 2B 2 1
Paper / Subject Code: 82901 / Artificial Intelligence

6B A4 92B A D 19 2FE EC 74 915 24 78A 06 9C 6B 49 2B A2 D1 192

A4 92 A 2D 119 2F E 74 91 24 78 06 9C 6B A4 2B A2 D1 19 FE
92 BA 2D 119 2F EE C74 91 524 78 A0 9C 6B A4 92B A2 D1 19 2FE EC
b) neighbours with discontinuities

BA 2D 11 2F EE C7 91 52 78 A0 69 6B A4 92 A D 19 2F E 74

1.The term _____ to refer to the agent’s perceptual inputs at any given instant.
2D 11 92F EE C7 491 52 478 A0 69C C6B A4 92 BA 2D 119 2F EE C74 91
d) State-Action-Reward-State-Action
b) Set-Action-Reward-State-Reaction

d) neighbours without discontinuities

11 92F EE C7 491 52 478 A0 69C 6B A4 92 BA 2D 119 2F EE C74 91 524

2 An ______agent knows the actual outcome of its actions and can act accordingly.
92 E C 49 52 47 A 69 6 A 92 BA 2D 11 2F EE C7 91 52 78
FE EC 74 15 47 8A 06 C6 BA 49 B 2 11 92 E C 49 52 47
EC 74 915 24 8A 06 9C BA 49 2B A2 D1 92 FE EC 749 15 47 8A
74 915 24 78A 06 9C 6BA 49 2B A2 D1 192 FE EC 749 15 247 8A
91 24 78 0 9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06
52 78 A0 69 6B A4 92 A D 19 2F E 74 91 24 78 0
[Total Marks: 75]

47 A 69 C6 A 92 BA 2D 11 2F EE C7 91 52 78 A0 69
(15)

8A 06 C6 BA 49 B 2 1 92 E C 49 52 47 A 69
06 9C BA 49 2B A2 D1 192 FE EC 749 15 47 8A 069 C
9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C
6B A4 92B A D 19 2FE EC 74 915 24 78A 06 9C 6B
A4 92 A 2D 119 2F E 74 91 24 78 06 9C 6B
92 BA 2D 119 2F EE C74 91 524 78 A0 9C 6B A
BA 2D 11 2F EE C7 91 52 78 A0 69 6B A4
2D 11 92F EE C7 491 52 478 A0 69C C6B A4
11 92F EE C7 491 52 478 A0 69C 6B A4 92
92 E C 49 52 47 A 69 6 A 92
FE EC 74 15 47 8A 06 C6 BA 49 B
EC 74 915 24 8A 06 9C BA 49 2B
74 915 24 78A 06 9C 6BA 49 2B A
 A D
52 2478 8A0 069 C6B BA4 492 2BA 2D 119 92F
C
24 478A A06 69C 6B A49 92B BA2 2D1 1192 2FE EEC
7 0 9 6 A 2 A D 1 F E 7
78 8A0 69C C6B BA4 492B BA 2D 119 92FE EEC C74 4915
6 2 1
8A A06 9C6 6BA A49 92B A2 D1 192 2FE EC 749 9152 247
06 9C BA 49 2B A2 D1 192 FE EC 749 15 47 8A
06 9C 6BA 49 2B A2 D1 192 FE EC 749 15 247 8A 069
6 D 1 7 2
69 9C6 BA 492 2BA A2D 11 92F FEE EC7 491 152 478 8A0 069C C6B
C B 4 9 C 4 4
9C 6B A4 92B BA2 2D1 119 2FE EEC 74 915 524 78A A06 69C 6BA A49
6 A 92 A D 1 2F E 7 91 2 78 0 9C 6B 4 2

(f)
(f)
(f)

(c)
(c)
(c)
(c)

(a)
(a)
(a)
(a)

(e)
(e)
(e)
(e)

(d)
(b)
(d)
(b)
(d)
(b)
(d)
(b)

Q. 5
Q. 4
Q. 3
Q. 2
6B BA4 492B BA 2D 119 92FE EEC C74 4915 524 478A A06 69C 6B A49 92B BA2
2 1 A

57089
BA A49 92B A2 D1 192 2FE EC 749 9152 247 78A 069 9C6 6BA 492 2BA A2D D11
4 2 B A2 D1 19 FE EC 74 15 4 8A 06 C BA 49 B 2 1 92
A4 92 A D 19 2F E 74 91 24 78 06 9C 6B 4 2B A2 D1 19 FE
92 BA 2D 119 2F EE C74 91 524 78 A0 9C 6B A4 92B A2 D1 19 2FE EC
BA 2D 11 2F EE C7 91 52 78 A0 69 6B A4 92 A D 19 2F E 74
2D 11 92F EE C7 491 52 478 A0 69C C6B A4 92 BA 2D 119 2F EE C74 91
11 92F EE C7 491 52 478 A0 69C 6B A4 92 BA 2D 119 2F EE C74 91 524 problem.
92 E C 49 52 47 A 69 6 A 92 BA 2D 11 2F EE C7 91 52 78
FE EC 74 15 47 8A 06 C6 BA 49 B 2 11 92 E C 49 52 47 A
EC 74 915 24 8A 06 9C BA 49 2B A2 D1 92 FE EC 749 15 47 8A 069
74 915 24 78A 06 9C 6BA 49 2B A2 D1 192 FE EC 749 15 247 8A 069 C6
91 24 78 0 9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA
52 78 A0 69 6B A4 92 A D 19 2F E 74 91 24 78 0 9C 6B 4
47 A 69 C6 A 92 BA 2D 11 2F EE C7 91 52 78 A0 69 6B A 92

supervised learning?
8A 06 C6 BA 49 B 2 1 92 E C 49 52 47 A 69 C6 A 49 BA
06 9C BA 49 2B A2 D1 192 FE EC 749 15 47 8A 069 C6 BA 49 2BA 2D
9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA 49 2B 2 1
6B A4 92B A D 19 2FE EC 74 915 24 78A 06 9C 6B 49 2B A2 D1 192
A4 92 A 2D 119 2F E 74 91 24 78 06 9C 6B A4 2B A2 D1 19 FE

What is Widrow–Hoff rule?

2. Known Vs Unknown
Explain A* search Algorithm.

92 BA 2D 119 2F EE C74 91 524 78 A0 9C 6B A4 92B A2 D1 19 2FE EC

BA 2D 11 2F EE C7 91 52 78 A0 69 6B A4 92 A D 19 2F E 74
1. Discrete Vs Continuous

2D 11 92F EE C7 491 52 478 A0 69C C6B A4 92 BA 2D 119 2F EE C74 91

11 92F EE C7 491 52 478 A0 69C 6B A4 92 BA 2D 119 2F EE C74 91 524
92 E C 49 52 47 A 69 6 A 92 BA 2D 11 2F EE C7 91 52 78
FE EC 74 15 47 8A 06 C6 BA 49 B 2 11 92 E C 49 52 47 A
Explain following task environments.

EC 74 915 24 8A 06 9C BA 49 2B A2 D1 92 FE EC 749 15 47 8A 069

74 915 24 78A 06 9C 6BA 49 2B A2 D1 192 FE EC 749 15 247 8A 069 C6
Describe working of Utility based agent.

91 24 78 0 9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA

What is Adaptive dynamic programming?

What is entropy? How do we calculate it?
52 78 A0 69 6B A4 92 A D 19 2F E 74 91 24 78 0 9C 6B 4

What is EM algorithm? What are its steps?

Explain Bayesian Learning with an example.
47 A 69 C6 A 92 BA 2D 11 2F EE C7 91 52 78 A0 69 6B A 92
Describe K-fold cross validation and LOOCV.

Explain recursive best-first search algorithm.

8A 06 C6 BA 49 B 2 1 92 E C 49 52 47 A 69 C6 A 49 BA
06 9C BA 49 2B A2 D1 192 FE EC 749 15 47 8A 069 C6 BA 49 2BA 2D
9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA 49 2B 2 1

Page 2 of 2
6B A4 92B A D 19 2FE EC 74 915 24 78A 06 9C 6B 49 2B A2 D1 192
What is an artificial neuron? Explain its structures.

Explain single-layer feed forward neural networks.

What is PEAS? Explain with two suitable examples.

Write a short note on temporal difference learning.

A4 92 A 2D 119 2F E 74 91 24 78 06 9C 6B A4 2B A2 D1 19 FE
Attempt the following (Any THREE)(Each of 5Marks)

92 BA 2D 119 2F EE C74 91 524 78 A0 9C 6B A4 92B A2 D1 19 2FE EC

What are beta distributions? Elaborate with example.

Attempt the following (Any THREE) (Each of 5Marks)

Attempt the following (Any THREE) (Each of 5Marks)
Attempt the following (Any THREE) (Each of 5Marks)

--------------------------
BA 2D 11 2F EE C7 91 52 78 A0 69 6B A4 92 A D 19 2F E 74

Explain any one application of Reinforcement Learning.

2D 11 92F EE C7 491 52 478 A0 69C C6B A4 92 BA 2D 119 2F EE C74 91
11 92F EE C7 491 52 478 A0 69C 6B A4 92 BA 2D 119 2F EE C74 91 524
92 E C 49 52 47 A 69 6 A 92 BA 2D 11 2F EE C7 91 52 78
FE EC 74 15 47 8A 06 C6 BA 49 B 2 11 92 E C 49 52 47 A
EC 74 915 24 8A 06 9C BA 49 2B A2 D1 92 FE EC 749 15 47 8A 069

EEC749152478A069C6BA492BA2D1192F
74 915 24 78A 06 9C 6BA 49 2B A2 D1 192 FE EC 749 15 247 8A 069 C6
Write the pseudo-code for the Decision-Tree-Learning algorithm.

91 24 78 0 9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA
Write a short note on support vector machines and its properties.

52 78 A0 69 6B A4 92 A D 19 2F E 74 91 24 78 0 9C 6B 4
List and explain the issues involved in applicability of decision trees.

47 A 69 C6 A 92 BA 2D 11 2F EE C7 91 52 78 A0 69 6B A 92
Explain the contribution of Mathematics, Psychology,Linguistics to AI.

8A 06 C6 BA 49 B 2 1 92 E C 49 52 47 A 69 C6 A 49 BA
06 9C BA 49 2B A2 D1 192 FE EC 749 15 47 8A 069 C6 BA 49 2BA 2D
Explain Maximum-likelihood parameter learning for Continuous models.
9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C BA 49 2B 2 1
Paper / Subject Code: 82901 / Artificial Intelligence

6B A4 92B A D 19 2FE EC 74 915 24 78A 06 9C 6B 49 2B A2 D1 192

A4 92 A 2D 119 2F E 74 91 24 78 06 9C 6B A4 2B A2 D1 19 FE
92 BA 2D 119 2F EE C74 91 524 78 A0 9C 6B A4 92B A2 D1 19 2FE EC
BA 2D 11 2F EE C7 91 52 78 A0 69 6B A4 92 A D 19 2F E 74
2D 11 92F EE C7 491 52 478 A0 69C C6B A4 92 BA 2D 119 2F EE C74 91
11 92F EE C7 491 52 478 A0 69C 6B A4 92 BA 2D 119 2F EE C74 91 524
92 E C 49 52 47 A 69 6 A 92 BA 2D 11 2F EE C7 91 52 78
FE EC 74 15 47 8A 06 C6 BA 49 B 2 11 92 E C 49 52 47
What are the similarities and differences between Reinforcement learning and
Define heuristic function. Give an example heuristic function for solving 8-puzzle

EC 74 915 24 8A 06 9C BA 49 2B A2 D1 92 FE EC 749 15 47 8A
74 915 24 78A 06 9C 6BA 49 2B A2 D1 192 FE EC 749 15 247 8A
91 24 78 0 9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06
52 78 A0 69 6B A4 92 A D 19 2F E 74 91 24 78 0
47 A 69 C6 A 92 BA 2D 11 2F EE C7 91 52 78 A0 69
(15)
(15)
(15)
(15)

8A 06 C6 BA 49 B 2 1 92 E C 49 52 47 A 69
06 9C BA 49 2B A2 D1 192 FE EC 749 15 47 8A 069 C
9C 6B 4 2B A2 D1 19 FE EC 74 15 24 8A 06 C
6B A4 92B A D 19 2FE EC 74 915 24 78A 06 9C 6B
A4 92 A 2D 119 2F E 74 91 24 78 06 9C 6B
92 BA 2D 119 2F EE C74 91 524 78 A0 9C 6B A
BA 2D 11 2F EE C7 91 52 78 A0 69 6B A4
2D 11 92F EE C7 491 52 478 A0 69C C6B A4
11 92F EE C7 491 52 478 A0 69C 6B A4 92
92 E C 49 52 47 A 69 6 A 92
FE EC 74 15 47 8A 06 C6 BA 49 B
EC 74 915 24 8A 06 9C BA 49 2B
74 915 24 78A 06 9C 6BA 49 2B A