Department of Mathematics & Computing, IIT (ISM) Dhanbad

Course Structure for 2 Year M.Tech. (Data Analytics) (W.E.F.: Academic Year 2019-2020)

Semester I

Course No. Course Name L T P C

MCC531 Advanced Data Structures & Algorithms 3 0 0 9
MCC532 Fundamentals of Machine Learning 3 0 0 9
MCC533 Computer Oriented Numerical Methods 3 0 0 9
MCC534 Statistics in Decision Makings 3 0 0 9
MCC535 Soft Computing Techniques 3 0 0 9
MCC536 Advanced Data Structures & Algorithms-
Practical 0 0 2 2
MCC537 Fundamentals of Machine Learning-Practical 0 0 2 2
MCC538 Computer Oriented Numerical Methods-Practical 0 0 2 2
Total 15 0 6 51

Semester II

Course No. Course Name L T P C

MCC539 Advanced DBMS 3 0 0 9
MCC540 Neural Networks and Deep Learning 3 0 0 9
MCD5## D Elective 1 3 0 0 9
XXXXXXX Open Elective 1 3 0 0 9
XXXXXXX Open Elective 2 3 0 0 9
MCC541 Advanced DBMS-Practical 0 0 2 2
MCC542 Neural Networks and Deep Learning-Practical 0 0 2 2
Total 15 0 4 49

Semester III

Course No. Course Name L T P C

MCC597 Thesis Unit 1 0 0 0 36
Total 0 0 0 36

Semester IV

Course No. Course Name L T P C

XXXXXX Open Elective 3 3 0 0 9
MCD5## D Elective 2 3 0 0 9
MCC598 Thesis Unit -2 0 0 0 18
Total 6 0 0 36
Course No. D Elective 1 L T P C
MCD531 Cryptography 3 0 0 9
MCD532 Data Mining 3 0 0 9
MCD533 Numerical Optimization 3 0 0 9
MCD534 Sports Analytics 3 0 0 9
MCD535 Bioinformatics 3 0 0 9
MCD536 Advanced Algorithms for Graphs 3 0 0 9
MCD537 Design of Experiments 3 0 0 9
D Elective 2
MCD538 Time Series Analysis 3 0 0 9
MCD539 Big data 3 0 0 9
MCD540 Biostatistics 3 0 0 9
MCD541 GPU Computing 3 0 0 9
MCD542 Video Analytics 3 0 0 9
MCD543 Missing Data Analysis in Survey Sampling 3 0 0 9
MCD544 Software Testing 3 0 0 9

Course
No. Open Elective ** L T P C
MCO531 Stochastic Processes 3 0 0 9
MCO532 Advanced Multivariate Analysis 3 0 0 9
MCO533 Numerical Linear Algebra 3 0 0 9
 Course Format: MCC531

Course
Course Code Name of Course L T P Credit
Type
DC MCC531 Advanced Data Structures and Algorithms 3 0 0 9

Course Objective
To provide the practical implementation of algorithms using efficient data structures.
Learning Outcomes
To expose students the various methods of designing techniques.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Review of Basic Concepts, Asymptotic 4 Understanding of asymptotic notations and
1 Analysis of Recurrences basic mathematical preliminaries used in
analyzing algorithms.
Randomized Algorithms. Randomized 6 This unit will help the students in
Quicksort, Analysis of Hashing understanding the randomized algorithms
2 algorithms. Algorithm Analysis and amortized analysis of running time.
Techniques - Amortized Analysis.
Application to Splay Trees
External Memory ADT - B-Trees. 10 This will help in understanding the concepts
Priority Queues and Their Extensions: and use of B-trees and various heaps. This
Binomial heaps, Fibonacci heaps, will help in understanding the concepts and
3
applications to Shortest Path Algorithms. use of B-trees and various heaps.
Partition ADT: Weighted union, path Understanding of union and path data
compression, Applications to MST structures and their applications to MST.
Algorithm Analysis and Design 10 To understand different algorithm designing
Techniques. Dynamic Programming- techniques. This will help students in
Bellman-Ford, Greedy Algorithms. knowing the concepts of network flows and
4
Network Flows-Max flow, min-cut their use in designing various graph
theorem, Ford-Fulkerson, Edmonds- algorithms.
Karp algorithm, Bipartite Matching
NP-Completeness and Reductions, 9 To know the concept of NP-completeness.
Cook’s theorem, Satisfiability. Beyond Help the students in understanding what can
5
NP-completeness, Introduction to be done beyond NP-completeness.
different algorithms paradigms

Text Books:
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to algorithms, PHI, 3rd
Edition, 2010.
Reference Books:
1. M. A. Weiss, Data Structures and Algorithm Analysis , Addison-Wesley, 2nd Edition, 2013
2. A. V. Aho, J. E. Hopcroft, J. D. Ullman, Data Structures and Algorithms, Addison-Wesley,
1st Edition, 1982
3. S. S. Skiena: The Algorithm Design Manual, Springer, 2nd Edition, 2008
4. J. Kleinberg, E. Tardos, Algorithm Design, Addison-Wesley, 1st Edition, 2005
 Course Format: MCC532
Course
Course Code Name of Course L T P Credit
Type
DC MCC532 Fundamentals of Machine Learning 3 0 0 9

Course Objective
All Data Analytics applications are depended on machine learning techniques. This course will provide
the students an exposure about how to use machine learning techniques in Data Analytics.
Learning Outcomes
Students will learn the use of Machine Learning in Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Classification/Regression techniques 8 This unit will help students to understand
1 such as Naive Bayes', decision trees, different classification techniques like:
SVMs Naive Bayes', decision trees, SVMs.
Boosting/Bagging and linear and non- 9 This unit will help students to understand
linear regression, logistic regression, the Application of different regression
2 maximum likelihood estimates, techniques in Machine learning.
regularization, basics of statistical
learning theory
Perceptron rule, multi-layer perceptron, 9 This unit will help students to get the
backpropagation, brief introduction to concept of supervised learning like: ANN
3 deep learning models and their different application in
classification, prediction and other areas of
Machine Learning.
Dimensionality reduction techniques like 6 This unit will help students to get the
PCA, ICA and LDA concept of different dimensionality
4
reduction techniques which will be useful
for Big data analysis.
Unsupervised learning: Clustering, 7 This unit will help students to get the
5 Gaussian mixture models, Some case concept of different unsupervised learning.
studies

Text Books:
1. Andreas C. Müller and Sarah Guido, Introduction to Machine Learning with Python: A Guide
for Data Scientists.
Reference Books:
1. Kevin P. Murphy and Francis Bach, Machine Learning: A Probabilistic Perspective
(Adaptive Computation and Machine Learning series)
2. Shai Shalev-Shwartz and Shai Ben-David, Understanding Machine Learning: From Theory to
Algorithms
 Course Format: MCC533
Course
Course Code Name of Course L T P Credit
Type
DC MCC533 Computer Oriented Numerical Methods 3 0 0 9

Course Objective
Student will get knowledge of advanced Numerical Methods and Programming Language Python.
Learning Outcomes
Student will able to apply Numerical Methods for solving Real World problems. Student will be able to
analyze problems in terms of accuracy and precision

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction to Numerical Python: Basics of 6 To learn the basics of Numerical Python
Python, Array, Elementary programming
concepts, Functions and Modules, libraries
1 like Numpy, Scipy, Matplotlib, IEEE
Floating Point Standard, Precision,
Arithmetic Accuracy and Errors.
Advanced Methods for Interpolation: Central 7 To understand the advanced methods for
Difference Interpolation Formulae, Cubic Interpolation
2 Splines.

