B Tech in Data Science and Engineering

THIRD SEMESTER FOURTH SEMESTER

Year

Sub. Code Subject Name L T P C Sub. Code Subject Name L T P C

Mathematical Foundations for Data Mathematical Foundations for Data

MAT 2139 3 0 0 3 MAT 2239 2 1 0 3
Science-I Science-II

DSE 2121 Data Analytics 3 1 0 4 DSE 2221 Database Systems 2 1 0 3

DSE 2122 Data Structures 3 0 0 3 DSE 2222 Fundamentals of Machine Learning 3 0 0 3

DSE 2123 Object Oriented Programming 3 1 0 4 DSE 2223 Design & Analysis of Algorithms 2 1 0 3

II DSE 2124 Data Communication and Networks 3 0 0 3 DSE 2224 Principles of Data Privacy & Security 3 0 0 3

DSE 2141 Data Analytics Lab 0 0 3 2 DSE 2225 Operating Systems 2 1 0 3

DSE 2142 Data Structures Lab 0 0 3 1 DSE 2241 Database Systems Lab 0 0 3 2

DSE 2143 DSE 2242 Fundamentals of Machine Learning

Object Oriented Programming Lab 0 0 3 1 0 0 3 2
Lab

15 2 9 21 14 4 6 22

Total Contact Hours (L + T + P) Total Contact Hours (L + T + P)

 THIRD SEMESTER
MAT 2139 MATHEMATICAL FOUNDATIONS FOR DATA SCIENCE-I
[3 0 0 3]

Statistics: Measures of central tendency – mean, median, mode, measures of dispersion – mean
deviation, standard deviation, quartile deviation, skewness and kurtosis. Correlation coefficient,
regression, least squares principles of curve fitting. Probability: Introduction, finite sample spaces,
conditional probability and independence, Baye’s theorem, one dimensional random variable,
mean, variance. Two and higher dimensional random variables: mean, variance, correlation
coefficient. Mathematical expectation and conditional expectation.
Distributions: Binomial, Poisson, geometric, uniform, normal, gamma, Chi-square and exponential
distributions, properties and simple problems. Transformation of random variable. Sampling theory:
Central limit theorem and applications. Estimation – methods and goodness of estimators. Testing of
hypothesis-one sample, two sample t-test, one way & two-way analysis of variance. Testing for
independence of attributes and goodness of fit.

References:
1. Gupta, S.C and Kapoor, V.K. Fundamentals of Mathematical Statistics, Sultan Chand &
Sons,11th Edition, 2016
2. Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance
Modeling, William J Stewart(2009) Princeton University Press
3. George Casella and Roger L Berger , Cengage Learning, Statistical Inference (second edition
2021).

DSE 2121 DATA ANALYTICS [3 1 0 4]

Steps in Data Analytics Projects, Data Analytics tasks and methods, Data Gathering and Preparation:
Data Formats, Time series data, Parsing and Transformation, Scalability and Real-time Issues; Data
Cleaning: Consistency Checking, Noisy and Missing Data, Data Integration, Data Transformation, and
Segmentation; Exploratory Analysis: Descriptive and comparative statistics, Hypothesis testing,
Statistical Inference. Data Analysis, Market Basket Analysis, Association rule mining: Apriori, FP
Growth, Partitioning, measures of pattern interestingness, Recommender Systems, Item-based
Recommendation, Collaborative Filtering. Clustering: Partitioning, Hierarchical, Density-based
approaches. Anomaly Detection. Visualization: Visual Representation of Data, Tufts & Gestalt
Principles, Visualization tools. Relevant case studies

SDL: Case Studies in Recommender Systems, Item-based Recommendation, Collaborative Filtering

References:
1. Anil Maheshwari, Data Analytics Made Accessible, McGraw Hill, 2021.
 2. Manaranjan Pradhan, U Dinesh Kumar, “Machine Learning using Python”, Wiley
