Scribd
Upload
30 views10 pages

MLprevious Papers

Previous papers of ml

Uploaded by

Sri Tarak Ram Bandlamudi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views10 pages

MLprevious Papers

Previous papers of ml

Uploaded by

Sri Tarak Ram Bandlamudi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

17CS4704A VR17 Reg.

No:

VELAGAPUDI RAMAKRISHNA
b. Prove that how Maximum Likelihood (Bayesian learning) can be
used in any learning algorithms that are used to minimize the squared
SIDDHARTHA ENGINEERING COLLEGE
(AUTONOMOUS)
error between actual output hypotheses and predicted output
hypothesis. 8M IV/IV B.Tech. DEGREE EXAMINATION, MARCH, 2021
Seventh Semester
UNIT-IV COMPUTER SCIENCE AND ENGINEERING
17CS4704A MACHINE LEARNING
8. a. Describe in detail about learning sets of first order rules using
FOIL algorithm. 8M Time: 3hours Max. Marks: 70
b. How to guide the search in FOIL algorithm? 7M Part-A is compulsory
Answer One Question from each Unit of Part-B
(or) Answer to any single question or its part shall be written at one place only

9. a. Define Genetic Programing and explain how to represent the


PART-A
programs in Genetic Programming? 8M
10 x 1 = 10M
b. Analyze the approaches for parallelization of Genetic
1. a. How to choose the value of ‘k’ for k-NN classifier?
Algorithm. 7M
b. What is Maximum Likelihood hypothesis?
*** c. Define Bayes theorem.
d. What is inductive machine learning?
e. Mention the three main types of machine learning.
f. What is perceptron in machine learning?
g. Give a popular application of machine learning that you see on day
to day basis.
h. Identify the searching approach used in General to Specific search
used in Sequential Covering algorithm.
i. Whether XOR problem can be solved by a single perceptron model?
j. What is the objective of a learning rule?
Page 4 of 4 Page 1 of 4
17CS4704A VR17 17CS4704A
PART-B UNIT-II
4 x 15 = 60M
4. a. Describe the following with examples: 7M
UNIT-I
i) Decision tree
2. a. Explain Version Space and Representation of Version Space with ii) Decision tree learning
an example. 7M
iii) Decision tree representation
b. Illustrate Find S Algorithm over EnjoySport concept. Training
b. At what conditions the perceptron rule fails and it becomes
instances given below 8M
necessary to apply the delta rule? Analyze. 8M

(or)

5. a. Discuss Inductive Bias in Decision tree learning. 7M

b. Derive the Back propagation rule considering the training rule


for output unit weights and training rule for hidden unit
weights. 8M
(or)
UNIT-III
3. a. Apply candidate elimination algorithm to obtain the final version
space. 8M
6. a. Discuss Maximum Likelihood and Least Square Error hypothesis.
7M

b. Explain Bayesian belief network and conditional independence


with an example. 8M

(or)

7. a. Explain the concept of EM algorithm. Discuss what are Gaussian


b. Discuss Concept learning as search with respect to General to
mixtures? 7M
specific ordering of hypothesis. 7M

Page 2 of 4 Page 3 of 4

You might also like