SREENIDHI INSTITUTE OF SCIENCE & TECHNOLOGY

(An Autonomous Institution approved by UGC and affiliated to JNTUH))

(Accredited by NAAC with ‘A+” Grade, Accredited by NBA of AICTE and
Recipient of World Bank under TEQIP-I and II )
Yamnampet, Ghatkesar Mandal, Hyderabad - 501 301.

COURSE FILE

FOR

MACHINE LEARNING
Professional Elective -II

FOR

[Link] - III year - II Semester

DEPARTMENT OF CYBERSECURITY
DEC 2025
 Syllabus for B. Tech. III Year II semester
DEPARTMENT OF CYBERSECURITY
MACHINE LEARNING
(Professional Elective-II)
L T P/D C
Code: 9LC03 3 0 0 3

Course Objective:

 To introduce students to the basic concepts and techniques of Machine Learning.

 To have a thorough understanding of the Supervised and Unsupervised learning
techniques
 To study the various probabilities based learning techniques
 To understand graphical models of machine learning algorithms

Course Outcomes:

At the end of this course, the student is able to

1. Understand the fundamental concepts of ML and Designing a Learning System.

2. Understand the basic concepts of MLP,RBF and SVM and their applications.
3. Understand the Probability models namely supervised, unsupervised,basic
statistics analyze their analysis of algorithms along with their applications.
4. Understand various Dimensionality Reduction Techniques and Apply various
Evolutionary Algorithms with models.
5. Understand the Graphical models and their applications
6. Understanding Analytical Learning and Analyze KBANN Algorithm

UNIT I: INTRODUCTION:

Learning(Book-1) – Types of Machine Learning – Supervised Learning – The Brain and

the Neuron – Design a Learning System(Book-2) – Perspectives and Issues in Machine
Learning – Concept Learning Task – Concept Learning as Search – Finding a Maximally
Specific Hypothesis – Version Spaces and the Candidate Elimination Algorithm – Linear
Discriminants: (Book-1) – Perceptron – Linear Separability – Linear Regression.

UNIT II: LINEAR MODELS:

Multi-layer Perceptron(Book-1) – Going Forwards – Going Backwards: Back

Propagation Error – Multi-layer Perceptron in Practice – Examples of using the MLP –
Overview – Deriving Back-Propagation – Radial Basis Functions and Splines – Concepts
– RBF Network – Curse of Dimensionality – Interpolations and Basis Functions –
Support Vector Machines
UNIT III: TREE AND PROBABILISTIC MODELS:

Learning with Trees(Book-1) – Decision Trees – Constructing Decision Trees –

Classification and Regression Trees – Ensemble Learning – Boosting – Bagging –
Different ways to Combine Classifiers – Basic Statistics – Gaussian Mixture Models –
Nearest Neighbor Methods – Unsupervised Learning – K means Algorithms

UNIT IV: DIMENSIONALITY REDUCTION AND EVOLUTIONARY MODELS:

Dimensionality Reduction(Book-1) – Linear Discriminant Analysis – Principal

Component Analysis – Factor Analysis – Independent Component Analysis – Locally
Linear Embedding – Isomap – Least Squares Optimization – Evolutionary Learning –
Genetic algorithms – Genetic Offspring: - Genetic Operators – Using Genetic Algorithms
– Reinforcement Learning – Overview – Getting Lost Example

UNIT V: GRAPHICAL MODELS:

Markov Chain Monte Carlo Methods (Book-1) – Sampling – Proposal Distribution –

Markov Chain Monte Carlo – Graphical Models – Bayesian Networks – Markov Random
Fields – Hidden Markov Models – Tracking Methods

UNIT – VI : ANALYTICAL LEARNING

Learning with perfect domain theory (Book-2) – Explanation based Learning – Inductive
analytical approach to learning – KBANN algorithm

TEXT BOOKS:

1. Stephen Marsland, ―Machine Learning – An Algorithmic Perspective‖, Second

Edition, Chapman and Hall/CRC Machine Learning and Pattern Recognition Series,
2014.

2. Tom M Mitchell, ―Machine Learning‖, First Edition, McGraw Hill Education, 2013.

REFERENCES:

1. Peter Flach, ―Machine Learning: The Art and Science of Algorithms that Make
Sense of Data‖, First Edition, Cambridge University Press, 2012.

2. Jason Bell, ―Machine learning – Hands on for Developers and Technical

Professionals‖, First Edition, Wiley, 2014

3. Ethem Alpaydin, ―Introduction to Machine Learning 3e (Adaptive Computation and

Machine Learning Series), Third Edition, MIT Press, 2014
 Machine Learning

