Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
655 views2 pages

ML Question

This document is a 2-page exam question paper for a Machine Learning course. It contains 20 multiple choice and numerical questions across 5 modules: 1) Module I covers overfitting, underfitting, types of machine learning, and recommender systems. 2) Module II distinguishes regression and classification models and types of regression. 3) Module III explains gradient descent, support vector machines, perceptrons, and linearly/non-linearly separable data. 4) Module IV covers k-means clustering, hierarchical clustering, and bagging. 5) Module V discusses ROC curves, confusion matrices, and principal component analysis.

Uploaded by

Dr. Jayanthi V.S.
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
655 views2 pages

ML Question

This document is a 2-page exam question paper for a Machine Learning course. It contains 20 multiple choice and numerical questions across 5 modules: 1) Module I covers overfitting, underfitting, types of machine learning, and recommender systems. 2) Module II distinguishes regression and classification models and types of regression. 3) Module III explains gradient descent, support vector machines, perceptrons, and linearly/non-linearly separable data. 4) Module IV covers k-means clustering, hierarchical clustering, and bagging. 5) Module V discusses ROC curves, confusion matrices, and principal component analysis.

Uploaded by

Dr. Jayanthi V.S.
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

B 1000ECT463122203 Pages: 2

Reg No.:_______________ Name:__________________________


APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Seventh Semester B.Tech Degree (S, FE) Examination May 2023 (2019 Scheme)

Course Code: ECT463


Course Name: MACHINE LEARNING
Max. Marks: 100 Duration: 3 Hours

PART A
Answer all questions, each carries 3 marks. Marks

1 Define conditional probability. (3)


2 State the concept of traditional programming and machine learning approach. (3)
3 What do you mean by bias? (3)
4 Assume that you are provided with a set of data on car price for the last ten years (3)
based on the feature ‘year of usage’ and ‘distance’. You have to predict the price
of the car after 15 years with distance 50000km. Discuss about the type of machine
learning problem to which it belongs.
5 With suitable equations and diagram, explain about any two types of activation (3)
functions used in neural network.
6 Explain multi-class support vector machines. (3)
7 Discuss proximity measures in clustering. (3)
8 Write short note on Gini index. (3)
9 Define False positive and True negative. (3)
10 Explain about the significance of dimensionality reduction. (3)
PART B
Answer any one full question from each module, each carries 14 marks.
Module I
11 a) Explain about overfitting and underfitting with necessary diagrams. (8)
b) List different types of machine learning. Also explain about the concept of machine (6)
learning technique employed in recommender system.
OR
12 a) Explain in detail about supervised learning with four examples. (8)
b) Define the terms feature, training set, test set, target vector. (6)

Page 1of 2
1000ECT463122203

Module II
13 a) Differentiate regression and classification with examples. (8)
b) Illustrate different types of regression models. (6)
OR
14 a) State Bayes’ decision theory. (5)
b) Show that the Bayesian classifier is optimal with respect to minimizing the (9)
classification error probability.
Module III
15 a) Explain about gradient descent method in machine learning. (5)
b) State the mathematical formulation of the SVM problem. Give an outline of (9)
the method for solving the problem.
OR
16 a) Define perceptron. Explain about perceptron algorithm in detail. (8)
b) With necessary diagrams compare linearly separable data and non-linearly (6)
separable data.
Module IV
17 a) Illustrate K means clustering algorithm with an example. (10)
b) What are the limitations of k means clustering. (4)
OR
18 a) Construct a dendrogram for the given data by applying single linkage hierarchical (8)
clustering using agglomerative method.
a b c d e
a 0 9 3 6 11
b 9 0 7 5 10
c 3 7 0 9 2
d 6 5 9 0 8
e 11 10 2 8 0
b) Explain about bagging in detail with necessary diagrams. (6)
Module V
19 a) Explain about the significance of ROC with neat diagram. (7)
b) Illustrate the concept of confusion matrix. (7)
OR
20 a) Explain about Principal Components Analysis with necessary diagram. (9)
b) Define accuracy and precision. (5)
*****

Page 2of 2

You might also like