SVKM’s NMIMS Deemed-to-be University

Mukesh Patel School of Technology Management and Engineering

Program: B Tech All programs [except CSBS and CSE(DS) 311 Semester: III / IV / VII / VIII
(VT)], MBA Tech Computer,
B Tech Integrated Mechanical and Computer
Course: Probability and Statistics Code: 702BS0C034
Teaching Scheme Evaluation Scheme
Lecture Practical Tutorial Internal Continuous Term End
(Hours (Hours (Hours per Credit Assessment (ICA) Examinations (TEE)
per week) per week) week) (Marks - 50) (Marks- 100)
2 2 0 3 Marks Scaled to 50 Marks Scaled to 50
Pre-requisite: Nil
Course Objective
This course aims to instill in students a sound knowledge of probability theory and statistical
techniques. It equips the students with intermediate to advanced level concepts and tools in
probability and statistics that help them tackle relevant problems within engineering domain.
Course Outcomes
After completion of the course, students will be able to -
1. Solve problems involving random variables, probability distributions and testing of
hypothesis, correlation and regression
2. Identify suitable probability distribution and testing techniques to solve related problems
3. Apply knowledge of random variables, probability distributions, measures of central
tendency, correlation and regression to solve real life problems
4. Analyse data samples using statistical methods
Detailed Syllabus
Unit Description Duration
1 Basic Probability 03
Probability spaces, conditional probability, independence; Bayes theorem.
2 Random variables and Probability Distributions 06
Discrete random variables, probability mass function, cumulative distribution
function, Independent random variables, Continuous random variables,
distribution functions and densities, expectation, variance, raw and central
moments of random variables, Binomial distribution, Poisson approximation
to the binomial distribution, Normal distribution.
3 Bivariate Distributions 02
Definition of Bivariate Distribution and their properties, Conditional densities.
4 Basic Statistics 02
Measures of Central tendency; Moments, Moment generating function,
skewness, kurtosis.
Mean and variance of Binomial distribution & Poisson distribution, Moments,
skewness & kurtosis for Normal distribution.

Signature
(Prepared by Concerned Faculty/HOD) AY 2023-24
 SVKM’s NMIMS Deemed-to-be University
Mukesh Patel School of Technology Management and Engineering

5 Testing of hypothesis 12
Point estimation, Interval estimate and Confidence interval, Criteria for good
estimates, Null and Alternate hypothesis, Test Statistic, Type I and Type II
errors, One-tailed and two-tailed test, Critical region, Large sample statistical
test for mean, Large sample statistical test for proportion, t-test for small
samples, Test for variance- F test, Chi-square test for Goodness of fit and
independence of attributes, Analysis of variance.
6 Linear Statistical Models 05
Scatter diagram, Linear regression and correlation, Least squares method, Rank
correlation, Multiple regression.
Total 30
Text Books
1. Veerarajan T, Probability, Statistics and Random Processes, McGraw hill Education, 4th
Edition, 2017.
2. S. Ross , A First Course in Probability, Pearson Education India, 9th Edition, 2013.
Reference Books
1. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, John Wiley & Sons,
3rd Edition, 2017.
2. Devore, Probability and Statistics for Engineering and Sciences, Cengage Learning, 2nd Indian
Edition, 2009.
3. Irwin Miller, John E. Freund and R. A. Johnson, Probability & Statistics for Enginees, Pearson
Education India, 8th Edition, 2015.
4. S. C. Gupta, V. K. Kapoor, Fundamentals of Mathematical Statistics, Sultan Chand & Sons,
12th Edition, 2014.
5. Murray R. Spiegel, John J. Schiller, R. Alu Srinivasn, Probability and Statistics, McGraw Hill
Education, 4th Edition, 2013.
Laboratory Work
8 to 10 experiments based on the syllabus.

Signature
(Prepared by Concerned Faculty/HOD) AY 2023-24
 SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

Program: B Tech/ MBA Tech Data Science, Semester : III