Lecture Schedule

Unit – 1(Introduction to Machine Learning)

[Link]. No. of Lectures Name of the Topic
1 1 Introduction to Machine Learning
2 1 Types of Machine Learning- Supervised Learning
3 1 The Brain and the Neuron
4 1 Design a Learning System
5 2 Perspectives and Issues in Machine Learning
6 1 Concept Learning Task
7 1 Concept Learning as Search
8 1 Finding a Maximally Specific Hypothesis
9 1 Version Spaces and the Candidate Elimination Algorithm
10 1 Linear Discriminants- Perceptron
11 1 Linear Separability
12 1 Linear Regression
Unit – 2(LINEAR MODELS)
13 2 Multi-layer Perceptron- Going Forwards – Going Backwards
14 1 Back Propagation Error
15 1 Multi-layer Perceptron in Practice
16 2 Examples of using the MLP – Overview
17 2 Deriving Back-Propagation
18 2 Radial Basis Functions and Splines
19 1 RBF Network
20 1 Curse of Dimensionality
21 1 Interpolations and Basis Functions

22 1 Support Vector Machines

Unit – 3(TREE AND PROBABILISTIC MODELS)

23 2 Decision Trees – Constructing Decision Trees

24 1 Classification and Regression Trees
25 1 Ensemble Learning – Boosting – Bagging
 26 1 Different ways to Combine Classifiers

27 1 Basic Statistics – Gaussian Mixture Models

28 1 Nearest Neighbor Methods

Unsupervised Learning – K means Algorithms
29 1

Unit – 4(DIMENSIONALITY REDUCTION AND EVOLUTIONARY MODELS)

30 1 Dimensionality Reduction
31 1 Linear Discriminant Analysis
32 2 Principal Component Analysis
33 1 Factor Analysis
34 1 Independent Component Analysis
35 1 Locally Linear Embedding – Isomap
36 1 Least Squares Optimization
37 1 Evolutionary Learning
38 1 Genetic algorithms
39 1 Genetic Offspring- Genetic Operators – Using Genetic Alg
40 1 Reinforcement Learning – Overview – Getting Lost Example

Unit – 5(GRAPHICAL MODELS)

41 2 Markov Chain Monte Carlo Methods
42 1 Sampling- Proposal Distribution
43 1 Graphical Models
44 1 Bayesian Networks
45 1 Markov Random Fields
46 2 Hidden Markov Models
47 1 Tracking Methods
Unit – 6(ANALYTICAL LEARNING)
48 1 Learning with perfect domain theory

49 1 Explanation based Learning

50 1 Inductive analytical approach to learning
51 2 KBANN algorithm

Total Periods: 13+14+8+12+9+5 = 60

Question Bank :
1. Define Machine Learning. Explain with examples why machine learning is impor-
tant.
2. Discuss some applications of machine learning with examples.
3. Explain how some disciplines have influenced the machine learning.
4. What is well- posed learning problems.
5. Describe the following problems with respect to Tasks, Performance and Experi-
ence:
a. A Checkers learning problem
b. A Handwritten recognition learning problem
c. A Robot driving learning problem

6. Explain the steps in designing learning systems in detail.

7. Explain different perspective and issues in machine learning.
8. Define concept learning and discuss with example.
9. Explain the General-to-Specific Ordering of Hypotheses
10. What are the key properties and complaints of FIND-S algorithm?
11. Define Consistent Hypothesis and Version Space.
12. Write LIST-THEN-ELIMINATE algorithm.
13. Write the candidate elimination algorithm and illustrate with example
14. Explain in detail the Inductive Bias of Candidate Elimination algorithm

15. What is Artificial Neural Network?

16. Explain appropriate problem for Neural Network Learning with its character-
istics.
17. Explain the concept of a Perceptron with a neat diagram.
18. Explain the single perceptron with its learning algorithm.
19. How a single perceptron can be used to represent the Boolean functions such
as AND,
20. OR
21. Design a two-input perceptron that implements the boolean function A Λ ¬ B.
Design a two-layer network of perceptrons that implements A XOR B.
22. Write a note on (i) Perceptron Training Rule (ii) Gradient Descent and Delta
Rule
23. Write Gradient Descent algorithm for training a linear unit.
24. Derive the Gradient Descent Rule
25. Derive the Back Propagation Rule
26. Explain the followings w.r.t Back Propagation algorithm
a. Convergence and Local Minima
b. Representational Power of Feedforward Networks
c. Hypothesis Space Search and Inductive Bias
d. Hidden Layer Representations
e. Generalization, Overfitting, and Stopping Criterion