Publication, 2019.
3. Glenn J. Myatt, “Making Sense of Data: A Practical Guide to Exploratory Data
Analysis and Data Mining”, John Wiley Publication, November 2006.
4. Glenn J. Myatt, Wayne P. Johnson, “Making Sense of Data II”, John Wiley Publication,
2009.
5. Cole Nussbaumer Knaflic, “Storytelling With Data: A Data Visualization Guide for
Business Professionals”, (1e), John Wiley and Sons, 2015.
6. Jiawei Han and Micheline Kamber, “Data Mining Concepts And Techniques”, 3rd
Edition, Morgan Kauffmann
7. Pang-Ning Tan, Michael Steinbach,Vipin Kumar, ”Introduction to Data Mining”,
Pearson Education, 2nd Edition.

DSE 2122 DATA STRUCTURES [ 3 0 0 3]

Introduction - Pointers and Pointer Application, Accessing variables through pointers,

pointers to pointers, pointer arithmetic and arrays, pointers and functions, Recursion-
definition, recursive programs, efficiency of recursion, Stacks, queues, evaluation of
expressions, multiple stacks and queues and its application, Linked lists representations-
Singly, doubly, header node, circular along with the applications, Trees-Binary trees,
representation, recursive/ non recursive inorder, preorder and post order tree traversal, level
order traversal, Binary search tree, creation, insertion deletion operations on binary search tree,
Additional Binary Tree Operations, Threaded Binary Tree and applications and Introduction
to the concepts of Optimal Binary Search Trees, Tree variations, Searching and Sorting
Techniques, Graphs- Storage representations, BFS,DFS, Spanning tree, Minimum spanning
tree.

SDL: Graphs- Storage representations, BFS, DFS, Spanning tree, Minimum spanning tree.

References:
1. Behrouz A. Forouzan, Richard F. Gilberg, A Structured Programming Approach
Using C, (3e), Cengage Learning India Pvt. Ltd, India, 2007
2. Ellis Horowitz, Sartaj Sahni, Susan Anderson and Freed, Fundamentals of Data
Structures in C, (2e), Silicon Press, 2007
3. Richard F. Gilberg, Behrouz A. Forouzan, Data structures, A Pseudocode Approach
with C, (2e), Cengage Learning India Pvt. Ltd, India , 2009
4. Tenenbaum Aaron M., Langsam Yedidyah, Augenstein Moshe J., Data structures
using C, Pearson Prentice Hall of India Ltd., 2007
5. Debasis Samanta, Classic Data Structures, (2e), PHI Learning Pvt. Ltd., India, 2010
DSE 2123 OBJECT-ORIENTED PROGRAMMING [3 0 0 3]

Introduction: Object-oriented Paradigm and Pillars such as Abstraction, Encapsulation,

Inheritance and Polymorphism; Java Basics: Compilation and Execution of a Java Program,
Access Modifiers; Class and Objects: Class Definition, Creating Objects, Role of Constructors,
Method Overloading, Argument Passing, Objects as Parameters, Access Control; I/O Basics:
Reading Console Input, Writing Console Output; Array and Strings: Arrays in Java, 1-D, 2-D
and Dynamic Arrays, String Basics, String Comparison and Manipulation; Inheritance:
Inheritance and its Types, Abstract Class, Inner and Outer Class, Super, Final, Static
Keywords; Package and Interface: In-Built Packages and User Define Packages, Role of
Interface, Polymorphism via Inheritance; Collection Framework & Generics: List, ,Exception
Handling: Errors and Exceptions, Types of Exceptions, Handling Exceptions, Multithreading:
Thread Class, Runnable, Thread Life Cycle, Synchronization, Thread Priority; Event Handling
and GUI Programming: Events, Action Listener, Important Swing Package Classes.
SDL: Event Handling and GUI Programming: Events, Action Listener, Important Swing
Package Classes.

References:
1. Schildt H, Java: The Complete Reference, (10e), Tata McGraw-Hill Education Group,
2017.
2. Balagurusamy E, Programming with Java, (5e), Tata McGraw Hill Education Group,
2017.
3. Daniel Liang Y, Introduction to Java Programming, (10e), Pearson Education India,
2018.
4. Horstmann CS, Big Java: Early Objects, (5e), Wiley’s Interactive Edition, 2015.

DSE 2124 DATA COMMUNICATION AND NETWORKS [3 0 0 3]

