.

Printed Page:- 04 Subject Code:- ACSML0502

Roll. No:

NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY, GREATER NOIDA

(An Autonomous Institute Affiliated to AKTU, Lucknow)
B.Tech
SEM: V - THEORY EXAMINATION, DEC - 2023
Subject: Machine Learning
Time: 3 Hours Max. Marks: 100
General Instructions:
IMP: Verify that you have received the question paper with the correct course, code, branch etc.
1. This Question paper comprises of three Sections -A, B, & C. It consists of Multiple Choice
Questions (MCQ’s) & Subjective type questions.
2. Maximum marks for each question are indicated on right -hand side of each question.
3. Illustrate your answers with neat sketches wherever necessary.
4. Assume suitable data if necessary.
5. Preferably, write the answers in sequential order.
6. No sheet should be left blank. Any written material after a blank sheet will not be
evaluated/checked.

SECTION A

E T 20

1. Attempt all parts:-

1-a. FIND-S algorithm ignores.(CO1)

N I 1

(a) Positive
(b) Negative
(c) Both
(d) None

1-b. Which of the following is not a supervised learning algorithm. (CO1) 1

(a) PCA
(b) Naive Bayesian
(c) Linear regression
(d) Decision tree

1-c. In general, to have a well-defined learning problem, we must identity which of 1

the following (CO2)

(a) The class of tasks

(b) The measure of performance to be improved

.
Page 1 of 4
 .
(c) The source of experience
(d) All of the above

1-d. Which of the following evaluation metrics can be used to evaluate a model 1
while modeling a continuous output variable? (CO2)

(a) AUC-ROC
(b) Accuracy
(c) Logloss
(d) Mean-Squared-Error

1-e. Point out the correct statement. (CO3) 1

(a) The choice of an appropriate metric will influence the shape of the clusters
(b) Hierarchical clustering is also called HCA
(c) In general, the merges and splits are determined in a greedy manner
(d) All of the mentioned

1-f. Which version of the clustering algorithm is most sensitive to outliers? (CO3) 1

(a) K-means clustering

(b) K-modes clustering
(c) K-median clustering
(d) all of the above

E T
1-g.

(a) One
N I
How many Firms in Exact Bayes Calculation ? (CO4) 1

(b) Two
(c) Three
(d) None of these

1-h. The benefit of Naïve Bayes algorithm (CO4) 1

(a) Naïve Bayes is one of the fast and easy ML algorithms to predict a class of
datasets.
(b) It is the most popular choice for text classification problems.
(c) It can be used for Binary as well as Multi-class Classifications.
(d) All of the above

1-i. ________is a type of Machine Learning paradigms in which a learning algorithm 1

is trained not on preset data but rather based on a feedback system. (CO5)

(a) Supervised learning

(b) Unsupervised learning

.
Page 2 of 4
 .
(c) Reinforcement Learning
(d) None of the above

1-j. Which of the following is false about Upper confidence bound? (CO5) 1

(a) It’s a Deterministic algorithm

(b) It does not allow delayed feedback
(c) It is not based on Bayes inference
(d) None

2. Attempt all parts:-

2.a. Define Hebb Learning. (CO1) 2

2.b. Explain Dependent and Indepenedent Variable. (CO2) 2

2.c. How to choose the optimal value of K in the KNN Algorithm? (CO3) 2

2.d. How does random forest Work? (CO4) 2

2.e. Write the application areas of Reinforcement Learning. (CO5) 2

SECTION B 30

3. Answer any five of the following:-

3-a. Explain Types of Machine Learning. (CO1) 6

3-b.
T
Explain the inductive biased hypothesis space and unbiased learner. (CO1)

E
6

3-c.

3-d.
dataset. (CO2)

N I
Justify the cases where the linear regression algorithm is suitable for a given

How many neurons are required in each layer of ANN ? (CO2)

6

3.e. Explain the steps of k-Means Clustering Algorithm. (CO3) 6

3.f. What is a Gradient Boosted Decision Tree? (CO4) 6

3.g. Explain Characteristics of Reinforcement Learning. (CO5) 6

SECTION C 50

4. Answer any one of the following:-

4-a. What do you mean by a well –posed learning problem? Explain the important 10
features
that are required to well –define a learning problem. (CO1)

4-b. What are the basic design issues and approaches to machine learning? (CO1) 10

5. Answer any one of the following:-

5-a. What are issues in decision tree learning? Explain briefly How are they 10
overcome? Discuss the following issues in detail. (CO2)
a. Avoiding overfitting in Decision Trees
.
Page 3 of 4
 .
b. Incorporating Continuous valued attributes
c. Handling Training Examples with Missing attribute values.
d. Handling Attributes with Different costs.

5-b. Explain Learning Algorithm with respect to ANN. What are the requirements of 10
learning laws for effective implementation? (CO2)

6. Answer any one of the following:-

6-a. Explain the concept of KNN Algorithm with example. (CO3) 10

6-b. What are the pros and cons of the K-means Algorithm? Also differentiate 10
between K-means and K - nearest neighbors. (CO3)

7. Answer any one of the following:-

7-a. How can we improve Gradient Boosted Decision Trees? Also write advatange of 10
it. (CO4)

7-b. How is data prepared while performing XGB? (CO4) 10

8. Answer any one of the following:-

8-a. What are some common use cases for reinforcement learning 10
algorithms? (CO5)

8-b. Describe the Discount Factor's function in Reinforcement Learning. (CO5) 10

E T
N I

.
Page 4 of 4