MQP2
MQP2
USN 18CS62
B. E. Degree (Autonomous) Sixth Semester End Examination (SEE), June/July 2022
MACHINE LEARNING
(Model Question Paper - II)
[Time: 3 Hours ] [ Maximum Marks: 100]
Instructions to students:
B) Write FIND-S algorithm. Using Find-S Algorithm find the 10M CO2 L3
hypothesis to figure out if a person is Covid Positive or not using
the data given below with Solve according to examples in Unit1 Notes
OR
2 A) The Bank wants to decide whether or not an individual should be 10M CO2 L3
given a bank loan or not. Use Candidate - Elimination Algorithm on
the data below to find the decision.Will Solve and send later
3 A) Describe the ID3 algorithm for decision tree learning. Unit2 Page4 10M CO2 L2
B) Give Decision trees to represent the Boolean Functions: 10M CO2 L3
a) A && ~ B
Unit2 Last Three pages
b) A V [B && C]
c) A XOR B
d) [A&&B] V [C&&D]
OR
4 A) Construct the decision tree for the following trainingexamples using 12M CO3 L3
ID3 Algorithm.
Unit2 Page20 B)Write a note on Occam’s razor and minimum description principal. 08M CO2 L2
5 A) Implement AND NOT function using McCulloch Pitts(MP) 10M CO3 L3
neuron(Use binary data representation) Unit3 Page94
7 A) Prove that how maximum likelihood (Bayesian Learning) can be used 08M CO3 L3
in any learning algorithms After learning
that are used the concepts the
to minimize we can writeerror
squared answer on our own
between actual output hypothesis and predicted output hypothesis.
B) Explain Naïve Bayes Classifier and Bayesian belief networks. 12M CO1 L2
Unit4 15 and 18 OR
8 A) Explain maximum a posteriori (MAP) hypothesis using Bayes 10M CO2 L2
Theorem. Unit4 Page4
B) Explain Bayesian belief networks and Conditional independence with 10M CO2 L2
an example. Unit4 Page16
9 A) Define the following terms 5M CO1 L2
Unit5 Page15
a) Sample error. b) True error. c) Expected value. Mean
Unit5 Page11
B) Explain Binomial Distribution. Unit5 Page14 5M CO4 L2
C) Explain the K – nearest neighbour algorithm for approximating a 10M CO4 L3