Numerical Integration: Adaptive 6 Be able to perform Numerical Integration

3 Integration, Guassian Quadrature, Multiple
Integrals. Solution of Integral Equations.
Numerical Solution of linear and Nonlinear 6 Be able to solve linear and Nonlinear
Equations: Introduction to methods for Equations using numerical methods
solving sparse linear systems, tridiagonal
4 systems, solution of system of nonlinear
equations, iterative methods, complex roots
of nonlinear equations.

(a) Solution of Ordinary Differential 14 To understand methods for solving

Equations (ODEs): Explicit Runge-Kutta Ordinary Differential Equations (ODEs). To
Methods, Adaptive Stepsize Control, Single understand methods for solving Partial
Step Methods for Stiff Initial Value Differential Equations (PDEs).
Problems, Multistep Methods, Extrapolation
5 methods, Shooting Method, Boundary value
problems.
(b) Numerical Solutions of Partial
Differential Equations (PDEs): Solutions of
Elliptic, Parabolic and Hyperbolic PDEs.

Text Books: 1. Programming Python by Mark Lutz, O'Reilly Media, 2016

Reference Books:
1. Numerical Python, by Robert Johansson, Springer Nature (2015)
2. Numerical Methods in Engineering with Python by Jaan Kiusalaas, Cambridge University
Press (2013)
3. Numerical Methods for Engineers and Scientists by Joe D. Hoffman, Steven Frankel, CRC
Press, 2001
4. Applied Numerical Analysis by Curtis F. Gerald and Patrick O. Wheatley, Pearson Education
India, 2004
5. Numerical Analysis by Richard L. Burden, J. Douglas Faires, Cengage Learning, 2015
 Course Format: MCC534
Course
Course Code Name of Course L T P Credit
Type
DC MCC534 Statistics in Decision Makings 3 0 0 9

Course Objective
To equip the students with statistical tools applicable in decision making process.
Learning Outcomes
After completion of this course, students will be equipped with the knowledge of analyzing the data
generated in real life problems with the help of important statistical tools and techniques.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction and philosophy of 11 Gives the idea about fundamentals of
Uncertainty (Basic probability), Basic probability theory with some important
discrete and continuous distributions: discrete and continues probability
1
Binomial, Poisson, Normal, Log-normal, distributions.
Exponential and Bivariate Normal
distribution.
Theory of estimation: Criteria of a good 10 Gives the idea about classical and Bayesian
estimator, Point and Interval estimation procedures applicable in real life
2
Estimations, Bayesian Estimation. problems.

Theory of Hypothesis Testing: Test of 8 Gives the idea about testing of hypothesis
mean, variance, proportions, correlation and important tests applicable in data
3 co-efficient, regression coefficient under analytics.
normality assumption, test of
independence of attribute.
Non-parametric tests for non-normal 3 Gives the idea about non-parametric tests
4 population: run test, sign test, Mann- applicable for the situations where
Whitney Wilcoxon U-tests. normality assumption is doubtful.
Analysis of variance: One-way and 7 Gives the idea about basic analysis of
Two-way; Design of Experiments: CRD, variance and basic design of experiments
5
RBD and LSD with their applications. applicable in most of the industry oriented
problems.

Text Books:
1. Fundamentals of Mathematical Statistics, Sultan Chand and Sons, by Gupta S.C. and Kapoor,
V. K.
Reference Books:
1. Introduction to the Theory of Statistics, Tata McGraw-Hill, New Delhi. by Mood M.,
Graybill F.A. and Boes D.C.
2. An Introduction to Probability Theory and Mathematical Statistics, John Wiley. by Rohatgi,
V.K. and Saleh.
3. Linear Statistical Inference and its Applications, Wiley Eastern Ltd, New Delhi. by Rao C. R.
4. Mathematical Statistics, 3rd Ed, Books and Allied (P) Ltd, Kolkata, by Parimal
Mukhopadhyay
5. Theory of Point Estimation, 2nd Ed, Wiley Eastern Ltd. by Lehmann, E.L and Casella G.
6. Testing Statistical Hypotheses, 3rd Ed, Springer. by Lehmann, E.L and Joseph P. Romano.
7. Fundamentals of Applied Statistics, Sultan Chand and Sons, by Gupta S.C. and Kapoor,V. K.
 Course Format: MCC535
Course
Course Code Name of Course L T P Credit
Type
DC MCC535 Soft Computing Techniques 3 0 0 9

Course Objective
To provide exposure to theory application of soft computing techniques in Data Analytics.
Learning Outcomes
This course will provide the students an exposure about how to use computing techniques in Data
Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Fuzzy sets: Membership functions, 11 This unit will help students to understand
Basic operations, Fuzzy relations, Fuzzy logics.
1 Defuzzification, Fuzzy inference, Fuzzy
rule based system.

Genetic Algorithm: Working principle, 11 This unit will help students to understand
Cross over mutation, roulette wheel the Application of Genetic algorithm.
selection, tournament selection,
population, binary encoding and
2 decoding for any optimization problem,
Multi objective GAs, Concepts on non-
domination, Tournament selection,
Crowding distance operator, Ranking.

Rough Sets: Lower and upper 9 This unit will help students to apply the
approximations, Discernibility matrix, concept of rough sets and will learn to deal
3
Accuracy of Approximations. with big data.

Hybridization of soft computing tools 8 Students will be able to apply different soft
like Neuro-fuzzy, Rough fuzzy, Rough- computing techniques in this unit.
4
Fuzzy-GA, Ant Colony based
optimization.

Text Books:
1. G.J. Klir and B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice-Hall,
1995.
Reference Books:
1. M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, 2000.
2. R. L. Haupt and S.E. Haupt, Practical Genetic Algorithms, John Willey & Sons, 2002.
 Course Format: MCC536
Course
Course Code Name of Course L T P Credit
Type
DC MCC536 Advanced Data Structures and Algorithms-Practical 0 0 2 2

Course Objective
To provide the practical implementation of algorithms using efficient data structures
Learning Outcomes
Students will learn how to implement different data structures and Algorithms using C or C++.

Unit Lab
Topics to be Covered Learning Outcome
No. Hours
Implementation of randomized 02 This unit will help students to learn
1 quicksort, hashing functions and implementation of quicksort, randomized
associated algorithms quicksort and several hashing functions.
Implementation of operations on Splay 06 This unit will make students learn the
2 trees and B-trees: implementation of operations on splay trees
and B-trees
Implementation of operations on binary 06 This unit will make students learn the
and Fibonnaci Heaps: Operations such implementation of operations on binary,
3
as insert, union, decrease-key, binomial, and Fibonacci heaps
make/build heap, delete, findmin
Implementation of operations on 04 This unit will make students learn about the
4 partition ADT and union find data implementation of union-find data
structurs structures in MST algorithms
Implementation of Bellman Ford 04 This unit will make students learn about
5 algorithm about the implementation of Bellman-Ford
algorithm.
Implementation of Ford-Fulkerson 04 Students will learn the implementation of
algorithm and Edmond-Karp algorithm the algorithm to compute the maximum
6
flow in a network and its applications to
compute maximum matching

Text Books:
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to algorithms, PHI, 3rd
Edition, 2010

