Printed Page: 1 of 2

Subject Code: KCS055

0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM V) THEORY EXAMINATION 2023-24
MACHINE LEARNING TECHNIQUES
TIME: 3 HRS M.MARKS: 100

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
a. Discuss the important objectives of Machine Learning. 2 1
b. Discuss overfitting and underfitting situation in decision tree learning. 2 1
c. Discuss support vectors in SVM. 2 2
d. What is gradient descent delta rule? 2 2
e. Explain Case-based learning. 2 3
f. For which problem decision tree is best suitable. 2 3
g. Define the term ANN, and CNN. 2 4
h. Differentiate between Lazy and Eager Learning. 2 4
i. Comparison of purely analytical and purely inductive learning. 2 5
j. Define the term Offspring, Chromosome and Genes are used in GA. 2 5
90

2
13
SECTION B
_2

2. Attempt any three of the following: 10 x 3 = 30

2.
P1

a. Compare Supervised and Unsupervised Learning Techniques with 10 1

24
examples.
4D

5.
b. Explain Maximum Likelihood and Least Squared Error Hypothesis with 10 2
.5
P2

example.
17
c. Compare and contrast Information Gain, Gain Ratio, and Gini Index in 10 3
Q

detail.
|1

d. Explain the different layers used in convolutional neural network with 10 4

2

suitable examples.
3

e. Discuss the applications of reinforcement learning. In which problems 10 5

6:

reinforcement learning is used?

:2
13

SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
4
02

a. Compare regression, classification and clustering in machine learning 10 1

along with suitable real life applications.
-2

b. Explain the “Concept Learning” Task Giving an example. 10 1

01
1-

4. Attempt any one part of the following: 10 x 1 = 10

|3

a. Explain hyperplane (decision boundary) in SVM. Categorize various 10 2

popular kernels associated with SVM.
b. Differentiate between Naïve Bayes classifier and Bayesian belief 10 2
networks. Give an application of Bayesian belief networks.

5. Attempt any one part of the following: 10 x 1 = 10

a. Discuss Decision Tree and explain its working in detail. 10 3
b. Demonstrate K-Nearest Neighbors algorithm for classification with the 10 3
help of an example.
1|Page
QP24DP1_290 | 31-01-2024 13:26:32 | 117.55.242.132
 Printed Page: 2 of 2
Subject Code: KCS055
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM V) THEORY EXAMINATION 2023-24
MACHINE LEARNING TECHNIQUES
TIME: 3 HRS M.MARKS: 100

6. Attempt any one part of the following: 10 x 1 = 10

a. Illustrate backpropagation algorithm by assuming the training rules for 10 4
output unit weights and Hidden Unit weights.
b. Write short notes on Probably Approximately Correct (PAC) learning 10 4
model.

7. Attempt any one part of the following: 10 x 1 = 10

a. Explain Q-learning with its key terms, key feature and elements. Discuss 10 5
its applications used in real life.
b. Define the term Genetic Algorithm. Discuss the working of Genetic 10 5
algorithm with the help of flowchart.
90

2
13
_2

2.
P1

24
4D

5.
.5
P2

17
Q

|1
3 2
6:
:2
13
4
02
-2
01
1-
|3

2|Page
QP24DP1_290 | 31-01-2024 13:26:32 | 117.55.242.132
 Printed Pages: 01 Sub Code: KCS-055

Paper Id: 2 3 2 1 1 9 Roll No.

B. Tech.
(SEM V) THEORY EXAMINATION 2022-23
MACHINE LEARNING TECHNIQUES
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If you require any missing data, then choose suitably.

SECTION A
1. Attempt all questions in brief. 2*10 = 20
(a) Discuss model representation of artificial neuron.
(b) Explain general to specific ordering hypothesis in concept learning.
(c) Discuss support vectors in SVM.
(d) Compare Artificial Intelligence and Machine Learning.
(e) Discuss reinforcement learning.
(f) Illustrate the advantages of instance-based learning techniques over other machine learning
techniques.
(g) Differentiate between Gradient Descent and Stochastic Gradient Descent.
(h) Compare ANN and Bayesian network.
(i) Illustrate Markov decision model.
(j) Differentiate between Q learning and Deep Learning.

SECTION B
2. Attempt any three of the following: 10*3 = 30

2
(a) Explain supervised and unsupervised learning techniques.
90