Basic concepts of computer networks, Layered architecture and comparison between ISO/OSI,
TCP/IP layered models. Significance of Datalink layer and protocols. Network layer
functionalities, classful, classless IP addressing, address allocation and role of forwarding
module in forwarding the packet using routing table. Roles played by IP, ARP, RARP, ICMP
& IGMP protocols in network layer. Inter-domain and intra-domain routing algorithms for
routing tables. Drawbacks of IPv4 addressing and new IP addressing scheme IPv6. Migrating
from IPv4 to IPv6. Importance of transport layer in achieving process-to-process
communication. Insight of connection-oriented protocol TCP and connectionless protocol
UDP. Features of TCP in achieving flow control, error control and congestion control.
Requirement of different timers in TCP. Introduction to application layer, a client/server
application program and a case study. Client-server application program-Dynamic Host
Configuration Protocol (DHCP)

References:
 1. Behrouz A. Forouzan, Data Communications and Networking, 5th Edition, Tata
McGraw Hill, 2013.
2. Behrouz A. Forouzan, TCP/IP Protocol Suite, 4th Edition, Tata McGraw Hill, 2010.
3. Tannenbaum, A.S, Computer Networks, 5th Edition, Prentice Hall of India EE
Edition, 2011.
4. Leon Garcia and Widjala, Communication Networks, 5th Edition, Tata McGraw Hill,
2017.

DSE 2141 DATA ANALYTICS LAB [0 0 3 2]

Tutorial on tools for Data Analytics & Visualization. Suggested tools are Python, R, MATLAB,
WEKA. Experiments with datasets to be defined in lab manual, to implement concepts of data
pre-processing, exploratory analysis, comparative statistics, statistical inference, Association,
and clustering. Creating Visual Representations- Suggested tools are MS Excel, Power BI,
Tableau. MS Excel Pivot Tables and charts, Case Studies.

References:
1. Manaranjan Pradhan, U Dinesh Kumar, “Machine Learning using Python”, Wiley
Publication, 2019.
2. Brian R. Hunt, Ronald L. Lipsman, Jonathan M. Rosenberg, Kevin R. Coombes, John E.
Osborn, Garrett J. Stuck, Guide to MATLAB: For Beginners and Experienced Users,(2e),
Cambridge University Press, 2011.

DSE 2142 DATA STRUCTURES LAB [0 0 3 1]

Reviewing the concepts of pointers, structures and recursion, Studying the operation of stacks
and queues and the associated application programs, Creating dynamic allocation of memory
for linked list and applying it to examples using singly, doubly and circular linked list and
their applications, Creation of binary trees and the application associated with the trees.

References:
1. Behrouz A. Forouzan, Richard F. Gilberg, A Structured Programming Approach Using
C, (3e), Cengage Learning India Pvt. Ltd, India, 2007
2. Ellis Horowitz, Sartaj Sahni, Susan Anderson and Freed, Fundamentals of Data
Structures in C, (2e), Silicon Press, 2007
3. Richard F. Gilberg, Behrouz A. Forouzan, Data structures, A Pseudocode Approach
with C, (2e), Cengage Learning India Pvt. Ltd, India, 2009
4. Tenenbaum Aaron M., Langsam Yedidyah, Augenstein Moshe J., Data structures
using C, Pearson Prentice Hall of India Ltd., 2007
5. Debasis Samanta, Classic Data Structures, (2e), PHI Learning Pvt. Ltd., India, 2010
DSE 2143 OBJECT-ORIENTED PROGRAMMING LAB [0 0 3 1]
Class and Objects: Class Definition, Creating Objects; Array and Strings: Programs Based
Upon 1-D, 2-D and Dynamic Arrays, String Comparison and Manipulation; Inheritance:
Inheritance and Its Types, Abstract Class, Inner and Outer Class, Super, Final, Static
Keywords; Collection Framework & Generics: Using Collection Classes such as Array Lists
and Linked Lists Writing Generic Classes; Exception Handling: Errors and Exceptions, Types
of Exceptions; Multithreading: Thread Class, Runnable, Synchronization, Thread Priority;
Event Handling and GUI Programming: Action Listener, Swing Package.
References:
1. Schildt H, Java: The Complete Reference, (10e), Tata McGraw-Hill Education Group,
2017.
2. Balagurusamy E, Programming with Java, (5e), Tata McGraw Hill Education Group,
2017.
3. Daniel Liang Y, Introduction to Java Programming, (10e), Pearson Education India,
2018.
4. Horstmann CS, Big Java: Early Objects, (5e), Wiley’s Interactive Edition, 2015.
 FOURTH SEMESTER

