BCM601

Model Question Paper with effect from 2022 (CBCS Scheme)

6 th Semester B.E. Degree Examination

Note: 01. Answer any FIVE full questions choosing at least ONE question from each MODULE

*Bloom’s
Module -1 Taxonomy Marks
Level
Q.01 a What is Machine learning? Explain with an example why to use machine learning L2 10
b Solve and find the covariance and correlation of data X={2,3,4,5,6} and 10
Y={1,3,5,7,9} L3
OR
Q.02 a Explain Big Data and the components of a Big Data Analytics Framework. L5 10
b Infer the concepts of Univariate, Bivariate, and Multivariate data analysis with L2 10
suitable examples.
Module-2
Q. 03 a Examine the concept of Inductive Bias and why is it important in Machine L4 10
Learning?
b Consider the following training dataset L3 10

Generate the set of consistent hypotheses using Find-S algorithm and Candidate
Elimination algorithm.
OR
Q.04 a Analyse and explain the concept of Bias-Variance Tradeoff and its impact L4 10
on ML models.
b Solve the suitability of different cross-validation techniques (Holdout, K- L3 10
Fold, LOOCV) in training a classifier with a small dataset.
Module-3
Q. 05 a Examine k-Nearest Neighbor and Weighted K-Nearest Neighbor algorithm with L4 10
input, output, and prediction.
b Solve given problem using locally weighted regression. L3 10
S.no Salary(in lakhs) Expenditure(in thousands)
1. 5 25
2. 1 5
3. 2 7
4. 1 8
OR
Q. 06 a Evaluate a regression model using MAE, MSE, RMSE and R² on this L3 10
dataset:
S.no Actual Y Predicted Y
1. 1 3.5
2. 2 4.5
3. 4 7.5
Page 01 of 02
 BCM601
b Distinguish between Instance-based learning and Model-based learning. Assess L4 10
how the Nearest Centroid Classifier algorithm works, and what are its key steps.
Module-4
Q. 07 a Identify and explain the working mechanism of the Naïve Bayes classifier. L3 10

b Construct a decision tree and predict the target class for a test instance (6, 1, 6.7) L4 10
with the training dataset consisting of 10 data instances and 3 attributes.

OR
Q. 08 a Apply ID3 algorithm for constructing decision tree for the following training L3 10
example.
Day Outlook Temperature Humidity Wind Play Tennis
D1 Sunny Hot High Weak No
D2 Sunny Hot High Strong No
D3 Overcast Hot High Weak Yes
D4 Rain Mild High Weak Yes
D5 Rain Cool Normal Weak Yes
b Explain the procedure to construct decision tree using C4.5 with example and L2 10
Compare entropy, Gini index, and classification error as impurity measures
in decision trees.
Module-5
Q. 09 a Describe the Single Linkage (MIN) algorithm, demonstrate the process of L4 10
identifying clusters with it, and also create the corresponding dendrogram.
Objects X Y
0 1 4
1 2 8
2 5 10
3 12 18
4 14 28
b Explain the Partitional Clustering Algorithm with its advantages, disadvantages and L2 10
example.
OR
Q. 10 a With neat Sketch Explain the components of reinforcement learning. L3 10

b Detail the scope of reinforcement Learning. L2 10

Page 01 of 02
Page 02 of 02