INTERNAL ASSESMENT TEST: III Date: 29/12/2022

SUB : AI&ML (18CS71) USN: MAX MARKS : 40

SEM : VII “A” TIME : 90 min

NOTE: Answer TWO full questions

1.llustrate Bayes Theorem and maximum posterior hypothesis. 10M[CO4]

2.Outline Brute force MAP Learning Algorithm . 10M[CO4]

OR
3. Demonstrate the derivation of K- Means Algorithm . 10M[CO4]
4. Bring out the steps of Gibbs Algorithm . 10M[CO4]
OR
5. With a neat sketch briefly explain Global Approximation of Radial basis function .10M[CO5]
6. Derive the Gradient descent rule for a distance- weighted local linear approximation to the
target function . 10M[CO5]
OR
7. Discuss the learning tasks and Q learning in the context of reinforcement learning.10M[CO5]
8. Discuss the Minimum Description Length algorithm . 10M[CO5]

****************

INTERNAL ASSESMENT TEST: III Date: 29/12/2022

SUB : AI&ML (18CS71) USN: MAX MARKS : 40
SEM : VII “A” TIME : 90 min
NOTE: Answer TWO full questions
1.llustrate Bayes Theorem and maximum posterior hypothesis. 10M[CO4]
2.Outline Brute force MAP Learning Algorithm . 10M[CO4]
OR
3. Demonstrate the derivation of K- Means Algorithm . 10M[CO4]
4. Bring out the steps of Gibbs Algorithm . 10M[CO4]
OR
5. With a neat sketch briefly explain Global Approximation of Radial basis function .10M[CO5]
6. Derive the Gradient descent rule for a distance- weighted local linear approximation to the
target function . 10M[CO5]
OR
7. Discuss the learning tasks and Q learning in the context of reinforcement learning.10M[CO5]
8. Discuss the Minimum Description Length algorithm . 10M[CO5]

Signautre of Faculty Signautre of HOD

*******************