GNITS-R- 18 –116PR

G. Narayanamma Institute of Technology & Science

(Autonomous) (for Women)
Shaikpet, Hyderabad- 500 104

III-B.Tech II-Semester Regular/Supplementary Examinations, June - 2023

INTRODUCTION TO MACHINE LEARNING
(Common to CSM & CSD)
Max. Marks: 70 Time: 03 Hours

Note:
1. Question paper comprises of Part A and Part B.
2. Part A is compulsory which carries 10 marks. Answer all questions in Part A.
3. Part B (for 60 marks) consists of five questions with “either” “or” pattern. Each question
carries 12 marks and may have a,b,c as sub questions. The student has to answer any one full
question.

PART-A
(Answer 05 questions. Each question carries 2 marks)
Q.No. Question Marks CO BL
Q.1 a) Define the term Version space. [02] CO1 [L1]
b) What are parametric methods in machine learning? [02] CO2 [L1]
c) List the applications of Naïve Bayes classifier. [02] CO3 [L2]
d) How to select the value of K in the K-NN Algorithm? [02] CO4 [L4]
e) What is hypothesis space search in Genetic approach? [02] CO5 [L1]
END OF PART A

PART-B
(Answer 05 full questions. Each question carries 12 marks)
Q.No. Question Marks CO BL
Q.2(a) Distinguish between Supervised and Unsupervised learning with suitable [04] CO1 [L4]
example.
(b) Write the Candidate elimination algorithm and explain with an example. [08] CO1 [L2]

OR
Q.3(a) Discuss any two applications of machine learning with examples. [04] CO1 [L2]
(b) Write FIND-S algorithm and explain with example given below: [08] CO6 [L3]
Example Sky Air Humidity Wind Water Forecast Enjoy
Temp Sport
1 Sunny Warm Normal Strong Warm Same Yes
2 Sunny Warm High Strong Warm Same Yes
3 Rainy Cold High Strong Warm Change No
4 Sunny Warm High Strong Cool Change Yes

Page 1 of 2
 GNITS-R- 18 –116PR

Q.4(a) Derive Expressions to estimate mean and variance in parametric [06] CO2 [L3]
classification.
(b) Explain Support Vector Machine for Non-linear regression. [06] CO2 [L2]
OR
Q.5(a) Explain Bayes’ Estimator. [06] CO2 [L2]
(b) Derive Optimal hyperplane for non-linearly separable patterns. [06] CO2 [L3]
-----------------------------------------------------------------------------------------------------------------------------------
Q.6(a) Explain Naïve Bayes classifier with an example. [06] CO3 [L2]
(b) Write the steps of the ID3 decision tree Algorithm. [06] CO3 [L1]
OR
Q.7(a) Explain Bayes Optimal Classifier with an example. [08] CO3 [L2]
(b) Explain the various issues in Decision tree Learning [04] CO3 [L2]

-----------------------------------------------------------------------------------------------------------------------------------
Q.8(a) Apply K-nearest neighbor on the following data and predict the instance [06] CO6 [L3]
<3.5, 5.75> by using suitable K.

(b) Illustrate K means clustering algorithm with an example [06] CO4 [L3]

OR
Q.9(a) Discuss the major drawbacks of K-nearest Neighbour learning [06] CO4 [L2]
Algorithm and how it can be corrected?
(b) Explain in detail about hierarchical clustering. [06] CO4 [L2]
-----------------------------------------------------------------------------------------------------------------------------------
Q.10(a) Define Reinforcement Learning. Write about Nondeterministic rewards [05] CO5 [L2]
and actions.
(b) Describe the steps in genetic algorithms. [07] CO5 [L2]
OR
Q.11(a) Distinguish between Supervised learning and Reinforcement learning. [06] CO5 [L4]
Illustrate with an example.
(b) What is genetic programming? How can you perform crossover [06] CO5 [L2]
operation in Genetic programs?

END OF PART B
END OF THE QUESTION PAPER

Page 2 of 2