.

Printed Page:- 04 Subject Code:- ACSML0601

Roll. No:

NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY, GREATER NOIDA

(An Autonomous Institute Affiliated to AKTU, Lucknow)
B.Tech
SEM: VI - THEORY EXAMINATION (20.....-
2022-202320.....)
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.

3. Illustrate your answers with neat sketches wherever necessary.

n e
2. Maximum marks for each question are indicated on right -hand side of each question.

4. Assume suitable data if necessary.

5. Preferably, write the answers in sequential order.
Ju
evaluated/checked.
n _
6. No sheet should be left blank. Any written material after a blank sheet will not be

1. Attempt all parts:-

Ja
SECTION A 20

1-a.
3
What is the term known as on which the machine learning algorithms build a

2
1

(a) Data Training

2 -
model based on sample data? (CO1)

0 2
(b) Training data
(c) Transfer data

1-b.
2
(d) None of the above

…….is a widely used and effective machine learning algorithm based on the 1
idea of bagging. (CO1)

(a) Regression
(b) Classification
(c) Decision Tree
(d) Random Forest

1-c. What is a dependent variable? (CO2) 1

(a) The value we want to predict

.
Page 1 of 4
 .
(b) The parameters of the regression algorithm
(c) The features of our dataset
(d) The values that interfere in the value we want to predict

1-d. The discrepancy between the numbers used to represent something that we 1
are trying to measure and the actual value of what we are measuring is called:
(CO2)

(a) Variance
(b) The ‘fit’ of the model
(c) Reliability
(d) Measurement error

1-e. Choose from the following that are Decision Tree nodes? (CO3) 1

(a) Decision Nodes

(b) End Nodes
(c) Chance Nodes
n e
(d) All of the mentioned

Ju
1-f. Decision Tree is the most powerful for………..

(a) Classification
n
(CO3)
_ 1

(b) Prediction
(c) Classification & Prediction
Ja
(d) None of thses
3
1-g.

2 -2
Which is true for neural networks? (CO4)

(a) It has set of nodes and connections

1

2
(b) Each node computes it’s weighted input

0
1-h.
2
(c) Node could be in excited state or non-excited state
(d) All of the mentioned

Information from other neurons, in the form of electrical impulses, enters the 1
dendrites at connection points called (CO4)

(a) Axions
(b) Synapse
(c) Dendrites
(d) Weights

1-i. _______ is an area of Machine Learning in which about taking suitable action to 1
maximize reward in a particular situation. (CO5)

.
Page 2 of 4
 .
(a) Supervised learning
(b) unsupervised learning
(c) Reinforcement learning
(d) None of these

1-j. In_________ , output depends on the state of the current input and the next 1
input depends on the output of the previous input. (CO5)

(a) Supervised learning

(b) unsupervised learning
(c) Reinforcement learning
(d) None of these

2. Attempt all parts:-

2.a. Describe 'Training data' and 'Testing data'. (CO1) 2

2.b. Explain Bias Variance Tradeoff? (CO2)

n e 2

2.c.

2.d.
What is confusion matrix? (CO3)

Ju
What is a perceptron? Write the name of the different types of Perceptron.
2

2.e.
(CO4)

n _
How Reinforcement Learning is different from Supervised learning? (CO5) 2

3. Answer any five of the following:- Ja

SECTION B 30

3-a.

2 3
Define Machine Learning. Discuss the importance of machine learning with 6

3-b.
examples. (CO1)

2 -
What are the various steps involved in designing a well posed learning 6
system? (CO1)

0 2
3-c.

3-d.

3.e.
2
How a Linear regression model is different from Logistic Regression?

Explain Support Vector Machine algorithm with suitable example. (CO2)

(CO2)

Explain Entropy, Information gain and Gini Index used in building a Decision
6

6
tree. (CO3)

3.f. State and Explain Bayes Theorem. (CO4) 6

3.g. Explain Q Learning algorithm in detail. (CO5) 6

SECTION C 50

4. Answer any one of the following:-

4-a. Demonstrate Find S algorithm for finding the most specific hypothesis based 10
on given set of training data samples. (CO1)

.
Page 3 of 4
 .

4-b. How Data Science is different from Machine Learning? (CO1) 10

5. Answer any one of the following:-

5-a. Explain CART Algorithm for building decision tree. (CO2) 10

5-b. Explain Apriori Algorithm. Consider following dataset and write Association 10
Rules for the same if minimum support is 2 and confidence is 50% (CO2)

n e
Ju
6. Answer any one of the following:-

n _
6-a.

6-b.
Ja
Differentiate between Agglomerative Clustering and DIANA. (CO3)

Explain K-nearest Neighbour learning Algorithm. Consider following dataset

10

10
and find the value of ?.

2
(CO4)
3
2 -
0 2
7-a.
2
7. Answer any one of the following:-

Differentiate between Gradient Boosting and Random Forest. (CO4) 10

7-b. Explain Naive Bayes Classifier in detail with an example. (CO4) 10

8. Answer any one of the following:-

8-a. What are the four key components of Reinforcement Learning? What kind of 10
problems can be solved with reinforcement learning? (CO5)

8-b. Explain the steps involved in a typical Reinforcement Learning algorithm? (CO5) 10

.
Page 4 of 4