B Tech AI and DS and B Tech CSE (DS)
Course: Data Wrangling Code : 702DB0C012
Teaching Scheme Evaluation Scheme
Lecture Practical Tutorial Internal Continuous
Term End
Assessment
(Hours per (Hours per (Hours per Credit Examinations (TEE)
(ICA)
week) week) week) (Marks - 100)
(Marks -50)
1 4 0 3 Marks Scaled to 50 Marks Scaled to 50
Pre-requisite: Nil
Course Objective
To understand and analyse the amount of data needed today for business decision, which is increasing
rapidly that is Big Data, most of the time (about 70%) is spent on data gathering, data cleaning and making
these data process worthy for business decision. Hence, it is important for students to understand and have
hands-on training for data cleaning and know the theory of ETL (Extract, Transform, and Load) process. To
give information about fundamental concepts in Data Warehousing like slowly changing dimensions
(SCD), data granularity, data velocity, metadata etc. To learn, clean and operationalize data and datasets
using statistical decision-making tools and basic analytical tools.
Course Outcomes
After completion of the course, the student will be able to -
1. Find data from a variety of sources into the tool environment. Explain the principles of tidy data, data
wrangling and sharing
2. Make use of statistical and basic data analysis tool and fundamental functions for data cleaning and
manipulation. Construct data-sets and further modify and analyse it
3. Tell the basic terms in data warehousing like metadata, SCD, ETL etc.
Detailed Syllabus
Unit Description Duration
1 Introduction to Data Science 01
A Data Scientist’s Toolbox; Types of data questions
2 Lifecycle of a DS problem:- Discovery, Data Preparation, Model Planning, 01
Model Planning, Model Building, Operationalize, Communicate Result
Overview of data processing steps which increases the value of data, Basics of
data analytical tool, Basics of Statistical Analytical tool:- Getting data into
3 04
environment, existing local data and other format, Data wrangling and
Analysis:-object's structure, drawing basic statistical

Signature
(Prepared by Concerned Faculty/HOD)
AY 2023-24
 SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

summary from data using base commands and packages, Primary Data
Analysis:- its summary and structure slices or subsets of your data, creating and
working with vectors, matrices, lists, arrays, data frames, Getting and Cleaning
Data – best practices: Data collection, Data formats Making data tidy, Detection 04
and localisation of errors, missing values, special values, Imputation for fields
where data is missing, join data, functioning with dates, characters, functions,
Distributing data, Scripting for data cleaning
Online transaction processing vs. Online analytical processing, Introduction to
Data Warehousing, Advantages, characteristics, Architecture, Front room &
4 back room; Metadata, its classification:- operational, extraction and 03
Transformational, end user; its role in ETL environment, security mechanism in
DW environment
Data quality tool functions, Data Cleaning, its steps , reasons for dirty data,
Sources of data pollution, Data velocity, cyclicity of data, Data Quality
5 Framework-roles and responsibility, levels of testing a DW:- unit, integration, 02
system and acceptance, performance, Data Granularity

The ETL Process; Major steps, Data Extraction, Transformation, Loading; SCD,
6 operational data store (ODS), basic ODBC topology in ETL 04

Total 15
Text Books
1. Mark van der Loo and Edwin de Jonge, Statistical Data Cleaning with Applications in R, 1st Edition,
Wiley, 2018
2. Reema Thareja, Data Warehousing, 10th edition, Oxford university Press, 2017

Reference Book
1. Joy Mundy, Warren Thornthwaite and Ralph Kimball, The Microsoft Data Warehouse Toolkit, 2nd edition,
Wiley, 2011
Laboratory/ Tutorial Work
8 to 10 programming exercises (and a practicum) based on the syllabus

Signature
(Prepared by Concerned Faculty/HOD)
AY 2023-24
 SVKM’s NMIMS Deemed-to-be University
Mukesh Patel School of Technology Management and Engineering