Reference Books:
1. M. A. Weiss, Data Structures and Algorithm Analysis , Addison-Wesley, 2nd Edition, 2013
2. A. V. Aho, J. E. Hopcroft, J. D. Ullman, Data Structures and Algorithms, Addison-Wesley,
1st Edition, 1982
3. S. S. Skiena: The Algorithm Design Manual, Springer, 2nd Edition, 2008
4. J. Kleinberg, E. Tardos, Algorithm Design, Addison-Wesley, 1st Edition, 2005
 Course Format: MCC537
Course
Course Code Name of Course L T P Credit
Type
DC MCC537 Fundamentals of Machine Learning-Practical 0 0 2 2
(will be carried out Using R/Python)

Course Objective
Data Structures is the basic course of Computer Science. It is required in every field of Computer Science.
Objective of this course is to impart knowledge of Data Structures.
Learning Outcomes
Students will learn how to implement machine learning techniques using R/Python

Unit Lab
Topics to be Covered Learning Outcome
No. Hours
Application of Regression Analysis in 08 This unit will help students to learn the
Data Analytics, Application of Decision implementation of Regression Analysis,
1 Tree and SVM in Data Analytics,. Decision Tree and SVM, Nonlinear
Application of Nonlinear Regression in Regression in Data Analytics
Data Analytics.
Problems related to Logistic Regression 08 This unit will make students learn the
in Data Analytics, Application of implementation of Logistic Regression,
Statistical Learning in Data Analytics, Application of Statistical Learning,
2
Application of applications of Neural Application of applications of Neural
Network and deep Learning in Data Network and deep Learning in Data
Analytics Analytics.
Application of PCA in Data Analytics, 08 This unit will make students learn the
Application of ICA and LDA in Data implementation of PCA, Application of
3
Analytics, Application of Supervised ICA and LDA, Application of Supervised
Learning in Data Analytics Learning in Data Analytics.
Application of Clustering Techniques in 02 This unit will make students to learn about
4 Data Analytics the implementation of Clustering
Algorithms in Data Analytics.

Text Books:
1. B. Lantz, Machine Learning with R, Packt Publishing Limited, 2013.

Reference Books:
1. P. Mueller and L Massaron, Machine Learning (in Python and R), John Wiley & Sons, 2016.
 Course Format: MCC538
Course
Course Code Name of Course L T P Credit
Type
DC MCC538 Computer Oriented Numerical Methods-Practical 0 0 2 2

Course Objective
Student will get an exposer about the implementation of Numerical Methods using Python.
Learning Outcomes
Student can use Python to Solve Various Numeral Methods using its libraries like Nympy, Scpy,
matplotlib.

Unit Lab
Topics to be Covered Learning Outcome
No. Hours
Basics of Python programming. 2 To learn the basics of Numerical Python
1
Implementation of Python Functions To understand interpolation through
2 and Modules,Use of libraries like 2 Python program
Numpy, Scipy, Matplotlib.
Python programme for Hermite To understand various curve fitting/fairing
interpolation, Chebyshev Polynomials, techniques through Python code
3 2
Chebyshev Series,Cubic and B-Splines.

Python programme for Adaptive To demonstrate numerical integration

Integration, Guassian Quadrature,
4 2
Multiple Integrals and Solution of
Integral Equations.
Python programme for Numerical Be able write python program to solve
5 2
Solution of linear Equations. linear Equations
Python programme for Solution of Be able write python program to solve and
6 2
Nonlinear Equations. Nonlinear
Python programme Solution of Ordinary To understand methods for solving
7 Differential Equations (ODEs): Explicit 4 Ordinary Differential Equations (ODEs)
Runge-Kutta Methods.
Python programme for Multistep To write Python code for Multi-step
8 Methods, Extrapolation methods. 2
Methods, Extrapolation methods.
Python programme for Shooting To solve BVP using Python
9 4
Method, Boundary value problems.
Python programme for Numerical To solve PDF using Python
10 Solutions of Partial Differential 4
Equations (PDEs).

Text Books:
1. As provided with Code: MCC5303
Reference Books:
2. As provided with Code: MCC5303
 Course Format: MCC539
Course
Course Code Name of Course L T P Credit
Type
DC MCC539 Advanced DBMS 3 0 0 9

Course Objective
To provide knowledge of advanced DBMS.
Learning Outcomes
They will able design data bases used for Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Object oriented model: Nested relations, 9 At the end of this unit, students will be able
modelling nested relations as object model, to write complex data querries in SQL on
extension of SQL, object definition and relational database models, set triggers, and
1 query language (ODL, OQL), object learn about data storage ance access
relational database model, storage and
methods.
access methods. Active databases, Advanced
trigger structures, SQL extensions.
Security and Integrity: Discretionary and 11 At the end of this unit, students will be able
mandatory access control; Facilities in SQL, to write their first web application based on
access control models for RDBMS and a distributed database.
OODBMS. Distributed Database: Basic
2 Structure, fragmentation algorithms, trade-
offs for replication, query processing,
recovery and concurrency control; Multi-
database systems; Design of Web Databases.
Data Mining and Warehousing: Association 11 At the end of this unit, students will be able
Rule algorithms, algorithms for sequential store and access data from various database
patterns; Clustering and classification in storage systems and mine ana analyze
3 data mining; Basic structure of a data databases for making business decisions.
warehouse; Extension of ER Model,
materialistic view creation.
On line analytical processing and data cube. 4 At the end of this unit, students will be able
Deductive databases, recursive query design deductive and logical databases and
4 construction, logical database design and
data log. write recursive queries.

One or more of the following topics: (i) 4 At the end of this unit, students will be
Temporal database, (ii) Multimedia well-versed with the topics that are selected
5 database, (iii) Text retrieval and mining, (iv) for teaching.
Web mining, and (v) Any topic of current
interest.

Text Books:
1. Database System Concepts, Korth, Silberschatz and Sudarshan, McGraw Hill

Reference Books:
2. Database: Principles, Programming, Performance, P. O'Neil, Morgan Koffman
3. Principles of Database and Knowledge-Base Systems, J.D. Ullman, Computer Science
 Course Format: MCC540
Course
Course Code Name of Course L T P Credit
Type
DC MCC540 Neural Networks and Deep Learning 3 0 0 9

Course Objective
All Data Analytics applications are depended on Neural Network and Deep Learning.
Learning Outcomes
This course will provide the students an exposure about how to use Neural Network and Deep Learning in
Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction: Various paradigms of 8 This unit will help students to understand
earning problems, Perspectives and deep learning.
1 Issues in deep learning framework,
review of fundamental learning
techniques.
Feedforward neural network: Artificial 8 This unit will help students to understand
2 Neural Network, activation function, the concept of ANN.
multi-layer neural network.
Training Neural Network: Risk 11 This unit will help students to get the
minimization, loss function, concept different training methods of ANN.
backpropagation, regularization, model
selection, and optimization. Conditional
Random
3
Fields: Linear chain, partition function,
Markov network, Belief propagation,
Training CRFs, Hidden Markov Model,
Entropy.

Deep Learning: Deep Feed Forward 5 This unit will help students to get the
network, regularizations, training deep concept of different Deep Learning
models, dropouts, Convolutional Neural techniques.
4
Network, Recurrent Neural Network,
Deep Belief Network.

Probabilistic Neural Network: Hopfield 7 This unit will help students to get the
Net, Boltzman machine, RBMs, Sigmoid concept of different types of ANN.
net, Autoencoders. Deep Learning
5 research: Object recognition, sparse
coding, computer vision, natural
language processing. Deep Learning
Tools: Caffe, Theano, Torch.

