NAVKIS COLLEGE OF ENGINEERING, HASSAN

Department Of Computer Science and Engineering

Questions Bank

Module -4
1. Define the Bayesian theorem?
2. Explain the concept of Bayes theorem with an example
3. What are the relevance and features of the Bayesian theorem?
4. Explain the practical difficulties of the Bayesian theorem.
5. Define is Maximum a Posteriori (MAP) and explain the same with derivation.
6. Explain the concept of Maximum Likelihood (ML) Hypothesis.
7. Derive the relation for hMAP and hML using the Bayesian theorem.
8. Consider a medical diagnosis problem in which there are two alternative hypotheses: 1. that the
patient has a particular form of cancer (+) and 2. That the patient does not (-). A patient takes a
lab test and the result comes back positive. The test returns a correct positive result in only 98%
of the cases in which the disease is actually present, and a correct negative result in only 97%
of the cases in which the disease is not present. Furthermore, .008 of the entire population have
this cancer. Determine whether the patient has Cancer or not using MAP hypothesis.
9. Explain Brute force Bayes Concept Learning. Or Explain Brute-force MAP learning algorithm.
10. What are Consistent Learners? Discuss Maximum Likelihood and Least Square Error
Hypothesis.
11. Describe the Maximum Likelihood Hypothesis for predicting probabilities.
12. Prove that how maximum likelihood can be used in any learning algorithms that are used to
minimize the squared error between actual output hypothesis and predicted output hypothesis.
13. Describe the concept of MDL. Obtain the equation for hMDL.
14. Explain Naïve Bayes Classifier with an Example.
15. Problems on Naïve Bayes Classifier.
16. What are Bayesian Belief nets? Where are they used?
17. Explain the Bayesian belief network and conditional independence with an example.
18. Explain the concept of EM Algorithm.
19. Explain the Gradient Search to Maximize Likelihood in a neural Net.
 NAVKIS COLLEGE OF ENGINEERING, HASSAN
Department Of Computer Science and Engineering
Questions Bank

Module -05
1. What are instance based learning? Explain key features and disadvantages of these methods.
2. Explain the K – nearest neighbour algorithm for approximating a discrete – valued function
with pseudo code
3. Describe K-nearest Neighbour learning Algorithm for continues (real) valued target function.
4. Discuss the major drawbacks of K-nearest Neighbour learning Algorithm and how it can be
corrected
5. Define the following terms with respect to K - Nearest Neighbour Learning :
i) Regression ii) Residual iii) Kernel Function.
6. Explain Locally Weighted Linear Regression.
7. Explain radial basis function
8. Explain CADET System using Case based reasoning.
9. What is Reinforcement Learning and explain Reinforcement learning problem with neat
diagram. Write Reinforcement learning problem characteristics.
10. Explain the Q function and Q Learning Algorithm assuming deterministic rewards and
actions with example.