MAT 2239 MATHEMATICAL FOUNDATIONS FOR DATA

SCIENCE-II [2 1 0 3]

Stochastic Processes – types, fundamental concepts, limiting and transient behaviour. Poisson
process – properties. Birth-death models, Queueing models-performance measures.
Multivariate analysis-normal distribution and its transformed (Wishart)-properties & their uses
in testing hypothesis, classification methods and multidimensional scaling. Graphical
representation of multivariate data (Self Directed Learning).
References:
1. William J Stewart, Probability, Markov Chains, Queues, and Simulation: The
Mathematical Basis of Performance Modeling, Princeton University Press, 2009
2. Hardle, W.K & Simar, L, Applied Multivariate Statistical Analysis, 2014.
3. Dean W. Wichern and Richard A. Johnson, Applied Multivariate Statistical Analysis,
Pearson, 2017.

DSE 2221 DATABASE SYSTEMS [2 1 0 3]

Database System Applications, View of data, Database languages, Database users and
Administrator, Introduction to Relational Model: database schema, keys, schema diagrams,
Relational Query Languages, Introduction to SQL: Data Definition, Basic structure of SQL
queries, Basic operations, Set operations, Nested subqueries, Modification of the database.
Intermediate SQL: Join expressions, Views, Advanced SQL-PL/SQL, Cursors, Functions,
Procedures, Triggers, recursive queries, Entity-Relationship Model: Design Process, ER
Model, Reduction to Relational schema, Relational Database design: Functional dependencies,
Normal forms, Closure, Canonical cover, Lossless joins, dependency preserving
decomposition, File structure, Transactions, Concurrency Control, Unstructured database
SDL: Unstructured database
References:
1. Abraham Silberschatz, Henry Korth, S. Sudarshan, Database System Concepts, 7th
Edition, McGraw Hill, 2019.
2. Ramez Elmasri, Shamkant Navathe, Fundamentals of Database System, 6th Edition,
Addison Wesley Publications Co., 2010
3. Raghu Ramakrishnan, Johannes Gehrke, Database Management System, 3rd Edition,
WCB/McGraw Hill Publisher, 2007
4. Shashank Tiwari, Professional NOSQL, Wiley, 2015.
5. Ivan Bayross, SQL, PL/SQL-The Programming Language of ORACLE, 4th Edition,
BPB Publications, 2010.
 6. Benjamin Rosenzweig, Elen Silvestrova, “Oracle Pl/Sql By Example”,4th Edition,
Addion-Wesley,2009.

DSE 2222 FUNDAMENTALS OF MACHINE LEARNING [3 0 0 3]

Machine Learning Basics: Types of Machine Learning, Supervised vs. Unsupervised Learning,
Parametric vs. non-parametric models., Instance Based learning – k-nearest neighbors, Simple
Regression Models: Linear, Logistic, Cost functions, Gradient Descent, Batch Gradient
Descent, Overfitting, Model Selection, No free lunch theorem, bias/variance trade-off, union
and Chernoff bounds, VC dimensions. Bayesian Models: Bayesian concept learning, Bayesian
Decision Theory, Naïve Bayesian, Laplacian Correction, Bayesian Belief Networks. Tree
Models: information theory, decision tree induction, tuning tree size, ID3,C4.5, CHAID,
Decision Stump. Support Vector Machines: kernel functions, Regression Models: Ridge and
Lasso Regression, GLM and theexponential Family. Bagging algorithm, Random Forests, Grid
search and randomized grid search, Partial dependence plots. Ensembling and Boosting
Algorithms: Concept of weak learners, Adaptive Boosting, Extreme Gradient Boosting
(XGBoost). Artificial Neural Networks: Perceptron, Back propagation, Hopfield Network.
Curse of Dimensionality: Factor Analysis, Principal Component Analysis (PCA), Difference
between PCAs and Latent Factors

