Dr.

Babasaheb Ambedkar Technological University (Established a University of

Technology in the State of Maharashtra)
(Under Maharashtra Act No. XXIX of 2014)
P.O. Lonere, Dist. Raigad, Pin 402 103,
Maharashtra Telephone and Fax. 02140 - 275142 www.dbatu.ac.in
www.dbatu.ac.in

CURRICULUM UNDER GRADUATE PROGRAMME FOR

B. TECH
Computer Science and Design
WITH EFFECT FROM THE ACADEMIC YEAR
S.Y. B.Tech 2022-23
T.Y. B.Tech 2023-24
 Proposed Scheme for B. Tech. Computer Science and Design
Semester - VI (Third Year)

Sr. Course Course Code Course Title Weekly Evaluation Scheme Credit
No Category Teaching
Hrs.
L T P CA MSE ESE Total
1 BTCSD 601 Software 3 1 -- 20 20 60 100 4
Engineering &
Testing
2 BTCSD 602 Data Visualization 3 1 -- 20 20 60 100 4

3 BTCSD 603 Machine Learning 3 1 -- 20 20 60 100 4

4 BTCSD Elective-IV 3 -- -- 20 20 60 100 3

604 (a) Internet of Things
604 (b) Augmented &
Virtual Reality
604 (c) Soft Computing
5 BTCSD Elective-V 3 -- -- 20 20 60 100 3
605 (a) Development
605 (b) Engineering
Employability and
605 (c) Skill Development
Consumer
Behaviour
6 BTCSDL606 Machine Learning 1* -- 2 30 -- 20 50 2
Lab and R
Programming Lab
7 BTCSDM607 Mini Project-II -- -- 4 60 -- 40 100 2
8 BTCSDF608 Field Training / -- -- -- -- -- -- -- Audit to be
Internship/ Evaluated
Industrial in VII Sem.
Training-III
Total 16 3 6 190 100 360 650 22

Note: * Lecture should be conducted only for R Programming

 BTCSD 603 Machine Learning

Course Objectives:
1. To understand fundamental concepts of machine learning and its various algorithms.
2. To understand various strategies of generating models from data and evaluating them.
3. To apply ML algorithms on given data and interpret the results obtained.
4. To design appropriate ML solution to solve real world problems in AI domain.

Course Outcomes:
1. Develop a good understanding of fundamental principles of machine learning.
2. Formulation of a Machine Learning problem.
3. Develop a model using supervised/unsupervised machine learning algorithms for
classification/prediction/clustering.
4. Evaluate performance of various machine learning algorithms on various data sets of a
domain.
5. Design and Concrete implementations of various machine learning algorithms to solve
a given problem using languages such as Python.

UNIT I: Introduction to Machine Learning [7 Hours]

Introduction to Machine Learning: Definition of Machine Learning, Definition of
learning. Classification of Machine Learning: Supervised learning, unsupervised
learning, Reinforcement learning, Semi-supervised learning. Categorizing based on
required Output: Classification, Regression, and Clustering. Difference in ML and
Traditional Programming, Definition of Data, Information and Knowledge. Split data
in Machine Learning: Training Data, Validation Data and Testing Data. Machine
Learning: Applications.

UNIT II: Machine Learning - Performance Metrics [7 Hours]

Performance Metrics for Classification Problems- Confusion Matrix, Classification
Accuracy, Classification Report- Precision, Recall or Sensitivity, Support, F1 Score,
AUC (Area Under ROC curve). Performance Metrics for Regression Problems- Mean
Absolute Error (MAE), Mean Square Error (MSE), R Squared (R2).

UNIT III: Linear and Logistic Regression [7 Hours]

Introduction to linear regression: Introduction to Linear Regression, Optimal
Coefficients, Cost function, Coefficient of Determination, Analysis of Linear
Regression using dummy Data, Linear Regression Intuition. Multivariable regression
and gradient descent: Generic Gradient Descent, Learning Rate, Complexity Analysis
of Normal Equation Linear Regression, how to find More Complex Boundaries,
Variations of Gradient Descent. Logistic regression: Handling Classification Problems,
Logistic Regression, Cost Function, Finding Optimal Values, Solving Derivatives,
Multiclass Logistic Regression, Finding Complex Boundaries and Regularization,
Using Logistic Regression from Sklearn.

