Scribd
Upload
75 views

Machine Learning (1)

The document outlines the structure of the B.Tech IV Semester End Examinations for the Machine Learning course at Aditya Engineering College. It includes two sections: Section A with 10 short answer questions worth 2 marks each, and Section B with 5 detailed questions worth 10 marks each, covering various topics in machine learning. Key topics include machine learning definitions, algorithms, evaluation techniques, and clustering methods.

Uploaded by

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

Machine Learning (1)

The document outlines the structure of the B.Tech IV Semester End Examinations for the Machine Learning course at Aditya Engineering College. It includes two sections: Section A with 10 short answer questions worth 2 marks each, and Section B with 5 detailed questions worth 10 marks each, covering various topics in machine learning. Key topics include machine learning definitions, algorithms, evaluation techniques, and clustering methods.

Uploaded by

Rasul Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

H.T.

No: Course Code: 231AM4T02

ADITYA ENGINEERING COLLEGE (A)


B.Tech - IV Semester End Examinations (AR23)
MACHINE LEARNING
(Artificial Intelligence and Machine Learning)
Time: 3 hours Max. Marks: 70
1. Answer all 10 questions from Section-A. Each question carries 2 marks.
2. Answer one question from each unit in Section-B. Each question carries 10 marks.

SECTION –A 10 X 2 =20

1 a Define machine learning and list its primary paradigms L2 CO1 [2M]
b What is reinforcement learning? Provide an example. L1 CO1 [2M]
c Describe the concept of proximity measures in machine learning. L2 CO2 [2M]
d What is the K-Nearest Neighbour (KNN) classifier? L1 CO2 [2M]
e Explain the concept of impurity measures in decision trees. L3 CO3 [2M]
f What is Bayes' rule? Write its mathematical formula. L1 CO3 [2M]
g Define linear discriminants in the context of machine learning L1 CO4 [2M]
h What is the kernel trick in support vector machines? L2 CO4 [2M]
i Explain the concept of clustering in machine learning. L2 CO5 [2M]
j Differentiate between K-means clustering and fuzzy C-means L4 CO5 [2M]
clustering.

SECTION –B 5 X 10 =50

UNIT-I
2 a Discuss the stages in machine learning with examples. L2 CO1 [5M]
b Explain the process and importance of feature engineering in machine L3 CO1 [5M]
learning.
OR
3 a What are the different types of data in machine learning? Provide L2 CO1 [5M]
examples.
b Describe the process of model evaluation and prediction. Include its L3 CO1 [5M]
significance.

UNIT-II
4 a What are distance measures? Explain any two with examples L2 CO2 [5M]
b Describe the K-Nearest Neighbor (KNN) regression algorithm with L3 CO2 [5M]
an example.
OR
5 a Discuss the performance evaluation techniques for classification L2 CO2 [5M]
algorithms
b Explain the Radius Distance Nearest Neighbor algorithm. Compare it L4 CO2 [5M]
with KNN.

(P.T.O)
UNIT-III
6 a What are decision trees? Explain their properties. L2 CO3 [5M]
b Write a detailed note on the bias-variance trade-off with respect to L3 CO3 [5M]
decision trees.
OR
7 a Discuss the Naive Bayes Classifier and its applications in multi-class L2 CO3 [5M]
classification
b Explain how random forests improve classification and regression L4 CO3 [5M]
tasks

UNIT-IV
8 a Describe the perceptron learning algorithm with a diagram. L2 CO4 [5M]
b Explain logistic regression and its application in classification. L3 CO4 [5M]
OR
9 a Discuss the backpropagation algorithm used for training multi-layer L3 CO4 [5M]
perceptron.
b Compare and contrast linear and non-linear support vector machines. L4 CO4 [5M]

UNIT-V
10 a Explain K-means clustering with its algorithm and provide an L2 CO5 [5M]
example.
b Write a detailed note on expectation-maximization-based clustering. L3 CO5 [5M]
OR
11 a Discuss the differences between agglomerative and divisive clustering L2 CO5 [5M]
methods.
b What is spectral clustering? Explain its process and applications. L4 CO5 [5M]

*****

You might also like