Program: B Tech/ MBA Tech Data Science Semester: III

B Tech CSE (DS)
Course: Optimization Methods Code: 702BS0C032
Teaching Scheme Evaluation Scheme
Lecture Practical Tutorial Internal Continuous Term End
(Hours per (Hours per (Hours per Credit Assessment (ICA) Examinations (TEE)
week) week) week) (Marks - 50) (Marks- 100)

3 2 0 4 Marks Scaled to 50 Marks Scaled to 50

Pre-requisite: Linear algebra (vectors, matrices, derivatives) and calculus
Course Objective
The aim of the course to provide basic understanding of optimization techniques and its applications.
It focuses on Significance of optimization techniques in data science. It covers numerical techniques of
optimization theory to solve concrete Engineering problems
Course Outcomes
After completion of the course, the student will be able to -
1. Use optimization techniques in Data Analytics and related areas
2. Apply optimization techniques to business problems
3. Develop and implement basic optimization techniques.
Detailed Syllabus
Unit Description Duration
1. Linear Programming 6
Introduction, Maximization, Minimization,
Graphical Method, Simplex Method, Duality, Big M Method,
Two Phase Simplex Method, Primal vs Dual, Shadow Pricing,
Sensitivity Analysis, Karmakar's Method, Software for Linear
Programming Problem
2. Transportation Problem 5
Introduction, Mathematical Model, Balanced and Unbalanced Problem, North
West Corner Rule,
Stepping Stone Method, Vogel Approximation Method, MODI
Method, Optimality Criteria, Software for Transportation Problem
3. Assignment Problem 5
Introduction, Mathematical Model, Cost Minimization Model, Profit Maximization
Model, Hungarian Method, Flood's Method, Optimality Criteria, Traveling
Salesman Problem, Software for Assignment Problem

Signature
(Prepared by Concerned Faculty/HOD)
AY 2023-24
 SVKM’s NMIMS Deemed-to-be University
Mukesh Patel School of Technology Management and Engineering

4. Decision Making Problem 6

Introduction, Conditions of Certainty, Uncertainty and Risk, MaxiMax, MaxiMin,
Minimax, Hurwicz, Laplace Criteria, EMV, EOL and EVPI Calculations,
Incremental and Marginal Analysis Methods, Software for Decision Making
Problem
5. Game Theory 5
Introduction, Payoff Matrix, Decision Making under conditions of Conflict, Saddle
Point, Value of Game, Principle of Dominance, Software for Game Theory Problem
6. Integer Linear Programming and Mix Integer Programming Problems 8
Introduction, Mathematical Formulation, Relaxation, Branch and Bound, Knapsack
Problem, Warehouse Location, Graph Coloring, Cutting Planes, Gomory Cuts,
Polyhedral Cuts, Node Packing, Cover Cuts, Branch and Cut, Seven Bridges,
Traveling Salesman Problem, Software for Integer Linear Programming Problem
7. Goal Programming 5
Introduction, Mathematical Formulation, Solution to Goal Programming Problems,
Software for Goal Programming Problem
8. Simulation Modeling 5
Introduction, Mathematical Formulation, Random Number Generation, Monte
Carlo Method, Applications, Software for Simulation
Total 45
Text Books
1. Bernard W. Taylor III, Introduction to Management Science, 13th Edition, Pearson, 2018
2. J.K. Sharma, Operations Research: Theory and Applications, 6th edition, MacMillan, 2017
Reference Books
1. Prem Kumar Gupta and D S Hira, Operations Research, Revised edition, Sultan Chand Publications,
2017
2. Hamdy D Taha, Operations Research, 8th edition, Prentice Hall, 2017
3. S S Rao, Engineering Optimization, 3rd edition, Prentice Hall, 2017
Laboratory/ Tutorial Work
8 to 10 programming exercises (and a practicum) based on the syllabus

Signature
(Prepared by Concerned Faculty/HOD)
AY 2023-24
 SVKM’s NMIMS Deemed-to-be University
