TEEGALA KRISHNA REDDY ENGINEERING COLLEGE
(UGC-Autonomous)
(Sponsored by TKR Educational Society, Approved by AICTE, Affiliated to JNTUH
Accredited by NAAC with ‘B++’ Grade. Accredited by NBA
Medbowli, Meerpet, Balapur(M), Hyderabad, Telangana- 500097
Mob: 8498085218. Email: info@[Link], [Link]
Subject Name : MACHINE LEARNING
Subject Code : 22AI501PC
Degree & Branch : [Link] – AIML
Regulation : R22
Year &Sem : III - [Link] & I-Sem
Faculty Name : Dr. P. JYOTHI
PART –A
BLOOMS
[Link] UNIT - I MARKS CO’s LEVELS
1
Define Machine Learning? 1 CO1 Remember
2 Define Artificial Neural Networks? 1 CO1 Understanding
3 What is Supervised Learning? 1 CO1 Understanding
4 Define Perspective? 1 CO1 Analysing
5 What are the Issues in Machine Learning? 1 CO1 Understanding
PART –B
BLOOMS
[Link] UNIT - I MARKS CO’s LEVELS
1 Describe the types of Machine Learning with
10 CO1 Understanding
suitable examples?
Define Concept Learning. Illustrate Concept Learning
2 Search with example
10 CO1 Understanding
Explain S- Algorithm and Candidate Algorithm with
3 suitable example?
10 CO1 Understanding
What is version space? How to find the path
4 with most general consistent specialization. 10 CO1 Analysing
Give one example.
Calculate the Linear Regression for the
following data and draw the graph.
5 10 CO1 Evaluating
X 1 2 3 4 5
Y 3 4 2 4 5
TEEGALA KRISHNA REDDY ENGINEERING COLLEGE
(UGC-Autonomous)
(Sponsored by TKR Educational Society, Approved by AICTE, Affiliated to JNTUH
Accredited by NAAC with ‘B++’ Grade. Accredited by NBA
Medbowli, Meerpet, Balapur(M), Hyderabad, Telangana- 500097
Mob: 8498085218. Email: info@[Link], [Link]
PART-A
BLOOMS
[Link] UNIT - II MARKS CO’s LEVELS
1 What is the Perceptron in Machine Learning?
1 CO2 Understanding
What is Binary Classifier in Machine
2 1 CO2 Knowledge
Learning?
3 Define Classification? 1 CO2 Understanding
4 Illustrate Curse of Dimensionality. 1 CO2 Application
5 What is Support Vector Machine. 1 CO2 Application
PART-B
BLOOMS
MAR
[Link] UNIT - II CO’s LEVELS
KS
Explain Define Multi-Layer Perceptron and Explain
given example using backward [Link]
target output is 0.5, and the learning rate is 1.
1
10 CO2 Evaluating
Illustrate Support Vector Machine problem with
2 Positive values (3,1)(3,-1)(6,1)(6,-1) and Negative 10 CO2 Applying
values (1,0)(0,1)(0,-1,-1,0).
How does Machine Learning differ from Data
3 10 CO2 Analysing
Mining? Explain with examples.
Define Radial Basis Function, with example XoR
4 10 CO2 Analysing
boolean function.
PART-A
TEEGALA KRISHNA REDDY ENGINEERING COLLEGE
(UGC-Autonomous)
(Sponsored by TKR Educational Society, Approved by AICTE, Affiliated to JNTUH
Accredited by NAAC with ‘B++’ Grade. Accredited by NBA
Medbowli, Meerpet, Balapur(M), Hyderabad, Telangana- 500097
Mob: 8498085218. Email: info@[Link], [Link]
BLOOMS
[Link] UNIT - III MARKS CO’s LEVELS
1 1
Explain in detail about mean, median and mode? CO3 Understanding
2 Define Clustering? 1 CO3 Applying
3 What is bagging? 1 CO3 Understanding
4 What is Regression? 1 CO3 Understanding
5 What is Gaussian Mixture Model. 1 CO3 Analysing
PART-B
BLOOMS
[Link] UNIT - III MARKS CO’s LEVELS
What is Decision Tree. Write algorithm steps in
detail with an example
Age Competetion Type Profit
old Yes S/w Down
old No S/w Down
old No H/w Down
mid Yes S/w Down
1 mid Yes H/w Down 10 CO3 Analysing
mid No H/w Up
mid No S/w Up
new Yes S/w Up
new No H/w Up
new No S/w Up
Differentiate between Classification and
2 10 CO3 Analysing
Regression?
Explain in detail about Boosting and Bagging
3 10 CO3 Analysing
with neat diagrams.
TEEGALA KRISHNA REDDY ENGINEERING COLLEGE
(UGC-Autonomous)
(Sponsored by TKR Educational Society, Approved by AICTE, Affiliated to JNTUH
Accredited by NAAC with ‘B++’ Grade. Accredited by NBA
Medbowli, Meerpet, Balapur(M), Hyderabad, Telangana- 500097
Mob: 8498085218. Email: info@[Link], [Link]
What is K-Nearest Neighbor and explain
4 algorithm in detail with example? 10 CO3 Applying
Apply K-Means Clustering to cluster the
following data into 2 groups. Data points are
{2,4,10,12,3,20,30,11,25}, the distance function
5 used is Euclidean distance and the initial cluster 10 CO3 Applying
centriods are M1=4 and M2=11.
PART-A
BLOOMS
[Link] UNIT - IV MARKS CO’s LEVELS
1
What is meant by Dimensionality Reduction? 1 CO4 Understanding
2 Define eigen value and eigen vector? 1 CO4 Applying
3 Give the significance of least square method? 1 CO4 Understanding
How neural networks are represented in
4 1 CO4 Understanding
computer.
5 What are the genetic operators. 1 CO4 Analysing
PART-B
BLOOMS
[Link] UNIT - IV MARKS CO’s LEVELS
1 Explain in detail about Linear Discriminant
10 CO4 Understanding
Analysis.
a) Describe Evolutionary Learning. 3 Understanding
2 b) Why you use PCA? Discuss some CO4
advantages and disadvantages of PCA. 7 Understanding
3 Difference between LDA, PCA and ICA? 10 CO4 Applying
10
4 Discuss briefly about Genetic Algorithms? CO4 Applying
5 What is Least Squares optimization. 10 CO4 Evaluating
Determine the regression equation of Y on X
TEEGALA KRISHNA REDDY ENGINEERING COLLEGE
(UGC-Autonomous)
(Sponsored by TKR Educational Society, Approved by AICTE, Affiliated to JNTUH
Accredited by NAAC with ‘B++’ Grade. Accredited by NBA
Medbowli, Meerpet, Balapur(M), Hyderabad, Telangana- 500097
Mob: 8498085218. Email: info@[Link], [Link]
by the method of Least Square from the
following data.
x 5 8 7 6 4
y 3 4 5 2 1
PART-A
BLOOMS
[Link] UNIT - V MARKS CO’s LEVELS
1
Define reinforcement learning? 1 CO5 Understanding
What is difference between positive and
2 1 CO5 Understanding
negative reinforcement?
3 What is Marcov Decision Process (MDP)? 1 CO5 Understanding
4 What is the Bellman equation? 1 CO5 Analysing
5 Define Hidden Marcov Model (HMM)? 1 CO5 Understanding
PART-B
BLOOMS
[Link] UNIT - V MARKS CO’s LEVELS
a) Define key terms like agent, environment,
state, action, reward, policy, and value function. 5 Understanding
1
CO5
b) Define Graphical model and give some
advantages and disadvantages. 5 Understanding
Explain Monte Carlo methods in reinforcement
2 10 CO5 Understanding
learning.
CO5
3 Explain Gibbs Sampling with suitable example. 10 Analysing
Illustrate the Monte Carlo Policy Evaluation problem is
4 A+3→A+2→B-4→A+4→B-3→terminate 10 CO5 Analysing
B-2→A+3→B-3→terminate.
Analysing
5 Explain Bayesian Networks in detail. 10 CO5
Undersatnding