Text Books:
1. M. Nielsen, Neural Networks and Deep Learning, Determination Press, 2015
Reference Books:
2. Charu C. Aggarwal, Neural Networks and Deep Learning: A Textbook, Springer, 2018
 Course Format: MCO531
Course
Course Code Name of Course L T P Credit
Type
OE MCO531 Stochastic Processes 3 0 0 9

Course Objective
The objective of the course will be to give idea to the students about various Stochastic Processes.
Learning Outcomes
This course will be useful for analysis of different financial market data, Business data.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Definition and classification of general 9 This unit will help students to understand
stochastic processes. Markov Chains: basics of Stochastics Processes and Markov
definition, transition probability Chain.
1
matrices, classification of states, limiting
properties.

Chains with Discrete State Space: 11 This unit will help students to understand
Poisson process, birth and death different type of Point processes and their
processes. Renewal Process: Renewal applications.
2 Process when Time is discrete, Renewal
Process when Time is continues,
Renewal Theory and Analysis.

Markov Process with Continuous State 9 This unit will help students to get the
Space: Introduction to Brownian motion, concept different continuous State processes
3 Wiener Process, Differential equation of with application in finance.
Wiener Process, Kolmogorov Equations.

Markov Decision Process, Branching 6 This unit will help students to get the
4 Process concept of Markov decision process and its
applications.
Congestion Process: Queuing Process, 4 This unit will help students to get the
5 M/M/1 Queue concept of Queuing theory and its
application.

Text Books:
1. Stochastic Processes by J. Medhi, New Age International Publication

Reference Books:
2. Elements of Applied Stochastic Processes by U.N. Bhat, John Wiley and Sons.
3. Probability and Statistics with Reliability, Queuing, and Computer Science Applications by
K.S. Trivedi, Prentice Hall of India.
 Course Format: MCO532
Course
Course Code Name of Course L T P Credit
Type
OE MCO532 Advanced Multivariate Analysis 3 0 0 9

Course Objective
This course will demonstrate the properties of multivariate distributions and their applications.
Learning Outcomes
Students will learn about the application of Multivariate Analysis techniques in Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Review of multivariate normal 7 Demonstrate the properties of multivariate
distribution and its properties, distributions such as multivariate normal,
distributions of linear and quadratic Wishart distribution etc. and their
1 forms, tests for partial and multiple applications
correlation coefficients and regression
coefficients and their associated
confidence regions. Wishart distribution.
Construction of tests, likelihood ratio 7 Inference on parameters of the multivariate
principles, inference on mean vector, normal distributions and constructions of
2
Hotelling's T2. MANOVA. Inference on different tests, MANOVA etc.
covariance matrices.
Discriminant analysis. Principal 12 Understanding discriminant analysis and
component analysis, factor analysis and principal component analysis for analyzing
3 clustering. Unified approach for multivariate data.
constructions of probability distributions
on
Dimension reduction techniques: 6 Use principal component analysis
Principal component and generalized effectively for data exploration and data
4 canonical variable analysis – dimension reduction for high dimensional
constructions and related inference data
problems.
Large p–small n problems in testing of 7 Students will learn the theory of statistical
multi parameter hypotheses: Tests for inference for high dimensional data
5 the mean vector in (μ,Σ), null and analysis.
non-null asymptotic distributions of their
test statistics.
Text Books:
1. T. W. Anderson (1984), An Introduction to Multivariate Statistical Analysis. 2nd Ed. John
Wiley.
2. C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to algorithms, PHI, 3rd Edition, 2010.
Reference Books:
3. R. A. Johnson and D. W. Wichern (2013), Applied Multivariate Statistical Analysis. 6th Ed.
Pearson.
4. C. R. Rao (2002), Linear Statistical Inference and its Applications. 2nd Ed. Wiley.
5. M. S. Srivastava and C. G. Khatri (1979), An Introduction to Multivariate Statistics, Elsevier
North Holland, Inc., New York.
6. R. J. Muirhead (2009). Aspects of Multivariate Statistical Theory. 2nd Ed. Wiley-Interscience
 Course Format: MCC541
Course
Course Code Name of Course L T P Credit
Type
DC MCC541 Advanced DBMS-Practical 0 0 2 2

Course Objective
Advanced DBMS is the important course Data Analytics.
Learning Outcomes
Students will learn how to use and design Data Base in Data Analytics.

Unit Lab
Topics to be Covered Learning Outcome
No. Hours
Accessing the database, Basic, 10 This unit will help students to learn how to
intermediate, and advanced SQL, access the database, Basic, intermediate and
1
Introduction to Python database toolbox. advanced SQL, and Python database
toolbox.
Introduction to Git, Database access 10 This unit will make students learn about
from a programming language, Database Git, Database access from a programming
2
metadata access from a programming language, Database metadata access from a
language. programming language.
Create a webpage connected to a 10 Students will learn how to Create a
database server, Create functions to webpage connected to a database server and
3
generate HTML Create functions to generate HTML.

Term projects: self-conceived or 09 Students will do some projects related to

4 assigned by the instructor, Presentation implementation of DBMS in Data Analytics
of the term projects as assigned by the instructor.

Text Books:
1. Database System Concepts, Korth, Silberschatz and Sudarshan, McGraw Hill
Reference Books:
2. Database: Principles, Programming, Performance, P. O'Neil, Morgan Koffman
3. Principles of Database and Knowledge-Base Systems, J.D. Ullman, Computer Science
 Course Format: MCC542
Course
Course Code Name of Course L T P Credit
Type
DC MCC542 Neural Networks & Deep Learning-Practical 0 0 2 2

Course Objective
Neural Network & Deep Learning Practical is important course Data Analytics.
Learning Outcomes
Students will learn how to use Neural Network & Deep Learning in Data Analytics.

Unit Lab
Topics to be Covered Learning Outcome
No. Hours
Implementation of different activation 08 This unit will help students to learn the
functions to train Neural Network, implementation of different activation
1 Implementation of different Learning functions to train Neural Network,
Rules, Implementation of Perceptron implementation of different Learning Rules,
Networks implementation of Perceptron Networks.
Implementation of Adeline network for 08 This unit will make students learn the
system identification, Implementation of implementation of Adeline network for
2 Madeline network, Pattern matching system identification, implementation of
using different rules. Madeline network, Pattern matching using
different rules.
Project related to application of machine 05 Students will do some projects and learn
learning in healthcare, Project related to how to implement machine learning in
3
application of machine learning in healthcare and in business analytics
business analysis
Project related to application of machine 05 Students will do some projects and learn
learning in sports analytics, Project how to implement machine learning in
4 related to application of machine sports analytics and applications of
learning in Time Series Analysis & Machine learning Techniques in Time
Forecasting. Series Analysis & Forecasting.

Text Books:
1. S. N. Sivanandam and S. N. Deepa, Introduction to neural networks using Matlab, 2016.
Reference Books:
2. Simon Haykin, Neural Networks and Learning Machines, PHI, 2008.
 Course Format: MCO533
Course
Course Code Name of Course L T P Credit
Type
OE MCO533 Numerical Linear Algebra 3 0 0 9

Course Objective
The objective of the course will be to give idea to the students about Numerical Linear Algebra.
Learning Outcomes
Students will get an exposure to Matrix Iterative Methods for Analysis Real Life System.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
LU factorization, Pivoting, Cholesky 6 Understanding the concept of factorization
decomposition, Iterative refinement, QR of matrix into two product of two matrices.
1 factorization, Gram-Schmidt
orthogonalization.

