0% found this document useful (0 votes)
5 views16 pages

Machine Learning Course PLan

The document outlines a course plan for MECH2077, a B.Tech course in Electronics and Computer Engineering focusing on Machine Learning, effective from December 2025. It details the course structure, expected outcomes, assessment methods, and syllabus, including topics such as Python programming, supervised and unsupervised machine learning, and artificial neural networks. The plan also includes a monitoring system for course delivery and student performance evaluation criteria.

Uploaded by

Swastik Kapila
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
0% found this document useful (0 votes)
5 views16 pages

Machine Learning Course PLan

The document outlines a course plan for MECH2077, a B.Tech course in Electronics and Computer Engineering focusing on Machine Learning, effective from December 2025. It details the course structure, expected outcomes, assessment methods, and syllabus, including topics such as Python programming, supervised and unsupervised machine learning, and artificial neural networks. The plan also includes a monitoring system for course delivery and student performance evaluation criteria.

Uploaded by

Swastik Kapila
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

COURSE PLAN

UPES/Course Plan/Ver 10/ Effective December 2025


_____________________________________________________________________________________________

Name of School

Name of the Faculty


Dr. Abhinav Sharma

Designation Associate Professor

Cluster Electrical

Program B. Tech. Electronics and Computer Engineering


Machine Learning
Course

Course Code MECH2077

No. of credits 3

Semester IV

Session 2025-26

Academic Year 2025-26

_________________________________
Signature of Cluster Head

Signature of Faculty Member Name: _________________

Name: Dr. Abhinav Sharma Designation: _______________

Designation: Associate Professor Date: _______________________

Date: 24-1-26
COURSE PLAN
Prerequisite Engineering Mathematics
Credit 3
Lecture Tutorial Practical
3 0 0

A. The expected Program Outcome are:

PO1 Engineering knowledge: Apply the knowledge of mathematics, science,


engineering fundamentals, and an engineering specialization to the solution of
complex engineering problems.

PO2 Problem analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.

PO3 Design/development of solutions: Design solutions for complex engineering


problems and design system components or processes that meet the specified
needs with appropriate consideration for public health and safety, and the
cultural, societal, and environmental considerations.

PO4 Conduct investigations of complex problems: Use research-based knowledge


and research methods including design of experiments, analysis and
interpretation of data, and synthesis of the information to provide valid
conclusions.

PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modeling to
complex engineering activities with an understanding of the limitations.

PO6 Engineer and society: Apply reasoning informed by the contextual knowledge
to assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to professional engineering practice.

PO7 Environment and sustainability: Understand the impact of professional


engineering solutions in societal and environmental contexts, and demonstrate
the knowledge of, and need for sustainable development.

PO8 Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of engineering practice.

PO9 Individual and teamwork: Function effectively as an individual, and as a member


or leader in diverse teams, and in multidisciplinary settings.
PO10 Communication: Communicate effectively on complex engineering activities
with the engineering community and with society at large, such as being able to
comprehend and write effective reports and design documentation, making
effective presentations, and give and receive clear instructions.

PO11 Project management and finance: Demonstrate knowledge and understanding of


the engineering and management principles and apply these to one’s own work,
as a member and leader in a team, to manage projects and in multidisciplinary
environments.

PO12 Life-long learning: Recognize the need for and have the preparation and ability
to engage in independent and life-long learning in the broadest context of
technological change.

B. Expected Program specific Outcome are:

PSO1 Analyze, design and validate real time electronic and computer Engineering
systems.

PSO2 Provide technical skills to develop real-time software design for emerging AI
and industrial products.

C. The expected Course Outcomes are:

CO 1 Understand and develop skills in python programming language.


CO 2 Implement supervised machine learning algorithms in python.
CO 3 Implement unsupervised machine learning algorithms in python.
CO 4 Design artificial neural network for complex engineering problems.
D. CO-PO Relationship Matrix
Indicate the relationships by1- Slight (low) 2- Moderate (Medium) 3-Substantial (high)