References:
1. K. Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012.
2. G. James, D. Witten, T Hastie, R Tibshirani, An introduction to statistical
learning withapplications in R, Springer, 2013.
3. J. Han, M. Kamber, J. Pei, Data Mining concepts and techniques, (2e), Morgan
Kaufmann-Elsevier, 2011.
4. T. Hastie, R. Tibshirani, J. Friedman, The Elements of Statistical Learning, (2e), Springer,
2009.
5. T. M. Mitchell, Machine Learning, (Indian Edition), MacGraw Hill, 2017.
6. C. Bishop, Neural Networks for Pattern Recognition, Oxford University Press, 2019

DSE 2223 DESIGN & ANALYSIS OF ALGORITHMS [2 1 0 3]

Fundamentals of Algorithms, Important Problem Types, Analysis of algorithm efficiency.

Analysis Framework: Asymptotic Notations and Basic Efficiency Classes, Mathematical
Analysis of Non recursive and Recursive Algorithms. Brute force Techniques, Divide and
Conquer, Decrease and Conquer: Insertion Sort, Depth First Search, Breadth First Search,
Topological Sorting. Transform and Conquer: Pre-sorting, BST, Heapsort. Space and Time
trade-offs: Input Enhancement in String Matching. Dynamic Programming: Warshall's and
Floyd's Algorithms, The Knapsack Problem. Greedy Techniques: Prim's, Kruskal's and
Dijkstra's Algorithm, Huffman Trees. Coping with limitations of algorithmic power, P, NP,
and NP-complete Problems, Backtracking: n–Queens problem, Hamiltonian Circuit Problem,
Subset–Sum Problem. Branch and Bound: Assignment Problem, Knapsack Problem, TSP.

SDL: Branch and Bound: Assignment Problem, Knapsack Problem, TSP.

References:
1. Anany Levitin, Introduction to the Design and Analysis of Algorithms, (3e), Pearson
Education, 2011
2. Ellis Horowitz and Sartaj Sahni, Computer Algorithms/C++, (2e), University Press,
2008.
3. Thomas H. Cormen, Charles E. Leiserson, Ronal L, Rivest, Clifford Stein,
Introduction to Algorithms, (3e), PHI, 2009

DSE 2224 PRINCIPLES OF DATA PRIVACY AND

SECURITY [3 0 0 3]
Security: The OSI Security Architecture, Security Attacks, Services and Mechanisms, Model
for Network Security, Classical Encryption techniques, Symmetric Encryption, Public-key
cryptography and Message Authentication, Hash Functions, Digital Signatures, System
Security, Key Distribution and Authentication, Transport Layer Security, Wireless Network
Security, E-mail Security, IP Security, Security Management Systems, Need for IT Security,
Intrusion Prevention and Detection Systems, Cyber Security. Data Privacy, types of privacy
attacks, Data linking and profiling, access control models, role based access control, privacy
policies, their specifications, privacy policy languages, privacy in different domains-medical,
financial, etc. Mathematical model for comparing real-world data sharing practices, computing
privacy and risk measurements. Demographics and Uniqueness. Protection Models-Null-map,
k-map, Wrong map. Survey of Techniques-Protection models (null-map, k-map, wrong map),
Disclosure control, Inferring entity identities, entry specific databases. Computation systems
for protecting delimited Data-Min Gen, Datafly, Mu-Argus, k-Similar.

SDL: System Security, Key Distribution and Authentication, Transport Layer Security,
Wireless Network Security, E-mail Security, IP Security, Security Management Systems,
Need for IT Security, Intrusion Prevention and Detection Systems, Cyber Security

References:

1. Ronald Leenes , Rosamunde van Brakel , Serge Gutwirth , De Hert, Paul, Data Protection and
Privacy: The Age of Intelligent Machines (Computers, Privacy and Data Protection), Hart
Publishing (December 28, 2017)
2. B. Raghunathan, The Complete Book of Data Anonymization: From Planning to
Implementation, Auerbach Pub, 2016.
3. L. Sweeney, Computational Disclosure Control: A Primer on Data Privacy Protection, MIT
Computer Science, 2017
 4. William Stallings, Cryptography and Network Security: Principles and Practice, 7th Edition,
Pearson Education, 2017.
5. William Stallings, Network Security Essentials: Applications and Standards, 6th Edition,
Pearson Education, 2014.
6. Atul Kahate, Cryptography and Network Security, 3rd Edition, Tata McGraw-Hill Publishing
Company Limited, 2013.

DSE 2225 OPERATING SYSTEMS [3 0 0 3]

Operating System Structure and Operations, Process Management, Memory Management,

Storage Management, Operating System Services, User Operating System Interfaces, Types of
System Calls, System Programs, Operating System Structure, System Boot ,Overview, Process
Scheduling, Operations on Processes, Inter-process Communication, Multithreaded Models,
Thread Libraries, Scheduling Algorithms, Thread Scheduling, Linux scheduling, Critical
Section Problem, Peterson’s Solution, Synchronization Hardware, Semaphores, System
Model, Deadlock: Deadlock prevention, Avoidance, Detection, Recovery, Logical Versus
Physical Address Space, Segmentation, Contiguous Memory Allocation, Paging, Structure of
Page Table, Demand Paging, Copy-On-Write, Page Replacement, Allocation of Frames,
Thrashing, Disk Scheduling, Swap-Space Management, , File Concept, Protection.

SDL: The Linux System: Design Principles, Kernel Modules, Scheduling, Memory
Management.

References:

1. Abraham Silberschatz, Peter B. Galvin, Greg Gagne, Operating System Concepts,

Wiley (2018).
2. Ramez Elmasri, A.Gil Carrick, David Levine, Operating Systems, A Spiral Approach-
McGrawHill Higher Education (2010).
3. Remzi H. Arpaci-Dusseau, Andrea C. Arpaci-Dusseau, Operating Systems, Three Easy
Pieces, Arpaci-Dusseau Books, Inc (2015).
4. Andrew S. Tanenbaum, Modern Operating Systems, Pearson, 4th Edition (2016).
5. William Stallings, Operating Systems: Internals and Design Principles, Pearson, 9th
Edition (2018).

DSE 2241 DATABASE SYSTEMS LAB [0 0 3 2]

Introduction to basics of front-end developing tools needed for developing mini project.
Introduction to SQL, Integrity Constraints in SQL, Simple and complex queries, PL/SQL
Basics, Exception Handling, Cursors, exceptions, Procedures, Functions and Packages,
Triggers. Design and development of database driven mini project based on database concepts
discussed in the theory. The front-end tool is as per the prerogative of the faculty who is
handling the lab.

References:
1. Silberschatz, Korth, Sudarshan, Database System Concepts, (6e), McGraw-Hill, 2011
2. Ivan Bayross, SQL, PL/SQL: The Programming Language of Oracle ,4th Revised
Edition, BPB Publications,2010
3. Steven Feuerstein, Bill Pribyl, Oracle PL/SQL Programming, 6th Edition, O'Reilly
Media, 2014,

DSE 2242 FUNDAMENTALS OF MACHINE LEARNING

LAB [0 0 3 2]

Tutorial on tools for Machine Learning. Python suggested. Experiments with datasets to be
defined in lab manual to perform preprocessing and deploy classifiers such as Bayesian,
Decision Trees, Support Vector Machines, k-nearest neighbor, Regression Models.
Classification accuracy measures, improving classifier performance through ensembling,
boosting etc.

References:
1. Hans Peter Langtangen, Python Scripting for Computational Science, (3e),
Springer Publishers, 2014
2. Naomi R. Ceder, The Quick Python Book, (2e), Manning Publications Co., 2010
3. Wesley J. Chun, Core Python Applications Programming, (3e), Prentice Hall
Publishers, 2012
4. G. James, D. Witten, T Hastie, R Tibshirani, An introduction to statistical
learning with applications in R, Springer, 2013.