Projections, Householder reflectors, Givens 7 Student will able to understand the SVD
rotation, Singular Value Decomposition, and its application in real life problem.
2 Rank and matrix approximations, image
compression using SVD, Least squares and
least norm solution of linear systems
Pseudoinverse, normal equations, 7 Solving eigenvalue and eigenvector
Eigenvalue problems, Gershgorin theorem, problem using numerical linear algebraic
Similarity transform, Eigenvalue & technique.
3 eigenvector computations and sensitivity,
Power method, Schur decomposition, Jordan
canonical form, QR iteration with & without
shifts.
Hessenberg transformation, Rayleigh 7 Student will learn algorithm for the
quotient, Symmetric eigenvalue problem, computation of singular value computation.
Jacobi method, Divide and Conquer,
Computing the Singular Value
4 Decomposition, Golub-Kahan-Reinsch
algorithm, Chan SVD algorithm,
Generalized SVD, Generalized and
Quadratic eigenvalue problems.
Generalized Schur decomposition (QZ 12 Students will able to solve the large linear
decomposition), Iterative methods for large system of equations using Krylov subspace
linear systems: Jacobi, Gauss-Seidel and methods.
SOR, convergence of iterative algorithms.
5 Krylov subspace methods: Lanczos, Arnoldi,
MINRES, GMRES, Conjugate Gradient and
QMR, Pre-conditioners, Approximating
eigenvalues and eigenvectors.

Text Books:
1. B.N. Dutta, Numerical Linear Algebra and Applications, SIAM, 2010
Reference Books:
1. R. Bellman, Introduction to Matrix Analysis, SIAM, 1997
2. R.S. Varga, Matrix Iterative Analysis, Springer, 2000
 Course Format: MCD531
Course
Course Code Name of Course L T P Credit
Type
DE MCD531 Cryptography 3 0 0 9

Course Objective
To understand the classical and modern cryptosystems for secure encryption and decryption.
Learning Outcomes
The students will be able to understand the basic idea of encryption and decryption schemes.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Brief introduction to number theory, 7 Students will learn the basics of number
Euclidean algorithm, Euler’s totient theory.
function, Fermat’s theorem and Euler’s
1 generalization, Chinese Remainder
Theorem, primitive roots and discrete
logarithms, Quadratic residues,
Legendre and Jacobi symbols.
Cryptography and cryptanalysis, 8 Students will be able to understand classical
classical cryptosystems, concept of and public key encryption and decryption
block and stream ciphers, private and techniques.
2 public key cryptography. Encryption
standard: DES and differential and linear
cryptanalysis, Advanced encryption
standards
RSA public key cryptosystems: RSA 6 Students will learn RSA cryptosystems and
system, primality testing. Diffe-Hellman Massey-Omura cryptosystem for message
3
key exchange system. Massey-Omura transmission.
cryptosystem for message transmission.
Other public key cryptosystems: El 6 Students will learn El Gamal and Knapsack
Gamal public key cryptosystem, cryptosystems and discrete log problem.
4
algorithms for discrete log problem,
Knapsack public key cryptosystems.
Digital signature and hash functions: El 12 The students will be able to understand
Gamal signature scheme, digital different signature schemes and properties
signature standard, onetime undeniable of hash functions and their applications.
and fail-stop signatures, computationally Students will be able to understand basics
5
collision-free hash functions, extending of elliptic curves and their applications in
hash functions, examples of hash designing cryptosystems
functions. Introduction to elliptic curves,
basic facts, elliptic curve cryptosystems

Text Books:
1. N. Koblitz, A Course in Number Theory and Cryptography, 2nd Edition, 1994

Reference Books:
2. J. Hoffstein, J. Pipher, J. H. Silverman, An Introduction to Mathematical Cryptography,
Springer, 2008.
3. J. Buchmann, Introduction to Cryptography, 2nd Edition, Springer, 2012.
4. D. Stinson Cryptography Theory and Practice, 3rd edition, Chapman & Hall, CRC, 2005.
 Course Format: MCD532

Course
Course Code Name of Course L T P Credit
Type
DE MCD532 Data Mining 3 0 0 9

Course Objective
To provide exposure to theory of Data Mining.
Learning Outcomes
Students will get an idea about how to apply Data Mining techniques in Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction: Introduction to data 8 This unit will help students to understand
mining and knowledge discovery from basics of Data Mining and Scalability issues
1
databases. Scalability issues of data of data mining algorithms.
mining algorithms.
Introduction to Data warehousing: 11 This unit will help students to understand
2 General principles, modelling, design, the concept of Data warehousing.
implementation, and optimization.
Data preparation: Pre-processing, sub- 9 This unit will help students to understand
sampling, feature selection. the concept of Data preparation techniques.
3 Associations, dependence analysis,
correlation, rule generation- a priori
algorithm, FP Trees etc. and evaluation.
Cluster analysis and Outlier Detection, 11 This unit will help students to understand
Temporal and spatial data mining: the concept of Cluster analysis and Outlier
Mining complex types of data. Detection, Temporal and spatial data
4 Advanced topics: High performance mining: Mining complex types of data.
computing for data mining, distributed Advanced topics: High performance
data mining. computing for data mining, distributed data
mining

Text Books:
1. J. Han, M.Kamber and J. Pie, Data Mining: Concepts and Techniques, Elsevier, 2012.
Reference Books:
1. M. J. Zaki and W. Meira, Data Mining and Analysis: Fundamental Concepts and Algorithms,
Cambridge University Press, 2014.
2. E. Frank, I. H. Witten and M. Hall, Data Mining: Practical Machine Learning Tools and
Techniques, Elsevier, 2017.
 Course Format: MCD533

Course
Course Code Name of Course L T P Credit
Type
DE MCD533 Numerical Optimization 3 0 0 9

Course Objective
The course deals with the basic idea of mathematical programming (Linear and Nonlinear).
Learning Outcomes
The student will get an exposer on how to work out the computational implementation of a numerical
algorithm for solving Linear and Nonlinear Programming Problem and do presentations.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Linear Programming: Review of various 8 Students will get the basic idea of linear
1 techniques of linear programming programming.
problems.
Unconstraint Optimization: One 12 Students will learn new methods to find the
dimensional- Fibonacci methods, Golden solution of the constrained optimization
Section, Bisection and Newton Method; problem.
2 Higher dimensional- Random search
methods, Nelder and Meed method,
Steepest descent method, Grid search
method, Conjugate gradient methods
Constraint Optimization: Kuhn Tucker 10 In this unit, students will be able to obtain
conditions, Zoutendijk’s method of the optimality conditions for the constraint
feasible directions, Sequential optimization problems.
3
programming approach, Cutting plane
methods. Rosen’s gradient projection
method
Penalty Function Methods: Basic 9 This unit will help the student to convert the
approach of the penalty function method, given constrained optimization problems
4 Exterior penalty function method, into an equivalent unconstrained
Interior penalty function method, optimization problem.
Augmented Lagrange multiplier method.

Text Books:
1. Nocedaa, J. and Wright, S. J.: “Numerical Optimization”, Springer series in Operations
Research, Springer-Verlag, 2006.
Reference Books:
1. Chandra, S., Jayadeva and Mehra, A.: “Numerical Optimization with Applications”, Narosa,
2009.
2. Rao, S. S.: “Engineering Optimization: Theory and Practice”, John Wiley, 2009
3. Bazaraa, M. S., Sherali, H. D. and Shetty, C. M.: “Nonlinear Programming Theory and
Algorithms”, Second Edition, John Wiley and Sons, 1993.
 Course Format: MCD534