13
(b) Discuss linear regression and logistic regression in detail.
_2

(c) Describe the following concepts in decision tree in detail:

2.
(i) Avoiding overfitting in decision tree. (ii) Incorporating continuous valued attributes.
P1

24
(d) Explain various types of activation functions with examples.

5.
3D

(e) Illustrate the process of Q-learning and discuss the following terms:

.5
(i) Q-values or action value (ii) Rewards and Episode (iii) Temporal difference or TD update.
P2

SECTION C 17
Q

|1
3. Attempt any one part of the following: 10*1 = 10
5

(a) Illustrate the various areas in which you can apply machine learning.
:4

(b) Compare regression, classification and clustering in machine learning along with suitable real-
44

life applications.
:

4. Attempt any one part of the following: 10 *1 = 10

13

(a) Discuss the role of Bayes theorem in machine learning. How naive Bayes algorithm is different
from Bayes theorem?
3

(b) Explain hyperplane (decision boundary) in SVM. Categorize various popular kernels
02

associated with SVM.

-2

5. Attempt any one part of the following: 10*1 = 10

01

(a) Demonstrate K-Nearest Neighbors algorithm for classification with the help of an example.
(b) Explain Instance based learning. Compare locally weighted regression and radial basis function
3-

networks.
|2

6. Attempt any one part of the following: 10*1 = 10

(a) Explain the different layers used in convolutional neural network with suitable examples.
(b) Illustrate backpropagation algorithm by assuming the training rules for output unit weights and
Hidden Unit weights.

7. Attempt any one part of the following: 10*1 = 10

(a) Explain various types of reinforcement learning techniques with suitable examples.
(b) How to Identify the reproduction cycle of genetic algorithm? Explain with suitable example.

QP23DP1_290 | 23-01-2023 13:44:45 | 117.55.242.132

 Printed Page: 1 of 2
Subject Code: KCS055
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

B. TECH
(SEM-V) THEORY EXAMINATION 2020-21
MACHINE LEARNING TECHNIQUES
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
Qno. Question Marks CO
a. Explain the concept of machine learning. 2 1
b. Compare ANN and Bayesian networks. 2 4
c. What is the difference between linear and logistic regression? 2 2
d. Discuss support vectors in SVM? 2 2
e. Discuss overfitting and underfitting situation in decision tree learning. 2 3
f. What is the task of the E-step of the EM-algorithm? 2 2
g. Define the learning classifiers. 2 2
h. What is the difference between machine learning and deep learning? 2 1
i. What objective function do regression trees minimize? 2 2
j. What is the difference between Q learning and deep Q learning? 2 5
SECTION B

1
0Q
2. Attempt any three of the following:

13
Qno. Question Marks CO
29

2.
a. Apply KNN for following dataset and predict class of test example 10 3

24
0E

(A1=3, A2=7).Assume K=3

A1 A2 Class

5.
P2

7 7 True

.5
_Q

7 4 True
3 4 False 17
TU

|1
1 4 True
5 3 False
AK

AM

6 3 True
b. Describe the Kohonen Self-Organizing Maps and its algorithm. 10 4
55

c. Explain the various learning models for reinforcement learning. 10 5

1:

d. Explain the role of genetic algorithm? Discuss the various phases 10 5

1

considered in genetic algorithm.

9:

e. Describe BPN algorithm in ANN along with a suitable example. 10 4

1
02

SECTION C
-2

3. Attempt any one part of the following:

ar

Qno. Question Marks CO

M

a. Why SVM is an example of a large margin classifier? Discuss the different 10 2

1-

kernels functions used in SVM.

|0

b. Explain the relevance of CBR. How CADET tool employs CBR? 10 3

4. Attempt any one part of the following:
Qno. Question Marks CO
a. Discuss the applications, properties, issues, and disadvantages of SVM. 10 2
b. Explain the Confusion Matrix with respect to Machine Learning 10 1
Algorithms.

1|Page
AKTU_QP20E290QP | 01-Mar-2021 9:11:55 AM | 117.55.242.131
 Printed Page: 2 of 2
Subject Code: KCS055
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

5. Attempt any one part of the following:

a. Illustrate the operation of the ID3 training example. Consider 10 3
information gain as attribute measure.

1
0Q

13
29

2.
24
0E

5.
P2

b. Describe Markov Decision Process in reinforcement learning. 10 5