Mukesh Patel School of Technology Management and Engineering

Program: B Tech All Program (except Data Semester: III /IV /V / VII
Science, Civil and Mechanical, CSE(DS) 311 (VT)]
MBA Tech All Program (except Data Science),
B Tech Integrated Computer
Course: Discrete Mathematics Course Code: 702BS0C047
Teaching Scheme Evaluation Scheme
Internal
Lecture Practical Tutorial Term End
Continuous
(Hours (Hours (Hours Credit Examinations (TEE)
Assessment (ICA)
per week) per week) per week) (Marks - 100)
(Marks - 50)
2 0 1 3 Marks Scaled to 50 Marks Scaled to 50
Pre-requisite: Linear Algebra and Ordinary Differential Equations
Course Objective
The principal objective of the course is to train the students in the construction and
understanding of mathematical proofs and common mathematical arguments. It will instil
sound knowledge of different topics of discrete mathematics which students will readily apply
in the subsequent courses of their programme.
Course Outcomes
After completion of the course, students will be able to -
1. Define and relate basic notions of discrete mathematics
2. Demonstrate the ability to understand mathematical logic, concepts in abstract algebra
and mathematical proof techniques
3. Solve problems based on combinatorics, graph theory and abstract algebra
4.Demonstrate understanding of the applications of algebra, combinatorics and graph
theory
Detailed Syllabus
Unit Description Duration
1. Set Theory, Relations and Functions
Revision of prerequisite concepts - ‘Sets, Venn diagrams, Operations
on sets, Laws of set theory’.
Power set, The principle of Inclusion-Exclusion, Partitions of sets.
06
Relations, Properties and types of binary relations, Equivalence
relation.
Functions, injective, surjective and bijective functions, Composition,
inverse of a function.

(Prepared by Corned Faculty/HOD)

AY 2023-24
 SVKM’s NMIMS Deemed-to-be University
Mukesh Patel School of Technology Management and Engineering

2. Logic
Revision of prerequisite concepts – ‘Propositions, Truth table, Laws
of logic, Equivalence’.
06
Satisfiability, tautology, validity, disjunctive and conjunctive normal
forms, Predicates and Quantifiers, Proof Techniques, Mathematical
Induction.
3. Combinatorics
Pigeonhole principle, Homogeneous and non-homogeneous linear 04
recurrence relations with constant coefficients, Generating functions.
4. Graphs and Trees
Graphs and their properties, Degree, Connectivity, Path, Cycle,
Eulerian graph, Hamiltonian graph, Planar graphs, Graph Coloring. 08
Trees, Rooted trees, Spanning tree and minimum spanning tree,
Kruskal’s and Prim’s algorithms for minimal spanning trees.
5. Abstract algebra
Definition and examples of groups, subgroups, cyclic groups, group
06
homomorphism, group isomorphisms.
Definitions and Examples of Rings and Fields.
Total 30
Text Books
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, 8th Edition, Tata McGraw
Hill, 2018.
2. Kolman, Busby and Ross, Discrete Mathematical Structures, 6th Edition, Prentice Hall
India, 2015.
Reference Books
1. C. L. Liu, Elements of Discrete Mathematics, 4th Edition, McGraw Hill, New Delhi, 2017.
2. Seymour Lipschutz and Mark Lipson, Discrete Mathematics, 3rd Edition, McGraw Hill
education, Schaum’s Outline Series, 2017.
3. I. N. Herstein , “Topics in Algebra”, , 2nd Edition, John Wiley and Sons, 1975.
4. Narsingh Deo, Graph theory with Applications to Engineering and computer science, 1st
Edition, Prentice Hall India, 2016.
Laboratory/ Tutorial Work
8 to 10 tutorials based on the syllabus.

(Prepared by Corned Faculty/HOD)

AY 2023-24
 SVKM’s NMIMS University
Mukesh Patel School of Technology Management & Engineering

Program: B Tech CSBS Semester: II