Program
Outcomes
PO1 PO1
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1
1 2 PSO2
Course
Outcomes
CO 1 3 2 1 3 3 2 - - - - 1 3 - -

CO 2 3 2 1 3 3 2 - - - - 1 3 - -

CO 3 3 2 1 3 3 2 - - - - 2 3 - -

CO 4 3 2 1 3 3 2 - - - - 2 3 - -

Average 3 2 1 3 3 2 - - - - 1 3 - -
E. Course Outcomes assessment plan:

a) Mapping of Course Outcomes with assessment tools

Components
Mid End Any other
Course Assignment Test/Quiz
Semester Semester (Project)
Outcomes

CO 1     
CO 2     
CO3    
CO4    
b) Assessment plan and Analysis
Assessment Tools Planned Actual Highest Lowest
(Score) (Score)
Quiz 1 26-2-26
Quiz 2 24-4-26
--------------------
Assignment 1 25-2-26
Assignment 2 28-4-26
------------------------
Class Test 1 26-2-26

CIA Class Test 2 24-4-26


-----------------
Group Project 1/PBL 18-2-26
1
Group Project 2/PBL 22-4-26
2
------------------
Case Studies 1
Case Studies 2
-----------------
Mid Term
Exam
End Term
Exam
F. Course Syllabus Template

Unit Content
Number
Unit I Fundamentals of Python: Introduction to Python Language, Download & Install
Python, Python Language: Syntax, Keywords, Comments, Variables, Data
Types, Operators, Control Flow – Decision Making, Control Flow – Looping,
Control Flow – Branching, Numbers, Strings, Lists, Tuples, Sets, Dictionaries,
Arrays, user-defined Functions, Built-in Functions, Modules, User Input, File
Handling, Exceptions Handling, Regular Expressions. Python Classes and
Objects, Methods, Constructors, Inheritance, Polymorphism, Abstraction,
Encapsulation. Python for Data Analysis: Numpy, Pandas, Python for
visualization: Matplotlib, Seaborn.
Unit II Introduction to Machine Learning: Introduction to machine learning. Types of
machine learning: unsupervised learning, supervised learning, and reinforcement
learning, Gradient descent algorithm. Aspects of developing a learning system:
training data, concept representation, function approximation.
Unit III Supervised Machine Learning: Regression: Linear regression with one variable,
model representation, ordinary least square algorithm, definition of cost function,
Regularized Linear Regression. Multivariate Regression.
Classification: Logistic regression: classification, hypothesis representation and
decision boundary. Regularized Logistic Regression. Support Vector Machines,
k-Nearest Neighbour algorithm, Decision Trees and Random Forest algorithm.
Naive Bayes Classifier.
Unit IV Unsupervised Machine Learning: Introduction to unsupervised learning.
Random initialization and clustering. K-means clustering algorithm, Hierarchical
Clustering, Density based clustering, Case Studies. Principles of self-
organization, Principal Component Analysis Algorithm. Data Compression and
its reconstruction. Application of Principal Component Analysis.
Unit V Artificial Neural Networks: Introduction to Neural Network, Model of a neuron
and human brain. Network Architecture, Model representation, Perceptron,
Single layer Perceptron and Multi-layer perceptron, Backpropagation Algorithm,
XOR problem, Radial Basis function neural network.
COURSE PLAN DELIVERY

UNIT-I

Session Plan Actual Delivery

Topics CO
Lecture Topics to be Covered Lecture Date
Covered covered
1
1 Fundamentals of Python: Introduction to Python Language, Download & Install Python
2
2 Python Language: Syntax, Keywords, Comments, Variables, Data Types, Operators
3
3 Programming examples
4
4 Control Flow – Decision Making, Control Flow – Looping, Control Flow – Branching
5
5 Programming examples
6
6 Arrays, user-defined Functions, Built-in Functions

7 User Input, File Handling, Exceptions Handling, Regular Expressions 7

8 Programming examples 8

9 Python Classes and Objects, Methods 9

10 Programming examples 10

11 Numbers, Strings, Lists, Tuples, Sets, Dictionaries 11