.5
6. Attempt any one part of the following:
_Q

Qno. Question 17 Marks CO

TU

|1
a. What is instance based learning? How Locally Weighted Regression is 10 3
different from Radial basis function networks?
AK

AM

b. How is Bayes theorem used in machine learning? How naive Bayes algorithm 10 2
is different from Bayes theorem?
55

7. Attempt any one part of the following:

Qno. Question Marks CO
11:

a. Compare regression, classification and clustering in machine learning 10 1

9:

along with suitable real life applications?

b. Given below is an input matrix named I, kernel matrix, calculate the 10 4
1
02

Convoluted matrix C using stride =1 also apply max pooling on C.

-2
ar
M
1-
|0

2|Page
AKTU_QP20E290QP | 01-Mar-2021 9:11:55 AM | 117.55.242.131
 Printed Page: 1 of 2
Subject Code: KCS055
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

B.TECH.
(SEM V) THEORY EXAMINATION 2021-22
MACHINE LEARNING TECHNIQUES
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
Qno. Question Marks CO
a. What is a “Well -posed Learning “problem? Explain with an example. 2 CO1
b. What is Occam's razor in ML? 2 CO1
c. What is the role of Inductive Bias in ANN? 2 CO2
d. What is gradient descent delta rule? 2 CO2
e. What is Paired t Tests in Hypothesis evaluation? 2 CO3
f. How do you find the confidence interval for a hypothesis test? 2 CO3
g. What is sample complexity of a Learning Problem? 2 CO4
h. Differentiate between Lazy and Eager Learning 2 CO4
i. What is the problem of crowding in GA 2 CO5

1
j. Comparison of purely analytical and purely inductive learning. 2 CO5
90

13
_2

2.
SECTION B
1P

24
2. Attempt any three of the following:
2O

5.
.5
Qno. Question Marks CO
P2

17
a. Design the Final design of checkers learning program. 10 CO1
Q

b. What is Maximum Likelihood and Least Squared Error Hypothesis? 10 CO2

|1

c. What problem does the EM algorithm solve 10 CO3

04

d. Highlight the importance of Case Based Learning 10 CO4

0:

e. Write short notes on Learning First Order Rules 10 CO5

:0
09

SECTION C
2

3. Attempt any one part of the following:

02

Qno. Question Marks CO

-2

a. Explain the “Concept Learning” Task Giving an example 10 CO1

n

b. Find the maximally general hypothesis and maximally specific hypothesis 10 CO1
Ja

for the training examples given in the table using the candidate elimination
0-

algorithm.
|1

Given Training Example:

Sky Temp Humidity wind water Forecast sport

Sunny warm Normal Strong warm same Yes

1|Page
QP22O1P_290 | 10-Jan-2022 09:00:04 | 117.55.242.131
 Printed Page: 2 of 2
Subject Code: KCS055
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

Sunny warm High Strong warm same Yes

Rainy cold High Strong warm change No

Sunny warm High Strong cool change Yes

4. Attempt any one part of the following:

Qno. Question Marks CO
a. Comment on the Algorithmic convergence & Generalization property of 10 CO2
ANN.
b. Discuss the following issues in Decision Tree Learning: 10 CO2
1. Overfitting the data
2. Guarding against bad attribute choices
3. Handling continuous valued attributes
4. Handling missing attribute values
5. Handling attributes with differing costs

1
90

13
_2

2.
5. Attempt any one part of the following:
1P

24
Qno. Question Marks CO
2O

5.
a. How is Naïve Bayesian Classifier different from Bayesian Classifier? 10 CO3

.5
P2

b. Explain the role of Central Limit Theorem Approach for deriving 10 CO3
17
Confidence Interval.
Q

|1

6. Attempt any one part of the following:

04

Qno. Question Marks CO

0:

a. Write short notes on Probably Approximately Correct (PAC) learning 10 CO4

:0

model.
09

b. Discuss various Mistake Bound Model of Learning 10 CO4

2
02

7. Attempt any one part of the following:

-2

Qno. Question Marks CO

n
Ja

a. What is the significance of Learn -one Rule Algorithm? 10 CO5

0-

b. Describe a prototypical genetic algorithm along with various operations 10 CO5

possible in it.
|1

2|Page
QP22O1P_290 | 10-Jan-2022 09:00:04 | 117.55.242.131