Course
Course Code Name of Course L T P Credit
Type
DE MCD534 Sports Analytics 3 0 0 9

Course Objective
At present it is a very important area in Data Analytics. This course will provide exposure to theory as
well as applications related to Sports Analytics
Learning Outcomes
The student will get an exposer on how to using Data Analytics Techniques in Sorts Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
An Introduction to Analytics and Data, 6 This unit will help students to understand
1
The Data Ecosystem basics of Sports Analytics.
The Data Game, Strategic Talent 10 This unit will help students to understand
Management Analytics, Analytics in Talent Management Analytics, Analytics in
2 Sport Marketing, Choosing Sport Marketing, Choosing performance
performance metrics for players and metrics for players and teams.
teams.
Big data in sports, Predicting outcomes 9 This unit will help students to get the
of games, tournaments, and seasons, concept Big data in sports, Predicting
Machine learning in sports, Evaluating outcomes of games, tournaments, and
3
performance through profit and loss seasons, Machine learning in sports,
Evaluating performance through profit and
loss.
Analytics in Digital Marketing, Sport 10 This unit will help students to get the
Finance by the Numbers, Sport Law by concept of Sport Finance by the Numbers,
4
the Numbers, Sports Telecom, Media Sport Law by the Numbers, Sports
and Technology. Telecom, Media and Technology.
Manufacturing/Production Analytics, 4 This unit will help students to get the
Event Management by the Numbers, concept of Production Analytics, Event
5
Facility Management Analytics Management by the Numbers, Facility
Management Analytics.

Text Books:
1. Thomas W. Miller, Sports Analytics and Data Science: Winning the Game with Methods and
Models, O’Reilly Publication, 2015.

Reference Books:
1. G. Fried and C. Mumcu, Sport Analytics, Routledge, Taylor & Francis Group, 2016.
2. F. Green, Winning With Data: CRM and Analytics for the Business of Sports, Routledge,
Taylor & Francis Group, 2018.
3. Jim Albert, Mark E. Glickman, Tim B. Swartz and Ruud H. Koning, Handbook of Statistical
Methods and Analyses in Sports, CRC Press, 2016.
 Course Format: MCD535

Course
Course Code Name of Course L T P Credit
Type
DE MCD535 Bioinformatics 3 0 0 9

Course Objective
This course will provide knowledge on Bioinformatics.
Learning Outcomes
Students will learn about the application of Bioinformatics in Data Analytics.

Uni
Lecture
t Topics to be Covered Learning Outcome
Hours
No.
Biological Databases: Organisation, 9 This unit will help students to understand
searching and retrieval of information, how to Organize searching and retrieval of
1
accessing global bioinformatics information, from Biological Database.
resources using internet links.
Nucleic acids sequence assembly, 10 This unit will help students to understand
restriction mapping, finding simple sites about Nucleic acids sequence assembly,
and transcriptional signals, coding region restriction mapping, finding simple sites
2
identification, RNA secondary structure and transcriptional signals, coding region
prediction. identification, RNA secondary structure
prediction.
Similarity and Homology, dotmatrix 10 This unit will help students to understand
methods, dynamic programming the concept of evolutionary relationships,
3 methods, scoring systems, multiple genome analysis.
sequence alignments, evolutionary
relationships, genome analysis.
Protein physical properties, structural 10 This unit will help students to understand
properties – secondary structure the concept of detection and prediction of
prediction, hydrophobicity patterns, different Protein Database and Genome
4 detection of motifs, structural database Database.
(PDB). Genome databases, Cambridge
structure database, data mining tools and
techniques, Structural Bioinformatics.

Text Books:
1. Gribkov, M., and Devereux, J. (Eds), Sequence Analysis Primer, Stockton Press, 1991.
Reference Books:
1. Mount, D.W., Bioinformatics: Sequence and Genome Analysis, Cold. Spring Harbor
Laboratory Press, 2001.
2. Baxevanis, A.D., and Ouellette, B.F.F. (Eds), Bioinformatics: A practical guide to the
analysis of the genes and proteins, Wiley-Interscience, 1998.
 Course Format: MCD536
Course
Course Code Name of Course L T P Credit
Type
DE MCD536 Advanced Algorithms for Graphs 3 0 0 9

Course Objective
This course will provide knowledge on Graph Theory.
Learning Outcomes
Students will learn about the application of Graph Algorithms in various areas of Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Basic definitions, Graph representations: adjacency 2 Students will learn the basic
1 matrix, incidence matrix, adjacency list. definitions on graphs and its
representation on a computer.
Shortest path problems: Single source SP problem, 8 This unit will help the students in
SP tree, Ford’s labelling method, labelling and understanding the various shortest
scanning method, efficient scanning orders—
path problems and the efficient
topological order for acyclic networks, shortest first
2 search for non-negative networks (Dijkstra), BFS algorithms associated with those.
search for general networks, correctness and
analysis of the algorithms; All pair SP problem—
Edmond-Karp method, Floyd’s algorithm and its
analysis.
Flows in Networks: Basic concepts, maxfiow- 9 This will help in various advanced
mincut theorem, Ford and Fulkerson augmenting algorithms in network flows.
path method, integral flow theorem, maximum
capacity augmentation, Edmond-Karp method,
3 Dinic’s method and its analysis, Malhotra-Kumar-
Maheswari method and its analysis, Preflow- push
method (Goldbergarj Ian) and its analysis; Better
time bounds for simple networks. Minimum cost
flow: Minimum cost augmentation and its analysis.
Matching problems: Basic concepts, bipartite 11 Students will learn the concepts of
matching— Edmond’s blossom shrinking algorithm matchings in graphs and efficient
and its analysis; Recent developments. Planarity:
4 algorithms to compute the matching in
Basic fact about planarity, polynomial time
algorithm. a graph.

Graph isomorphism: Importance of the problem, 9 Students will learn the planarity and
backtrack algorithm and its complexity, the algorithm on testing planarity of a
isomorphism complete problems, polynomial time given graph. Students will learn the
algorithm for planar graphs, group theoretic
5 methods. Applications of graphs in various fields one of the difficult problem the graph
like telecommunications, networking, image isomorphism problem. Students will
processing, pattern recognition, graph cut learn the application of graphs in
algorithms. different areas.

Text Books: 1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to algorithms,

PHI, 3rd Edition, 2010
Reference Books:
1. D. Junknickel: Graphs, Networks, and Algorithms, Springer, 4 th Edition, 2013.
2. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Maths. 57,
Elsevier, 2nd Edition, 2004.
3. C. M. Hoffman: Group Theoretic Algorithms and Graph Isomorphisms, Springer-Verlag, Berlin, 1982.
4. C. H. Papadimitriou, K. Stiglitz: Combinatorial Optimization: Algorithms and Complexity, PHI, 1997.
 Course Format: MCD537
Course
Course Code Name of Course L T P Credit
Type
DE MCD537 Design of Experiments 3 0 0 9

Course Objective
In Statistics designing of an experiment means to decide how the measurements or observations should be
taken during the experiment so that a valid statistical analysis in economical way may be provided.
Learning Outcomes
During the scientific experiments or industrial studies huge data are being generated and to
draw meaningful conclusions for the data, design of experiments help in providing the relevant results and
interpretations.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Analysis of variance one way and two- 5 Gives the idea about analyzing the
1 way (with m observations per cell) variations creep in the data due to various
classifications factors for complicated situations.
Basic principles of design of 11 Gives the idea about fundamentals of design
experiments, CRD, RBD and LSD and of experiments and some basic designs.
2
their analysis, estimation of missing
observations.
Factorial experiments: 22, 23, 32 and 33 11 Gives the idea about factorial experiments,
3 experiments, confounding in 23 factorial where different factors are considered at
experiment. different levels.
Balanced Incomplete Block Design 7 Gives the idea about incomplete block
(BIBD), relation between their designs arises in many practical situations.
4
parameters. Intra and Inter block
analysis of BIBD.
Split plot and simple lattice designs. 5 Gives the idea about split plots and lattice
5 designs when some factors are harder to
vary than other factors.