12 Python for Data Analysis: Numpy, Pandas, Python for visualization: Matplotlib, Seaborn. 12
COURSE PLAN DELIVERY
UNIT-II
Session Plan Actual Delivery

Topics
Lecture Topics to be Covered Lecture Date CO covered
Covered

13 Introduction to Artificial Intelligence 13


14
History of AI, Sub-Areas of AI 14
15
Applications of AI in Engineering 15
16
Introduction to machine learning, Types of ML algorithms with examples 16
17
Present use of ML, DL algorithms and its applications, Types of Data 17
18
Training data, concept representation, function approximation 18
COURSE PLAN DELIVERY
UNIT-III

Session Plan Actual Delivery

Topics CO
Lectur Lectur Dat
Topics to be Covered Covere covere
e e e
d d

Supervised ML algorithms: Linear Regression algorithms, OLS and gradient descent


19 algorithms 19

20 Multiple linear, polynomial and logistic regression algorithms 20

21 Performance parameters of regression and classification algorithms 21

22 Implementation of regression algorithms on Python (Case Studies) 22

23 Classification algorithms: kNN and SVM algorithms 23

24 Decision Trees and Random Forest classification algorithms 24

25 Implementation of classification algorithms on Python (Case Studies) 25

26 Baye’s Theorem and Naïve Bayes classification algorithm 26

27 Lasso and Ridge regression algorithms 27

28 Hyperparameter Tuning of ML algorithms 28


COURSE PLAN DELIVERY
UNIT-IV

Session Plan Actual Delivery

Topics CO
Lectur Lectur Dat
Topics to be Covered Covere covere
e e e
d d

29 Introduction to unsupervised ML algorithms 29

30 Difference between supervised and unsupervised algorithms 30

31 K-means clustering algorithm 31

32 Implementation of k-means clustering algorithm on Python (Case Studies) 32

33 Hierarchical and density-based clustering algorithm 33


Implementation of hierarchical and density-based clustering algorithm on Python (Case
34 Studies) 34

35 Applications of unsupervised algorithms in engineering (Case Studies) 35


COURSE PLAN DELIVERY
UNIT-V

Session Plan Actual Delivery

Topics CO
Lecture Topics to be Covered Lecture Date
Covered covered

36 Introduction to ANN 36

37 Model of a neuron and human brain 37

38 Neural network architecture, Activation function 38

39 McCulloch-Pitts Model of a Neuron 39

40 Learning process: Error correction, memory based, Hebbian and competitive learning 40

41 Perceptron, linearly separable problems solved using perceptron, learning rate, Epoch 41

42 Implementation of neural network in Python 42

43 Multi-layer perceptron neural network, Back Propagation algorithm 43

44 Implementation of MLP neural network in Python (Case Studies) 44

45 Radial Basis Function Neural Network 45


PERIODIC MONITORING
Actual date of completion and remarks, if any

Components From To From To From To


28-2- 4-4- 5-5-
Duration (Mention from and to dates) 15-1-26 3-3-26 7-4-26
26 26 26
Percentage of Syllabus covered 40% 35% 25%
Planned 18 12 15
Lectures
Taken
Planned
Tutorials
Taken
Planned 1 1
Taken
Test/quizzes
CO's Addressed 2 2
CO's Achieved
Planned 1 1
Taken
Assignments
COs Addressed 2 2
COs
Observations (If any):

Signature of Faculty Signature of Head


Date Date
PLANNING FOR REMEDIAL CLASSES

Remedial Classes Held


Date Class test
End
Mid based on
Name of Roll Sap Venue Sem Improvement
Sl. No. Sem Remedial
Student No. ID Marks (Y/N)
Marks Classes
Time

Signature of Faculty Signature of Head


G. Target

Target 50
Level-1 40%
Level-2 50%
Level-3 60%

H. Method of Evaluation*

UG/PG (Indicative)
Quizzes/Tests, Assignments (50%) Offline
Mid Examination (20%) Offline
End examination (30%) Offline
*It can be revised as per the assessment scheme of the respective School/Course & In case
of the courses running under continuous assessment this scheme is not applicable.