B Tech and MBA Tech (CE, IT, AI, DS) III
B. Tech (Cyber Security, Computer Science, AIML, AIDS, III
EXTC, Mechatronics)
B. Tech Computer Science and Engineering (Data Science) III
B Tech Integrated Computer VII
Course: Data Structures and Algorithms Code: 702CO1C001
Teaching Scheme Evaluation Scheme
Lecture Tutorial
Practical Internal Continuous Term End Examinations
(Hours (Hours
(Hours per Credit Assessment (ICA) (TEE)
per per
week) (Marks - 50) (Marks- 100 )
week) week)
3 2 0 4 Marks Scaled to 50 Marks Scaled to 50
Prerequisite: Programming for Problem Solving
Course Objectives
This course imparts knowledge of data structures and algorithms so as to identify and implement
appropriate data structure and determine the computational complexity of the given application.
Course Outcomes
After successful completion of the course, students will be able to -
1. Understand the concept of data structures and computational complexity
2. Identify and implement appropriate linear data structure for the given problem.
3. Identify and implement appropriate non-linear data structure for the given problem.
4. Differentiate various searching and sorting algorithms.
Detailed Syllabus
Unit Description Duration
1 Introduction 04
Introduction to data structure and its importance, Classification of data structures,
Basic operations., Abstract data type, Performance analysis- time and space
complexity, Asymptotic Notations.
2 Linear Data Structure I 10
Representation of arrays in memory, Operations on arrays -Traversal, Insertion,
Deletion. Introduction to Stacks, Operations on Stacks, Applications of stacks -
Expression conversion and evaluation (Polish notation), Balanced parenthesis
checker, Recursion, Introduction to Queue,
Operation on Queues, Linear queue Circular queue, Priority queue, Application
of Queues.
3 Linear Data Structure II 07

Signature
(Prepared by Concerned Faculty/HOD) AY 2023-24
 SVKM’s NMIMS University
Mukesh Patel School of Technology Management & Engineering

Introduction to linked list, Representation of linked list in memory, Singly linked

list and its operations, Introduction to Doubly Linked list Linked list
representation of Stack and Queues, Applications of linked list – Polynomial
Addition
4 Non-Linear Data Structures - I 10
Introduction, Binary tree terminologies, Representation of Binary trees in
memory, Binary Tree traversal algorithms, Construction of Binary Tree from
traversals, Binary Search Tree: Insertion, Deletion, Applications of tree data
structure: Expression trees, Huffman trees.
5 Non- Linear Data Structures - II 06
Introduction, Graph theory terminology, Representation of graph: Adjacency
Matrix, Adjacency List, Graph Traversal: Breadth first search, Depth first search,
Applications of Graphs (Problem Solving): Shortest path (Dijkstra’s algorithm),
Minimum Spanning Tree.
6 Searching and Sorting 08
Linear Search, Binary Search, Selection Sort, Insertion sort, Merge sort,
Introduction to Hashing
Total 45
Text Books
1. Seymour Lipschutz, “Data structures with C”, Schaum’s Outlines, 1st Edition, 2017.
2. Reema Thareja, “Data Structures using C”, Oxford University Press, 2nd Edition,, 2014.
3. Y. Langsam, M.J. Augenstein, A.M. Tenenbaum, “Data Structures using C and C++”, PHI 2nd
Edition, 2015.
Reference Books
1. Richard F. Gillberg, Behrouz A. Forouzen, “Data Structures – A Pseudo Approach with C”,
Cengage Publication, 2nd Edition 2004. (Classic)
2. Mark Allen Weiss, “Data Structures and Algorithm analysis in C++”, PHI, 4th Edition, 2013.
3. Thomas, H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to
Algorithms”, MIT Press, 3rd Edition 2009.
Laboratory Work
8 to 10 experiments (and a practicum where applicable) based on the syllabus.

Signature
(Prepared by Concerned Faculty/HOD) AY 2023-24