Text Books:
1. Design and Analysis of Experiments, 1986, 2nd Ed. by M. N. Das & N. C. Giri, Wiley
Eastern Ltd. New Delhi.

Reference Books:
1. Design and Analysis of Experiments by D. C. Montgomery, 1984, 2nd Ed., John Wiley &
Sons, New York.
2. Fundamentals of Applied Statistics by S. C. Gupta and V. K. Kapoor, 1993, 3rd Ed., Sultan
Chand, New Delhi.
3. Experimental Designs, (1992 2nd Ed.), William G. Cochran, Gertrude M. Cox, Wiley Hall.
 Course Format: MCD538

Course
Course Code Name of Course L T P Credit
Type
DE MCD538 Time Series Analysis 3 0 0 9

Course Objective
The objective of the course will be to give idea to the students about Time Series Analysis.
Learning Outcomes
This course will be useful for analysis of different time series data, modelling forecasting using the time
series data.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Discrete parameter stochastic 12 This unit will help students to understand
processes, strong and weak stationary, basics of Time Series, techniques for
autocovariance and autocorrelation. identifying different Time Series models.
Periodogram and correlogram analysis.
1
Linear Time Series Models: Stationary
and Non Stationary Models, model
identifications, parameter estimation
and forecasting.
Conditional Heteroscedastic models 9 This unit will help students to understand
2 and their applications. Heteroscedastic models and their
applications.
Multivariate Time Series Analysis and 8 This unit will help students to get the
3 their Applications concept Multivariate Time Series Analysis
and their Applications.
PCA and Factor Models and their 6 This unit will help students to get the
4 applications concept of PCA and factor models and their
use in Data Analytics.
Transfer Function models: 4 This unit will help students to get the
5 identification, fitting and application. concept of Transfer Function models with
its application in Data Analytics.

Text Books:
1. Time Series Analysis, Forecasting and Control by Box and Jenkins, Pearson Education
Reference Books:
1. Introduction to Time Series and Forecasting by P.J. Brockwell and R.A. Davis, Springer
2. Analysis of Financial Time Series by Ruey S. Tsay
3. Time Series Analysis and Its Applications with R Examples by R.H. Shumway & D.S.
Stoffer
 Course Format: MCD539

Course
Course Code Name of Course L T P Credit
Type
DE MCD539 Big data 3 0 0 9

Course Objective
This course will provide exposure to theory of Big data.
Learning Outcomes
Students will able to use Big data analysis in Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Basic Statistics and R, basic statistical 8 This unit will help students to understand of
1 concepts with a brief review of R. R and its use in Statistical Analysis.
Relationships and Representations, 9 This unit will help students to understand
2 Graph Databases. Introduction to Spark Relationships and Representations, Graph
2.0 and Hadoop. Databases.
Language processing, Analysis of 9 This unit will help students to get the
Streaming Data, Applications of ML concept Language processing, Analysis of
3 Library, Basic Neural Network and Streaming Data, Applications of ML
Tensor Flow, Advance Tensor Flow
Library, Basic Neural Network and Tensor
Flow, Advance Tensor Flow.
Assessing Quality of Big Data Analysis, 13 This unit will help students to get the idea
Analysis of Images, OCR Applications, about the applications of Big data in various
Analysis of Speech Signal, Page Rank areas like: Image analysis, Speech and
4 like Search systems, Analysis of Signal analysis, analysis of Data flow
Streaming Data with Tensor Flow, engine, etc.
VoltDB, Data Flow Engines and other
memory databases.

Text Books:
1. H. Karau, Learning Spark: Lightning-Fast Big Data Analysis, O’ Rielly Media Inc., 2015
Reference Books:
1. EMC Education Services, Data Science and Big Data Analytics: Discovering, Analyzing,
Visualizing and Presenting Data, John Willey & Sons, 2015
2. T. Harkness, Big Data: Does Size Matter?, Bloomsbury Publication, 2015
 Course Format: MCD540
Course
Course Code Name of Course L T P Credit
Type
DE MCD540 Biostatistics 3 0 0 9

Course Objective
During the process of life sciences, medicinal and clinical experiments, precious data are being generated,
which need careful and valid statistical analysis for drawing the meaningful conclusions.
Learning Outcomes
The course content of this paper has been finalized so that it may be helpful to the students who are
intending to join the health sector or pharmaceutical industries.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Statistical Methods in Clinical Trials: 7 Gives the idea about fundamentals and
Introduction and its phases I, II, III and different approaches of survey sampling.
1 IV, statistical designs-fixed sample trials
design and Sequential design,
Randomization, Blinding.
Biological Assays, Feller’s theorem. 6 Gives the idea about advanced sampling
2 Dose-response relationships-qualitative schemes and important estimators.
and quantitative response.
Data editing and transformations, 11 Gives the elaborative methods for using the
Transformation in general: logarithmic, auxiliary information at estimation stage in
square root and power transformations; survey sampling.
transformations for proportions: angular,
3 probit and logit transformations.
Outlying observations: box plot, M-
estimators. Test for normality - p-p plot
and q-q plot and Kolmogorov-Smirnov
test
Categorical Data Analysis: Categorical 7 Gives the idea about the methods of
response data, logistic regression-odds constructing unbiased estimators in survey
4
ratio, Wald’s statistic, logistic regression sampling.
and its diagnostics memory databases.
Repeated Measures ANOVA: One Way 8 Provides the concept of successive
and Two Classified Data, sampling and introduces some natural
5
Epidemiological study designs and its estimators.
analysis

Text Books:
1. Fundamentals of Biostatistics, ANE Books, India by Rastogi, V.B
Reference Books:
1. Biostatistical Analysis, Pearson by Jerrold H. Zar
2. Biostatistics: A Foundation for Analysis in the Health Sciences, 10th Edition by Daniel W.
W and CrossL. C
3. Biostatistics and Epidemiology – A Primer for Health and Biomedical professionals, 3rd Ed,
Springer by Sylvia Wasserthial and Smoller
 Course Format: MCD541
Course
Course Code Name of Course L T P Credit
Type
DE MCD541 GPU Computing 3 0 0 9

