Scribd
Upload
23 views2 pages

B.Tech Machine Learning Exam Questions

This document outlines the examination structure for a Machine Learning course at VNR Vignana Jyothi Institute of Engineering and Technology. It includes a set of eight questions covering various topics such as regression, decision trees, Bayesian learning, neural networks, K-Means clustering, and feature selection techniques. Each question carries equal marks, and students are required to answer any five questions within a three-hour time frame.

Uploaded by

Ajay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
23 views2 pages

B.Tech Machine Learning Exam Questions

This document outlines the examination structure for a Machine Learning course at VNR Vignana Jyothi Institute of Engineering and Technology. It includes a set of eight questions covering various topics such as regression, decision trees, Bayesian learning, neural networks, K-Means clustering, and feature selection techniques. Each question carries equal marks, and students are required to answer any five questions within a three-hour time frame.

Uploaded by

Ajay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Subject R1

Code
18PC1CS09 8
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY
(AUTONOMOUS)
B.Tech. III Year II Semester Regular Examinations, August 2021
MACHINE LEARNING
(Common to CSE and IT)
Time: 3 hours
Max. Marks: 60
Answer any FIVE questions.
All Questions carry EQUAL marks.
5X12=60
***
1. a) Define Machine Learning. Describe the steps in designing learning system. 6M CO-3
b) What is Regression? And Demonstrate simple linear regression with example. 6M BL-2
BL-4
2. Explain the concept of decision tree learning. Discuss the necessary measure required to 12M CO-2
select the attributes for building a Decision tree using ID3 algorithm. CO-3
BL-4

3. a) Distinguish between overfitting and underfitting. 6M CO-3


b) How do we avoid overfitting in the Decision tree learning? 6M CO-4
BL-3

4. a) Explain Bayesian concept learning. 4M CO-2


b) Describe Naïve Bayes Algorithm with an example. 8M CO-3
BL-3
BL-4

5. a) Discuss the application of Neural networks. 6M CO-2


b) Explain Perceptron algorithm for Boolean AND & OR gates. 6M CO-4
BL-3
BL-4

6. Illustrate K-Means clustering algorithm with an example. 12M CO-4


BL-4

7. a) Compare Feature Selection techniques. 6M CO-3


b) Explain how dimensionally can be reduced using PCA algorithm. 6M CO-2
BL-3
BL-4

8. For the given sets of points identify clusters using complete link and average link using 12M CO-3
agglomerative clustering. CO-4
Clusters A B BL-3
P1 1 1 BL-4
P2 1.5 1.5
P3 5 5
P4 3 4
Page 1 of 2
P5 4 4
P6s 3 3.5
***

Page 2 of 2

You might also like