I. Passing Criteria

Scale PG UG
Out of 10point scale SGPA – “6.00” in each semester SGPA – “5.0” in each semester
CGPA – “6.00” CGPA – “5.0”
Min. Individual Course Min. Individual Course
Grade – “C” Grade – “C”
Course Grade Point – “4.0” Course Grade Point – “4.0”

Python: The Complete Reference, Martin C. Brow, TMH.


Machine Learning, Saikat Dutt, Subramanian Chandramouli, Amit Kumar Das,
First Edition, Pearson, 2018.
Text
Books Python Machine Learning Cookbook, Practical Solutions from Preprocessing to Deep Learning,
Chris Albon, O’Reilly, 2018.

[Link]
Web [Link]
resources

Introduction to Machine Learning, Ethem Alpaydin, Third Edition, MIT Press, 2014.
Reference Python Machine Learning, Machine Learning and Deep Learning with Python, scikit-learn
books and Tensor flow, Sebastian Raschka, Vahid Mirjalili, Second Edition, Packt, 2015.
MOOCs,
[Link]
Online
courses
*for PG, passing marks are 40/100 in a paper (Composite)
*for UG, passing marks are 35/100 in a paper (Composite)

J. References:
SUGGESTIONS FOR FACULTY

 Faculty should keep track of the students with low attendance and counsel them
regularly.
 The course coordinator will arrange to communicate the short attendance (as per UPES
policy) cases to the students and their parents monthly.
 Topics covered in each class should be recorded in the table of RECORD OF CLASS
TEACHING (Suggested Format).
 Internal assessment marks should be communicated to the students twice in a semester.
 The file will be audited by respective IQAC members for theory as well as for lab as per
schedule.
 The faculty is required to maintain these files for a period of at least three years.
 This register should be handed over to the head of department, whenever the faculty
member goes on long leave or leaves the Colleges/University.
 For labs, continuous evaluation format (break-up given in the guidelines for result
preparation in the same file) should be followed.
 The department should monitor the actual execution of the components of continuous
lab evaluation regularly.
 Instructor should maintain record of experiments conducted by the students in the lab
weekly.
 Instructor should promote students for self-study and to make concept diary, due
weightage in the internal should be given under faculty assessment for the same.
 Course outcome assessment: To assess the fulfilment of course outcomes two different
approaches have been decided. Degree of fulfillment of course outcomes will be
assessed in different ways through direct assessment and indirect assessment. In Direct
Assessment, it is measured through quizzes, tests, assignment, Mid-term and/or End-
term examinations. It is suggested that each examination is designed in such a way that
it can address one or two outcomes (depending upon the course completion). Indirect
assessment is done through the student survey which needs to be designed by the faculty
(sample format is given below) and it shall be conducted towards the end of course
completion. The evaluation of the achievement of the Course Outcomes shall be done
by analyzing the inputs received through Direct and Indirect Assessments and then
corrective actions suggested for further improvement.
 At the completion of the course, course attainment and other documents should be
shared with the program coordinator for computation of Program attainment.
 At the completion of the course Faculty members are suggested to share the innovative
teaching techniques along with the course plan (format provided by IQAC).
 Faculties are encouraged to share the master/expert classes evidence (as per the event
report format)
 Faculties are also encouraged to include MOOCs,,SWAYAM any other online content
and share the evidence of MOOCs courses /online courses referred (as per the event
report format).
 Faculties are encouraged to share the evidence related to interventions or initiatives
focusing the unique/slow and Fast Leaners along with Course Completion files.
INDIRECT ASSESSMENT

Sample format for Indirect Assessment of Course outcomes:

NAME:
ENROLLMENT NO:
SAP ID:
COURSE:
PROGRAM:

Please rate the following aspects of course outcomes of --------------------.

Use the scale 1-3*


Course Statement 1 2 3
Outcomes
CO1
CO2
CO3
CO4
CO5
CO6
CO7

1 Low level of attainment

* 2 Moderate level of attainment

3 High level of attainment

You might also like