Course Objective
Understand GPU Architecture: CUDA Device, Grid, Blocks, threads, Steaming Multiprocessors (SMs),
Warps and Memory organization.
Learning Outcomes
Develop Parallel programming skills on the GPU with CUDA: Data-parallel programming for High
Performance Computing (HPC) and Optimize CUDA Application Programmes.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
GPU and CUDA programming 9 To understand GPU and CUDA
Architectures: Understanding Parallelism programming Architectures Parallelism.
with GPU, device memories and data To understand thread organization,
transfer, kernel functions. Threads, Blocks, synchronization.
1 Grid, Warps: thread organization,
synchronization and transparent scalability,
thread assignment, thread scheduling and
latency tolerance.
Memories: Importance of Memory Access 9 To know the concept of Memories and their
Efficiency, Shared Memory, Global Memory, Importance as a Limiting Factor to
Constant Memory and Texture Memory, a
Parallelism
Strategy for Reducing Global Memory Traffic,
2 Memory as a Limiting Factor to Parallelism, To understand Performance concepts.
Concepts of tiling. Performance
Considerations: More on Thread Execution,
Global Memory Bandwidth, Dynamic
Partitioning of SM Resources.
Floating Point Considerations: Floating-Point 7 To learn the basics of Floating-Point
Format, Representable Numbers, Special Bit Format, Representable Numbers. To
Patterns and Precision, Arithmetic Accuracy
understand the Arithmetic Accuracy and
and Rounding, Algorithm Considerations.
3 Streams and Multi GPU Solutions: Atomic Rounding concepts. To know the Streams
Operations, Single Stream, Multiple Streams, and Multi GPU Solutions concepts
GPU Work Scheduling, Zero-Copy Host
Memory, Portable Pinned Memory
General purpose GPU computing with 7 To learn General purpose GPU computing
PyCUDA and PyOpenCL: An overview of with PyCUDA and PyOpenCL.
4 OpenCL, Important OpenCL concepts and
Basic Program Structure, NumbaPro.
GPU Computing Applications- A Case 7 To apply the GPU Computing for in Case
Study in Machine Learning (8 Lectures): Study in Machine Learning.
5 Convolution Neural Networks, Convolution
Layer, Reduction of Convolution Layer to
Matrix Multiplication, cuDNN Library.
Text Books: 1. CUDA by Example: An Introduction to General-Purpose GPU Programming, by
Jason Sanders, Edward Kandrot, publisher Addison-Wesley Professional, 2010
Reference Books: 1. Programming Massively Parallel Processors: A Hands-on Approach by David B. Kirk,
Wen-mei W. Hwu, Elsevier, 2010
2. Hands-On GPU Programming with Python and CUDA: Explore high-performance parallel computing
with CUDA by Dr. Brian Tuomanen, Packt Publishing Ltd, 2018
 Course Format: MCD542
Course
Course Code Name of Course L T P Credit
Type
DE MCD542 Video Analytics 3 0 0 9

Course Objective
To provide exposure to theory as well as practical systems used in Video Analytics.
Learning Outcomes
The students will learn the how to use Video Analytics to analyse Image data.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction to Digital Image and Video 8 This unit will help students to understand
1 Processing, Background Modeling. basics Video processing.

Object Detection and Recognition, 9 This unit will help students to understand
Image and Motion Features, Multi Object Detection and Recognition, Image
2
Object Tracking. and Motion Features, Multi Object
Tracking.
Trajectory Analysis, Activities and 11 This unit will help students to get the
Events, Anomaly Detection, concept Trajectory Analysis, Activities and
Compressed Domain Video Analytics, Events, Anomaly Detection, Compressed
3
Multi Camera Surveillance, Camera Domain Video Analytics, Multi Camera
Coordination, Video Indexing Surveillance, Camera Coordination, Video
Indexing.
Mining and Retrieval. Deep learning for 11 This unit will help students to get the
Vision and Image Processing: CNN, concept of Mining and Retrieval. Deep
4 RNN, Vision and Language: Image learning for Vision and Image Processing:
captioning, Visual Q & A. CNN, RNN, Vision and Language: Image
captioning, Visual Q & A.

Text Books:
1. Richard Szeliski, Computer Vision: Algorithms and Applications, Springer 2010
Reference Books:
1. Forsyth, D.A., and Ponce, J., Computer Vision: A Modern Approach, Pearson Education,
2003
 Course Format: MCD543

Course
Course Code Name of Course L T P Credit
Type
DE MCD543 Missing data analysis in Survey Sampling 3 0 0 9

Course Objective
The aim of this paper is to teach the students about various techniques which deals with how to manage
with the incomplete survey data for providing the desired estimates
Learning Outcomes
The students will learn how to using missing data analysis techniques in Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Basics of survey sampling: sampling 3 Gives the idea about fundamentals of
1 frame, sampling design, basic principles survey sampling.
of survey sampling.
Types of sampling: Probability sampling 13 Gives the idea about important sampling
and non-probability sampling, schemes applicable in most of the practical
Probability sampling: Simple random situations.
2
sampling, Stratified random sampling,
Systematic sampling, Cluster and stage
sampling.
Use of auxiliary information at 8 Gives the methods of using the auxiliary
estimation stage, Ratio, product, information at estimation stage in survey
3
difference and regression methods of sampling.
estimation and their properties
Introduction of Missing data: Reasons 9 Gives the idea about handling the missing
and types of missing data; Techniques to data problems in survey sampling arise due
handle the missing data: Imputation to non-response.
4 method; Mean, Ratio and Regression
methods of imputations; Hansen and
Hurwitz (1946) technique

Sensitive variable; Randomized response 6 Gives the idea about tackle the problems of
techniques– Warner’s, Simmon’s and non-response in survey sampling when it
5
Two Stage response techniques. occurs due to sensitive nature of
characteristics.

Text Books:
1. Sampling Techniques, 3rd Ed, Wiley Eastern Ltd. by Cochran, W.G
Reference Books:
1. Sampling Theory of Surveys with Applications, IASRI New Delhi, 1984 Ed. by Sukhatme P
V., Sukhatme B. V. and Sukhatme S., and Ashok C
2. Sampling Theory and Methods, Statistical Publishing Society, Calcutta. by Murthy, M.N
3. Advanced Sampling – Theory with Applications, Kluwer Publications by Sarjinder Singh
4. Sampling Theory, Narosa Publications, New Delhi by Desraj and Chandhok P
 Course Format: MCD544

Course
Course Code Name of Course L T P Credit
Type
DE MCD544 Software Testing 3 0 0 9

Course Objective
The aim of this paper is to provide exposure to art of software testing
Learning Outcomes
Student will get an idea about how to generate test tools and how to automate the testing strategies.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction to Software Testing: 11 This unit will help students to understand
Fundamentals of Verification and fundamentals of Software Testing, concept
Testing, Review of software of Software Quality, different metrics
development models, Test Metrics,
related to software testing.
Software Testing Principles, Testing
1
and Debugging, Software Quality,
Requirement Behaviour and
Correctness, Fundamentals of Test
Process, The Tester’s Role in a
Software Development Organization
Static Testing: Structured examination, 6 This unit will help students to understand
2 Control flow & Data flow, Determining about Static testing techniques of Software.
Metrics.
Dynamic Testing: Black Box Testing, 6 This unit will help students to understand
3 Black Box Testing, Gray Box Testing, about Dynamic testing techniques of
Intuitive and Experience Based Testing. Software.
Test Management: Test Organization, 9 This unit will help students to get the
Test Planning, Test Strategies, Levels concept of Test Management: Test
of Testing, Testing Tools Automation Organization, Test Planning, Test
4
of Test Execution: Types of test Tools,
Strategies, Levels of Testing, Testing Tools
Selection and Introduction of Test
Tools. Automation.
Testing Object Oriented Software: 7 This unit will help students will learn about
Introduction to Object Oriented testing different methods about testing of Object
5 concepts, Differences in Object Oriented Software.
Oriented testing, testing Object
Oriented systems.

Text Books:
1. G. J. Myers, C. Sandler and T. Badgett, The Art of Software Testing, John Willey & Sons,
2015
Reference Books:
1. E. Dustin, T. Garrett and B. Gauf, Implementing Automated Software Testing: How to Save
Time and Lower Costs While Raising Quality, Pearson, 2009
2. L. Tamres, Introducing Software Testing, Pearson, 2002