27. What is decision tree and decision tree learning?

28. Explain representation of decision tree with example.
29. What are appropriate problems for Decision tree learning?
30. Explain the concepts of Entropy and Information gain.
31. Discuss Hypothesis Space Search in Decision tree Learning.
32. Discuss Inductive Bias in Decision Tree Learning.
33. What are Restriction Biases and Preference Biases and differentiate between them.
34. Write a note on Occam’s razor and minimum description principal.
35. What are issues in learning decision trees

36. Define Bayesian theorem? What is the relevance and features of Bayesian theo-
rem? Explain the practical difficulties of Bayesian theorem.
37. Define is Maximum a Posteriori (MAP) Maximum Likelihood (ML) Hypothesis.
Derive the relation for hMAP and hML using Bayesian theorem.

38. Discuss Maximum Likelihood and Least Square Error Hypothesis

39. Describe Maximum Likelihood Hypothesis for predicting probabilities.
40. What are Bayesian Belief nets? Where are they used?
41. Explain Bayesian belief network and conditional independence with example
42. Explain Gradient Ascent Training of Bayesian Networks
43. Explain the concept of EM Algorithm. Discuss what are Gaussian Mixtures

44. Explain the two key difficulties that arise while estimating the Accuracy of Hypoth-
esis.
45. Define the following terms
a. Sample error b. True error c. Random Variable
b. d. Expected value e. Variance f. standard Deviation
 46. Explain Binomial Distribution with an example.
47. Explain Normal or Gaussian distribution with an example.
48. What are instance based learning? Explain key features and disadvantages of
these methods.
49. Explain the K – nearest neighbour algorithm for approximating a discrete –
valued

a. function with pseudo code

50. Describe K-nearest Neighbor learning Algorithm for continues (real) val-
ued target function.
51. Discuss the major drawbacks of K-nearest Neighbour learning Algorithm and
how it can be corrected
Previous papers:
 H.T No
Regulations:
Sreenidhi Institute of Science and Technology A22
(An Autonomous Institution)
Code No:9LC03 Date:11-July-2025 (AN)
[Link] III-Year II- Semester External Examination, July-2025 (Regular)
MACHINE LEARNING (CSE, IT, CS, AIML and DS)
Time: 3 Hours [Link]
Note: a) No additional answer sheets will be provided.
b) All sub-parts of a question must be answered at one place only, otherwise it will not be valued.
c) Missing data can be assumed suitably.
Bloom's Cognitive Levels of Learning (BCLL)
Remember L1 Apply L3 Evaluate L5
Understand L2 Analyze L4 Create L6
Part - A [Link]: 6x2=12
ANSWER ALL QUESTIONS, EACH QUESTION CARRIES 2 MARKS.
BCLL CO(s) Marks
1 Define linear separability with an example. L1 CO1 [2M]
2 What is Backpropagation error in neural networks? L1 CO2 [2M]
3 Distinguish between classification and regression trees. L4 CO3 [2M]
4 Interpret Dimensionality Reduction. L2 CO3 [2M]
5 What is the role of a proposal distribution in sampling methods? L1 CO4 [2M]
6 Define analytical learning. L1 CO4 [2M]
Part – B [Link]: 6x8=48
ANSWER ALL QUESTIONS. EACH QUESTION CARRIES 8 MARKS.
BCLL CO(s) Marks
7. Explain the different types of machine learning and describe the concept of L5 CO1 [8M]
supervised learning in detail.
OR
8 What is version space? Explain the Candidate Elimination Algorithm with a L1 CO1 [8M]
suitable example.

9. Compare Radial Basis Function Networks with Multi-Layer Perceptron in terms of L4 CO2 [8M]
architecture and learning.
OR
10 Evaluate the working of Support Vector Machines and justify their importance in L5 CO2 [8M]
linear and non-linear classification.

11 Explain the process of constructing a decision tree using any suitable case study. L5 CO2 [8M]
OR
12 Illustrate how Gaussian Mixture Models (GMMs) work with a relevant diagram. L2 CO2 [8M]

13 Illustrate the Isomap technique and discuss how it is used in non-linear L2 CO3 [8M]
dimensionality reduction.
OR
14 Apply genetic algorithms to solve a simple optimization problem and explain the L3 CO3 [8M]
output.
OR
15 Explain the working of Markov Chain Monte Carlo methods with suitable L5 CO4 [8M]
examples.
OR
16 Analyze Bayesian Networks and discuss how they represent probabilistic L5 CO5 [8M]
relationships between variables.