1.a Explain the Bayesian Belief Network and conditional independence with example.

Calculate the probability that alarm has sounded, but there is neither a burglary,
nor an earthquake occurred, and David and Sophia both called the Harry.

1.b Enumerate the step K-Means algorithm, EM Algorithm and Gaussian Mixtures.
1.c Explain the local weighted regression algorithm.
2.a What are instance based learning and radial basis function? Explain key features and disadvantages of these
methods
2.b Explain the case based learning.
2.c Explain the K – nearest neighbour algorithm for approximating a discrete and
continues (real) valued target function with pseudo code and solve it.

3.a Explain Reinforcement learning problem with neat diagram and characteristics.
3.b Explain the approaches of knowledge representation with example.
3.c Write a resolution algorithm of predicate logic. Consider the following set of sentences
 represent in predicate logic.
1. Marcus was a man.
2. Marcus was a Pompeian.
3. All Pompeians were Romans.
4. Caesar was a ruler.
5. Also, All Pompeians were either loyal to Caesar or hated him.
6. Everyone is loyal to someone.
7. People only try to assassinate rulers they are not loyal to.
8. Marcus tried to assassinate Caesar.

4.a Explain the Q function and Q Learning Algorithm assuming deterministic rewards
and actions with below examplewhere learning rate is 0.8 solve it.

4.b Explain the issues in knowledge representation with example

4.c Write the step to convert clause form and unification algorithm with example.