UNIT IV: Decision Trees and Random Forests [7 Hours]

Decision trees: Decision Trees, Decision Trees for Interview call, Building Decision
Trees, Getting to Best Decision Tree, Deciding Feature to Split on, Continuous Valued
Features Code using Sklearn decision tree, information gain, Gain Ratio, Gini Index,
 Decision Trees & Overfitting, Pruning. Random forests: Introduction to Random
Forests, Data Bagging and Feature Selection, Extra Trees, Regression using decision
Trees and Random Forest, Random Forest in Sklearn.

UNIT V: Naive Bayes, KNN and SVM [7 Hours]

Naive Bayes: Bayes Theorem, Independence Assumption in Naive Bayes, Probability
estimation for Discrete Values Features, how to handle zero probabilities,
Implementation of Naive Bayes, Finding the probability for continuous valued features,
Text Classification using Naive Bayes. K-Nearest Neighbours: Introduction to KNN,
Feature scaling before KNN, KNN in Sklearn, Cross Validation, Finding Optimal K,
Implement KNN, Curse of Dimensionality, Handling Categorical Data, Pros & Cons
of KNN. Support Vector Machine: Intuition behind SVM, SVM Cost Function,
Decision Boundary & the C parameter, using SVM from Sklearn, Finding Non-Linear
Decision Boundary, Choosing Landmark Points, Similarity Functions, how to move to
new dimensions, Multi-class Classification, Using Sklearn SVM on Iris, Choosing
Parameters using Grid Search, Using Support Vectors to Regression.

Textbooks:
1. Ethem Alpaydın, Introduction to Machine Learning, PHI, Third Edition, ISBN No. 978-
81-203- 5078-6
2. Christopher M. Bishop, Pattern Recognition and Machine Learning, Mcgraw-Hill,
ISBN No. 0- 07- 115467-1
3. Tom Mitchell, Machine Learning, Mcgraw-Hill, First Edition, ISBN No. 0-07-115467-
1. 4.Giuseppe Bonaccorso, “Machine Learning Algorithms”, Packt Publishing Limited,
ISBN10: 1785889621, ISBN-13: 978-1785889622

Reference Books:
1. R.O. Duda, P.E. Hart, D.G. Stork, Pattern Classification, 2/e, Wiley, 2001
2. Shai Shalev-Shwartz and Shai Ben-David, Understanding Machine Learning (From
Theory to Algorithms), Cambridge University Press, First Edition, ISBN No. 978-1-
107-51282-5.
3. A. Rostamizadeh, A. Talwalkar, M. Mohri, Foundations of Machine Learning, MIT
Press.
4. A. Webb, Statistical Pattern Recognition, 3/e, Wiley, 2011.
5. https://python-course.eu/machine-learning/
 BTCSDL 606 Machine Learning Lab

List of practicals:
1. Python Libraries for Data Science
a. Pandas Library
b. Numpy Library
c. Scikit Learn Library
d. Matplotlib
2. Evaluation Metrics
a. Accuracy
b. Precision
c. Recall
d. F1-Score
3. Train and Test Sets by Splitting Learn and Test Data.
4. Linear Regression
5. Multivariable Regression
6. Decision Tree Algorithm implementation.
7. Random Forest Algorithm implementation.
8. Naive Bayes Classification Algorithm implementation.
9. K-Nearest Neighbour Algorithm implementation.
10. SVM Algorithm implementation.

BTCSDL 606 R Programming Lab

List of Practical’s:
1. Study of data analysis using MS-Excel (Prerequisite).
2. Study of basic Syntaxes in R.
3. Implementation of vector data objects operations.
3. Implementation of matrix, array and factors and perform va in R.
4. Implementation and use of data frames in R.
5. Create Sample (Dummy) Data in R and perform data manipulation with R.
6. Study and implementation of various control structures in R.
7. Data Manipulation with dplyr package.
8. Data Manipulation with data.table package.
9. Study and implementation of Data Visualization with ggplot2.
10. Study and implementation data transpose operations in R.