INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-521 Course Title: Mathematics for Data Science

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Autumn 7. Subject Area: PCC
8. Pre-requisite: Nil
9. Objective: To introduce students to the various Mathematical concepts to be used in ML and DS.

10. Details of the Course

S.No. Contents Contact

hours
1. Basics of Linear Algebra: Representation of vectors; Linear dependence and 10
independence; vector space and subspaces (definition, examples and concepts of
basis); linear transformations; range and null space; matrices associated with linear
transformations; special matrices; eigenvalues and eigenvectors with
applications to data problems; Least square and minimum normed solutions
2. Matrices in Machine Learning Algorithms: projection transformation; orthogonal 4
decomposition; singular value decomposition; principal component analysis and
linear discriminant analysis
3. Gradient Calculus: Basic concepts of calculus: partial derivatives, gradient, 4
directional derivatives, Jacobian, Hessian.
4. Optimization: Convex sets, Convex function and their properties, Unconstrained 9
and Constrained Optimization, Numerical Optimization Techniques for
Unconstrained Optimization, Derivative-Free methods (Golden Section, Fibonacci
Search Method, Bisecting Method), Methods using Derivatives (Newton’s Method,
Steepest Descent Method), Penalty Function Methods for Constrained
Optimization.
5. Probability: Basic concepts of probability, conditional probability, total probability, 8
independent events, Bayes’ theorem, random variable, Moments, moment
generating functions, some useful distributions, Joint distribution, conditional
distribution, transformation of random variables, covariance, correlation.
6. Statistics: Random sample, sampling techniques, statistics, sampling distributions, 7
mixture models.
Total 42
11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1 M. P. Deisenroth, A. A. Faisal, C. S. Ong, Mathematics for 2020
Machine Learning, Cambridge University Press (1st edition)
2 S. Axler, Linear Algebra Done Right. Springer International Publishing 2015
(3rd edition)
3 J. Nocedal and S. J. Wright, Numerical Optimization. New York: 2006
Springer Science+Business Media
4 E. Kreyszig, Advanced Engineering Mathematics, John Wiley and 2015
Sons, Inc., U.K. (10th Edition)
5 R. A. Johnson, I. Miller, and J. E.Freund, "Miller & Freund’s 2011
Probability and Statistics for Engineers", Prentice Hall PTR, (8th
edition)
6 C. Mohan and K. Deep: “Optimization Techniques”, New Age 2009
Publishers, New Delhi.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-523 Course Title: Principles of Database Systems

2. Contact Hours: L: 3 T: 0 P: 2
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 10-25 PRS: 25 MTE: 15-25 ETE: 30-40 PRE: 0
5. Credits: 4 6. Semester: Autumn 7. Subject Area: PCC
8. Pre-requisite: Nil
9. Objective: To impart the knowledge of basic Data Base Management Systems.

10. Details of the Course

S.No. Contents Contact

hours
1. Purpose of Database System, Views of data, Data Models, Database Languages- 8
Database System Architecture, Database users and Administrator, Entity
Relationship model (E-R model ) – E-R Diagrams, Introduction to relational
databases.
2. The relational Model – The catalog types, Keys, Relational Algebra, Domain 10
Relational Calculus, Tuple Relational Calculus, Fundamental operations, Additional
Operations, SQL fundamentals - Integrity, Triggers, Security, Advanced SQL
features, Embedded SQL, Dynamic SQL, Missing Information, Views, Introduction
to Distributed Databases and Client/Server Databases.
3. PL/SQL- Basic and Advanced Concepts. 8
4. Functional Dependencies – Non-loss Decomposition, Functional Dependencies, 8
First, Second, Third Normal Forms, Dependency Preservation, Boyce-Codd Normal
Form, Multi-valued Dependencies and Fourth Normal Form – Join Dependencies and
Fifth Normal Form.
5. Transaction Concepts - Transaction Recovery, ACID Properties, System Recovery, 8
Media Recovery, Two Phase Commit, Save Points – SQL Facilities for recovery,
Concurrency, Need for Concurrency, Locking Protocols, Two Phase Locking, Intent
Locking, Deadlock, Serializability – Recovery Isolation Levels – SQL Facilities, for
Concurrency.
Total 42
11. List of Practical:

1 DDL and DML commands in SQL-I

2 DDL and DML commands in SQL-II
3 Query designing in SQL
4 Aggregate functions and sorting concepts on created tables
5 Single row operation functions
6 View and displaying data from multiple tables
7 Aggregating data using group functions
8 Designing query with concepts of sub-queries
9 Pl-SQL
10 To implement the concepts of security and privileged
11 Implementing transaction control commands

12. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1 M. P. Deisenroth, A. A. Faisal, C. S. Ong, Mathematics for 2020
Machine Learning, Cambridge University Press (1st edition)
2 S. Axler, Linear Algebra Done Right. Springer International Publishing 2015
(3rd edition)
3 J. Nocedal and S. J. Wright, Numerical Optimization. New York: 2006
Springer Science+Business Media
4 E. Kreyszig, Advanced Engineering Mathematics, John Wiley and 2015
Sons, Inc., U.K. (10th Edition)
5 R. A. Johnson, I. Miller, and J. E.Freund, "Miller & Freund’s 2011
Probability and Statistics for Engineers", Prentice Hall PTR, (8th
edition)
6 C. Mohan and K. Deep: “Optimization Techniques”, New Age 2009
Publishers, New Delhi.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

Subject Code: AID-505 Course Title: Machine Learning

1. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Autumn 7. Subject Area: PCC
8. Pre-requisite: Nil
9. Objective: To provide an understanding of the theoretical concepts of machine learning and prepare
students for research or industry application of machine learning techniques.

10. Details of the Course

S.No. Contents Contact

hours
1. Introduction: Well-posed learning problems, examples of machine learning
applications, model selection and generalization, concept learning, inductive 4
learning hypothesis, inductive bias. Information theory: entropy, mutual
information, KL divergence
2. Performance Optimization: Directional Derivatives, Minima, Necessary
Conditions for Optimality, Convex function, Gradient Descent, Stable learning rates, 4
Newtons Method, Conjugate gradient method, The Levenberg-Marquardt
algorithm.
3. Linear Classification: Linear classifier, Logistic Regression, Decision Boundary,
Cost Function Optimization, Multi-class Classification, Bias and Variance, L1 and L2 4
Regularization, feature reduction, Principal Component Analysis, Singular Value
Decomposition
4. Artificial Neural Networks: Perceptron, Linear Networks, Multi-layer Networks,
Forward propagation, Backward propagation, Alternative activation functions, 5
variations on backpropagation, Deep neural networks.
5. Decision tree learning: Decision tree representation, appropriate problems for
decision tree learning, hypothesis space search in decision tree learning, inductive 5
bias in tree learning, avoiding overfitting the data, alternative measures for selecting
attribute values, ensemble methods, bagging, boosting, random forest
6. Support Vector Machines: Computational learning theory, probably approximately
correct (PAC) learning, sample complexity and VC dimension, linear SVM, soft 5
margin SVM, kernel functions, nonlinear SVM, Multiclassclassification using SVM,
Support vector regression.
Instance based learning: K-nearest neighbor learning, distance weighted neighbor
7. learning, locally weighted regression, adaptive nearest neighbor methods, The 3
Concept of Unsupervised Learning, Competition networks, K-means clustering
algorithm.
 8. Bayesian Learning: Bayes theorem, maximum likelihood and least squared error
hypotheses, Naive Bayes classifier, Bayesian belief networks, gradient ascent 7
training of Bayesian networks, learning the structure of Bayesian networks, the EM
algorithm, mixture of models, Markov models, hidden Markov models.
9. Reinforcement learning: the learning task, Q learning, convergence, temporal
difference learning, nondeterministic rewards and actions, generalization, 5
relationship to dynamic programming.
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1. T. Mitchell, Machine Learning, McGraw Hill 1997
2. Christopher Bishop, Pattern Recognition and Machine Learning, 2006
Springer
3. K. Murphy. Machine Learning: A probabilistic perspective, MIT Press 2012
4. Hastie, Tibshirani, Friedman, Elements of statistical learning, Springer 2011
5. I. Goodfellow, Y. Bengio and A. Courville. Deep Learning. MIT Press 2016
6. Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An 2018
Introduction, MIT Press
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE
NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-525 Course Title: Data Structures and Algorithms

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Autumn 7. Subject Area: PCC
8. Pre-requisite: Nil
9. Objective: To introduce advanced concepts in data structures and algorithms

10. Details of the Course

S.No. Contents Contact

hours
1. Complexity Analysis: Time and Space complexity of algorithms, asymptotic 8
analysis, big O and other notations.
2. Linear Lists, Stacks and Queues, Hashing and Trees: Abstract data types, 12
sequential and linked implementations, equivalence problem, hash table, collision
avoidance, linear open addressing, chains, uses of hash tables, insertion, deletion
and search operations for sequential and linked lists, doubly linked lists, circular
lists, skip lists, applications of lists in bin sort, radix sort, sparse tables, Binary trees
and their properties, tree traversal methods and algorithms.
3. Algorithmic Techniques: Algorithm design strategies, divide and conquer, merge 12
sort, quick sort and its performance analysis, randomized quick sort, Strassen’s
matrix multiplication; Greedy method and its applications, knapsack problem;
Dynamic programming and its performance analysis, optimal binary search trees,
0/1 knapsack problem; Traveling salesman problem; Back-tracking, n-queens
problem; Branch and bound examples, 15-puzzle problem, 0/1 knapsack, traveling
salesman problem.
4. Graph Algorithms: DFS and BFS, spanning trees, bi-connectivity; Minimum cost 10
spanning trees: Kruskal’s, Prim’s and Sollin’s algorithms; Path finding and shortest
path algorithms; Topological sorting; Bipartite graphs. P and NP-classes, NP-hard
problems, reduction.
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication / Reprint
1. Wirth, N., “Algorithms and Data Structures”, Prentice-Hall of India. 2017
2. Brad Miller and David Ranum, Luther College, “Problem Solving 2013
with Algorithms and Data Structures Using Python,” Franklin, Beedle
&Associates.
3. Cormen T, Introduction to Algorithms, MIT Press, 3rd Edition. 2009
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence
1. Subject Code: AID-527 Course Title: Programming for DS
2. Contact Hours: L: 0 T: 0 P: 4
3. Examination Duration (Hrs.): Theory: 0 Practical: 2
4. Relative Weightage: CWS: 0 PRS: 50 MTE: 0 ETE: 0 PRE: 50
5. Credits: 2 6. Semester: Autumn 7. Subject Area: PCC
8. Pre-requisite: Nil
9. Objective: This course's objective is to provide hands-on experience on the various
programming components for Data Science.

10. Details of the Course:

S.No. Contents Contact

hours
1 Python: Basics, Numpy, Pandas, and Matplotlib 16
2 Scikit-Learn and NLTK 12
3 Tensor Flow and Keras 12
4 Tensor Flow Lite: Deploy machine learning systems on mobile (Android 16
application) (Android Studio, Kotlin/Java)
Total 56

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication / Reprint
Jake VanderPlas “Python Data Science Handbook,” First Edition, 2016
1
O'Reilly Media, Inc.
2 Wes McKinney “Python for Data Analysis: Data Wrangling with 2017
Pandas, NumPy, and I Python,” Second Edition, O'Reilly Media,
Inc.
3 Pramod Singh and Avinash Manure “Learn TensorFlow 2.0: 2020
Implement Machine Learning and Deep Learning Models with
Python,” First Edition, Apress
4 Aurélien Géron “Hands-On Machine Learning with Scikit-Learn, 2019
Keras, and TensorFlow,” Second Edition, O'Reilly Media, Inc.
5 Bill Phillips “Android Programming: The Big Nerd Ranch Guide,” 2017
Third Edition,Big Nerd Ranch Guide
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE
NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-571 Course Title: Big Data Analytics

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: The purpose of this course is to introduce the students with Big Data Storage Systems and
important algorithms that form the basis of Big Data Processing. The course also introduces the
students with major application areas of Big Data Analytics.

10. Details of the Course

S.No. Contents Contact

hours
1. Introduction to Big Data: Introduction to Big Data, The four dimensions of 6
Big Data: volume, velocity, variety, veracity, Drivers for Big Data, Introducing
the Storage, Query Stack, Revisit useful technologies and concepts, Real-time
Big Data Analytics
2. Distributed File Systems: Hadoop Distributed File System, Google File 6
System, DataConsistency
3. Big Data Storage Models: Distributed Hash-table, Key-Value Storage Model 10
(Amazon's Dynamo), Document Storage Model (Facebook's Cassandra), Graph
storage models
4. Scalable Algorithms: Mining large graphs, with focus on social networks and 10
web graphs. Centrality, similarity, a 11-distances sketches, community
detection,1 ink analysis, spectral techniques. Map-reduce, Pig Latin, and
NoSQL, Algorithms for detecting similar items, Recommendation systems,
Data stream analysis algorithms,Clustering algorithms, Detecting frequent items
5. Big Data Applications: Advertising on the Web, Web Page Quality Ranking, 6
Mining Social-Networking Group, Human Interaction with Big-Data.
Recommendation systems with case studies of Amazon's, Item-to-item
recommendations and Netflix Prize, Link Analysis with case studies of the
PageRankalgorithm and the spam farm analysis, Crowdsourcing
6. Big Data Issues: Privacy, Visualization, Compliance and Security, Structured 4
vs Unstructured Data
Total 42
11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication / Reprint
1. Ohlhorst, Frank J. Big data analytics: turning big data into big 2012
money. Vol. 65. John Wiley & Sons, 2012.
2. Russom, Philip. "Big data analytics." TDWI best practices report, 2011
fourthquarter 19, no. 4 (2011): 1-34.
3. Marr, Bernard. Big Data: Using SMART big data, analytics and 2015
metrics to make better decisions and improve performance. John
Wiley & Sons, 2015.
4. LaValle, Steve, Eric Lesser, Rebecca Shockley, Michael S. 2011
Hopkins, and Nina Kruschwitz. "Big data, analytics and the
path from insights to value." MIT sloan management review 52,
no. 2 (2011): 21-32.
5 Leskovec, Jure, Anand Rajaraman, and Jeffrey David Ullman. 2020
Mining of massive data sets. Cambridge university press, 2020.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Department of Computer Science and Engineering

1. Subject Code: CSN-515 Course Title: Data Mining and Warehousing

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Spring 7. Subject Area: PEC
8. Pre-requisite: CS-102
9. Objective: To educate students to the various concepts, algorithms and techniques in data mining and
warehousing and their applications.

10. Details of the Course

S.No. Contents Contact

hours
1. Introduction to data mining: Motivation and significance of data mining, data 3
mining functionalities, interestingness measures, classification of data mining
system, major issues in data mining.
2. Data pre-processing: Need, data summarization, data cleaning, data integration 6
and transformation, data reduction techniques —Singular Value Decomposition
(SVD), Discrete Fourier Transform (DFT), Discrete Wavelet Transform (DWT),
data discretization and concept hierarchy generalization.
3. Data warehouse and OLAP technology: Data warehouse definition, 4
multidimensional data model(s), data warehouse architecture, OLAP server types,
data warehouse implementation, on-line analytical processing and mining,
4. Data cube computation and data generalization: Efficient methods for data 4
cube computation, discovery driven exploration of data cubes, complex
aggregation, attribute oriented induction for data generalization.
5. Mining frequent patterns, associations and correlations: Basic concepts, 6
efficient and scalable frequent item set mining algorithms, mining various kinds
of association rules —multilevel and multidimensional, association rule mining
versus correlation analysis, constraint based association mining.
6. Classification and prediction: Definition, decision tree induction, Bayesian 6
classification, rule based classification, classification by backpropagation and
support vector machines, associative classification, lazy learners, prediction,
accuracy and error measures.
7. Cluster Analysis: Definition, Clustering Algorithms - partitioning, hierarchical, 6
density based, grid based and model based; Clustering high dimensional data,
constraint based cluster analysis, outlier analysis - density based and distance
based.
8. Data mining on complex data and applications: Algorithms for mining of 7
spatial data, multimedia data, text data: data mining applications, social impacts
of data mining, trends in data mining.
Total 42
11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/ Reprint
1. Marakas, George M. Modern data warehousing, mining, and 2003
visualization: core concepts. Upper Saddle River, NJ: Prentice
Hall, 2003.
2. Pujari, Arun K. Data mining techniques. Universities press, 2001. 2001
3. Lee, Mong Li, Hongjun Lu, Tok Wang Ling, and Yee Teng Ko. 1999
"Cleansing data for mining and warehousing." In International
Conference on Database and Expert Systems Applications, pp.
751-760. Springer, Berlin, Heidelberg, 1999.
4. Wang, John, ed. Encyclopedia of data warehousing and mining. iGi 2005
Global, 2005.
5. Gupta, Gopal K. Introduction to data mining with case studies. PHI 2014
Learning Pvt. Ltd., 2014.
6. Tan, Pang-Ning, Michael Steinbach, and Vipin Kumar. 2016
Introduction to data mining. Pearson Education India, 2016.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence
1. Subject Code: AID-552 Course Title: Deep Learning
2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Machine Learning
9. Objective: The objective of this course is to learn deep learning algorithms, concepts,
experiments, research along with their application on generic use cases.
10. Details of the Course:

S.No Contents Contact

Hours
1 Introduction to deep learning, logical computations with neurons, perceptron, 6
backpropagation, historical trends, applications, and use-cases for industry
2 Deep Networks: Training a deep neural network (DNN), hidden layers, activation 7
functions, fine-tuning neural network hyper-parameters
3 Custom Deep Neural Networks: vanishing/exploding gradient issues, reusing pre 8
trained layers, optimizers, l1 and l2 regularization, dropout
4 Convolutional neural networks (CNNs): convolutional layer, filters, stacking, 7
pooling layer, CNN architectures
5 Recurrent neural networks (RNNs): recurrent neurons, unrolling, input and output 7
sequences, training RNNs, deep RNNs, LSTM cell, GRU cell
6 Representation Learning and Generative Learning: Autoencoders: data 7
representations, linear autoencoder, stacked autoencoders, variational
autoencoders
Total 42
11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1 Aurélien Géron, “Hands-On Machine Learning with Scikit-Learn, 2019
Keras, and TensorFlow: Concepts, Tools, and Techniques to Build
Intelligent Systems,”Second Edition, O'Reilly Media
2 Ian Goodfellow, Yoshua Bengio, and Aaron Courville, “Deep 2017
Learning,” First Edition, MIT Press
3 François Chollet “Deep Learning with Python,” First Edition, 2018
Manning Publication
4 Rowel Atienza “Advanced Deep Learning with Keras,” First Edition, 2018
Packt Publishing
5 Sudharsan Ravichandran “Hands-On Deep Learning Algorithms with 2019
Python,” First Edition, Packt Publishing
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE
NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-572 Course Title: Ethics in Data Science

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration(Hrs): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To introduce the concepts of ethics in data science
10. Details of the Course:

S.No. Contents Contact

Hours
1 Introduction and Philosophical frameworks for assessing fairness: 6
Foundations of ethics, early theories of fairness (Utilitarianism etc.);
contemporary theories of fairness; significance of ethics in data science; ethics
vs. law/compliance/public relations; cultural relativism; “professional” ethics
in data science; individuals vs. collectives.
2 Research Ethics: Data driven research, methods of collection of data; 8
different types of data: qualitative and quantitative; overview of ethical issues
in data-driven organizations; doing ethical data analysis; responsible use of
research data; plagiarism; fake data and fabrication of data; creation of data
base.
3 Data ownership, privacy and anonymity: Understanding the difference 8
between data ownership; data privacy and data anonymity; under- standing the
idea behind data surveillance; data privacy vs. data security.
4 Algorithmic fairness: Discrimination and algorithms; obscure and un- 8
intentional bias displayed by the algorithms; ethics of data scraping and
storage; Mosaic data; found data; and designed data.
5 Policies on data protection: EU’s general data protection rules (GDPR); 8
digital India policy; personal data protection bill; 2019 (“PDP Bill”); ethical
issues on data privacy in context with India, case studies.
6 Case Studies 4
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1. Michael J. Quinn “Ethics for the Information Age”, 2016
Seventh Edition, Pearson.
2. DJ Patil, Hilary Mason, and Mike Loukides “Ethics and Data 2018
Science”, O’Reilly Media Inc.
3. Bill Franks, “97 Things About Ethics Everyone in Data Science 2020
Should Know”, O’Reilly Media Inc.
4. Kord Davis, “Ethics of Big Data: Balancing Risk and 2012
Innovation”, O’Reilly Media Inc.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Department of Mathematics

1. Subject Code: MAN-628 Course Title: Evolutionary Algorithms

2. Contact Hours: L: 3 T: 0 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 3 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To provide knowledge about basic concepts of Evolutionary Algorithms
10. Details of the Course:

S.No. Contents Contact

Hours
1 Genetic Algorithms: Historical development, GA concepts – encoding, fitness 12
function, population size, selection, crossover and mutation operators, along
with the methodologies of applying these operators. Binary GA and their
operators, Real Coded GA and their operators
2 Particle Swarm Optimization: PSO Model, global best, Local best, velocity 10
update equations, position update equations, velocity clamping, inertia weight,
constriction coefficients, synchronous and asynchronous updates, Binary PSO.
3 Memetic Algorithms: Concepts of memes, Incorporating local search as 5
memes, single and multi-memes, hybridization with GA and PSO, Generation
Gaps, Performance metrics.
4 Differential Evolution: DE as modified GA, generation of population, 5
operators and their implementation.
5 Artificial Bee Colony: Historical development, types of bees and their role in 5
the optimization process.
6 Multi-Objective Optimization: Linear and nonlinear multi-objective 5
problems, convex and non – convex problems, dominance – concepts and
properties, Pareto – optimality, Use of Evolutionary Computations to solve
multi objective optimization, bi level optimization, Theoretical Foundations
Total 42
11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1. Coello, C. A., Van Veldhuizen, D.A. and Lamont, G.B.: 2002
“Evolutionary Algorithms for solving Multi Objective Problems”,
Kluwer.
Deb, K.: “Multi-Objective Optimization using Evolutionary
2 Algorithms”, John Wiley and Sons. 2002
Deb, K.: “Optimization for Engineering Design Algorithms and
3 1998
Examples”, Prentice Hall of India.
Gen, M. and Cheng, R.: “Genetic Algorithms and Engineering Design”,
4 1997
Wiley, New York.
5 Hart, W.E., Krasnogor, N. and Smith, J.E. : “Recent Advances in 2005
Memetic Algorithms”, Springer Berlin Heidelberg, New York.
Michalewicz, Z.: “Genetic Algorithms+Data structures=Evolution
6 Programs”, Springer-Verlag, 3rd edition, London, UK. 1992
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-573 Course Title: Intrusion Detection Systems

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To introduce concepts in intrusion detection systems
10. Details of the Course

S.No. Contents Contact

hours
1. Introduction to IDS: Intruder types, intrusion methods, processes and detection, 8
message integrity and authentication, honey pots
2. IDS Models: General IDS model and taxonomy, data mining based IDS, Denning 8
model, Framework for constructing features, and different models for intrusion
detection systems, SVM, probabilistic, and statistical modelling, evaluation of IDS,
cost sensitive IDS
3. Network Security Threat Detection: NBAD, specification based and rate based 9
DDOS, scans/probes, predicting attacks, network based anomaly detection, stealthy
surveillance detection; defending against DOS attacks in scout, signature-based
solutions, snort rules
4. Host based Threat Detection: Host-based anomaly detection, taxonomy of 9
security flaws in software, self-modelling system calls for intrusion detection with
dynamic window size
5. Secure Intrusion Detection Systems: Network security, secure intrusion detection 8
environment, secure policy manager, secure IDS sensor, alarm management,
intrusion detection system signatures, sensor configuration, signature and intrusion
detection configuration, IP blocking configuration, intrusion detection system
architecture.
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication / Reprint
1. J. Paul Guyer, “An Introduction to Intrusion Detection Systems,” 2017
Create space Independent Publishers
2. Gerard Blokdyk, “Intrusion-detection System: How-to,” Create space 2017
Independent Publishers.
3. Rash, M., Orebaugh, A. and Clark, G., “Intrusion Prevention and 2005
Active Response: Deploying Network and Host IPS,” Syngress.
4. Endorf, C., Schultz E. and Mellander J., “Intrusion Detection and 2003
Prevention,” McGraw-Hill.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Department of Computer Science and Engineering

1. Subject Code: CSN-528 Course Title: Natural Language Processing

2. Contact Hours: L: 3 T: 0 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 3 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Basic knowledge of Artificial Intelligence
9. Objective: To provide an understanding of the theoretical concepts of Natural Language Processing
and prepare students for research or industry application of Natural Language Processing.

10. Details of the Course

S.No. Contents Contact

hours
1. Introduction to NLP, Corpus, Representation of Words, Preprocessing, Linguistic 6
and Statistical Properties of Words, POS Tagging, Parsing, Performance
Measures, Error Analysis, Confusion Matrix
2. Probability and NLP, n-Gram, Language Model, Join and Conditional 6
Probability, Chain Rule, Markov Assumption, Data Sparsity, Smoothing
Techniques, Generative Models, Naive Bayes
3. Distributed representation of words for NLP, Co-occurrence Matrix, 6
Collocations, Dimensionality Reduction, Singular Value Decomposition
4. Document Similarity, Inverted Index, Word2Vec, C-BoW, Skip-Gram Model, 6
Sampling, Hierarchical Soft-max, Sequence Learning
5. Neural Networks for NLP, Multi-Layer Perceptron, Activation Function, 6
Gradient Descent, Sequence Modeling, Recurrent Neural Networks
6. Gated Recurrent Unit, Long-Short Term Memory Networks, 1-D Convolutional 6
Layer, Language Model using RNN, Forward Pass, Backward Pass
7. Applications of NLP, Topic Modeling, Sentiment Analysis, Query Processing, 6
ChatBoat, Machine Translation, Statistical Machine Translation, Neural Machine
Translation, Spell Checker, Summarization
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication / Reprint
1. Manning, Christopher, and Hinrich Schutze. Foundations of 1999
statistical natural language processing. MIT press, 1999.
2. Jurafsky, Dan. Speech & language processing. Pearson Education 2000
India, 2000.
3. Smith, Noah A. Linguistic structure prediction. Morgan and 2011
Claypool, 2011.
4. Kennedy, Graeme. An introduction to corpus linguistics. 2014
Routledge, 2014.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Department of Mathematics

1. Subject Code: MAN-613 Course Title: Operations Research

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To acquaint the students with the basic techniques of Operations Research.
10. Details of the Course:

S.No. Contents Contact

Hours
1 Basics of LPP: Different Types of OR Models, Convex Sets, Graphical Method, 11
Simplex Method, Big –M Method, Two Phase Method, Revised Simplex
Method.
2 Duality Theory: Dual Simplex Method, Sensitivity Analysis, Parametric Linear 9
Programming.
3 Integer Program: Cutting Plane and Branch and Bound Techniques for all Integer 5
and Mixed Integer Programming Problems
4 Transportation Problems: Transportation Problems and Assignment 5
Problems.
5 Game Theory: Graphical Method and Linear Programming Method for 5
Rectangular Games, Saddle point, notion of dominance.
6 Queuing Theory: Steady -state solutions of Markovian Queuing Models: M/M/1, 7
M/M/1 with limited waiting space, M/M/C, M/M/C with limited space, M/G/1,
Inventory Models.
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1. Mohan, C. and Deep, K.: “Optimization Techniques”, New Age 2009
India Pvt. Ltd, New Delhi.
Mittal, K.V. and Mohan, C.: “Optimization Methods in System
2. Analysis and Operations Research”, New Age India Pvt. Ltd, New 1996
Delhi.
3. Taha, H.A.: “Operations Research: An Introduction”, MacMillan 2013
Pub Co., NY, Ninth Edition (Reprint).
Ravindran, A., Phillips, D.T. and Solberg, J.J.: “Operations
4 Research: Principles and Practice”, John Wiley and Sons, NY, 2012
Second Edition (Reprint).
5 Pant, J.C.: “Introduction to Optimization/ Operations Research”, 2012
Jain Brothers, New Delhi, Second Edition.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-554 Course Title: Reinforcement Learning

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: This course aims to understand several reinforcement learning algorithms and their
applications, along with emerging research trends.

10. Details of the Course:

S.No. Contents Contact

Hours
1 Basics of probability and linear algebra, Definition of a stochastic multi-armed 6
bandit, Definition of regret, Achieving sublinear regret, UCB algorithm, KL- UCB,
Thompson Sampling.
2 Markov Decision Problem, policy, and value function, Reward models (infinite 8
discounted, total, finite horizon, and average), Episodic & continuing tasks,
Bellman's optimality operator, and Value iteration & policy iteration
3 The Reinforcement Learning problem, prediction and control problems, Model- 8
based algorithm, Monte Carlo methods for prediction, and Online implementation
of Monte Carlo policy evaluation
4 Bootstrapping; TD(0) algorithm; Convergence of Monte Carlo and batch 6
TD(0) algorithms; Model-free control: Q-learning, Sarsa, Expected Sarsa.
5 n-step returns; TD(λ) algorithm; Need for generalization in practice; Linear 6
function approximation and geometric view; Linear TD(λ).
6 Tile coding; Control with function approximation; Policy search; Policy 8
gradient methods; Experience replay; Fitted Q Iteration; Case studies.
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/ Reprint
Sutton, Richard S., and Andrew G. Barto. “Reinforcement learning: An
1 2020
introduction,” First Edition, MIT press
2 Sugiyama, Masashi. “Statistical reinforcement learning: modern 2015
machine learning approaches,” First Edition, CRC Press
3 Lattimore, T. and C. Szepesvári. “Bandit algorithms,” First Edition, 2020
Cambridge University Press.
4 Boris Belousov, Hany Abdulsamad, Pascal Klink, Simone Parisi, and 2021
Jan Peters “Reinforcement Learning Algorithms: Analysis and
Applications,”First Edition, Springer
5 Alexander Zai and Brandon Brown “Deep Reinforcement Learning in 2020
Action,” First Edition, Manning Publications
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE
NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-574 Course Title: Spreadsheet Modeling and Simulation

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To introduce the concept of spreadsheet modelling and simulations to the students.
10. Details of the Course:

S.No. Contents Contact

Hours
1 Introduction: Introduction to spreadsheets; historical development; basic 6
capabilities of spreadsheets and their usage for creating models; types of
data used in spreadsheets; spreadsheet notations for mathematical
operations; common built-in formulas and functions; conditional
expressions; relative and absolute references.
2 Model building: Designing spreadsheets reflecting assumptions; decision 10
variables; and outcomes, creating basic cash-flow models; revaluating
small business opportunities; incorporating what-if analysis; identifying
key variables using sensitivity analysis; linear programming models and
deterministic models.
3 Optimization with Spreadsheets using Solver: Linear programming, 12
sensitivity analysis, transportation and assignment problems, network
optimization problems, integer and nonlinear programming, multi-objective
optimization, applications of optimization in different areas.
4 Simulation and Optimization: Use of spreadsheets to implement Monte 10
Carlo simulations and linear programs for optimization; model uncertainty
and risk in spreadsheets; and use of Excel's solver.
5 Case Studies 4
Total 42
11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint

1. Hillier and Hillier “Introduction to Management Science: 2013

A Modeling and Case Studies Approach with
Spreadsheets”, McGraw-Hill/Irwin.
2. Cliff Ragsdale “Spreadsheet Modeling and Decision Analysis: 2018
A Practical Introduction to Business Analytics”, Cengage India.
3. Barry Render, Nagraj Balakrishnan, and Ralph Stair, 2004
“Managerial Decision Modelling with Spreadsheets”, Pearson.
4. S. Christian Albright and Wayne Winston “Spreadsheet 2004
Modeling and Applications: Essentials of Practical
Management Science”,Cengage.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Department of Mathematics

1. Subject Code: MAN-526 Course Title: Soft Computing

2. Contact Hours: L: 3 T: 0 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 3 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To acquaint the students with the basic techniques of Soft Computing.
10. Details of the Course:

S.No. Contents Contact

Hours
1 Introduction to Soft Computing, Historical Development, Definitions, 2
advantages and disadvantages, solution of complex real life problems
2 Neural Networks: Fundamentals, Neural Network Architectures, Feedforward 10
Networks, Backpropagation Networks.
3 Fuzzy Logic: Fuzzy Sets, Fuzzy numbers, Fuzzy Systems, membership 8
functions, fuzzification, defuzzification.
4 Genetic Algorithms: Generation of population, Encoding, Fitness Function, 10
Reproduction, Crossover, Mutation, probability of crossover and probability
of mutation, convergence.
5 Hybrid Systems: Genetic Algorithm based Backpropagation Network, Fuzzy– 7
Backpropagation, Fuzzy Logic Controlled Genetic Algorithms. Case studies.
6 Case studies in Engineering 5
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1. Jang, J-S. R., Sun,C-T, Mizutani, E.: “Neuro–Fuzzy and Soft 2002
Computing”, Prentice Hall of India.
2. Klir, G. J. and Yuan, B.: "Fuzzy Sets and Fuzzy Logic: Theory and
Applications", Prentice Hall. 1995
3. Rajasekaran, S. and Vijayalakshmi Pai, G.A.: “Neural Networks, 2003
Fuzzy Logic and Genetic Algorithms: Synthesis and Applications”,
Prentice Hall of India.
4 Sinha, N.K. and Gupta, M. M. : “Soft Computing and Intelligent 2000
Systems - Theory and Applications”, Academic Press.
5 Tettamanzi, A., Tomassini, M.: “Soft Computing: Integrating 2001
Evolutionary, Neural, and Fuzzy Systems”, Springer.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Department of Mathematics

1. Subject Code: MAN-507 Course Title: Statistical Inference

2. Contact Hours: L: 3 T: 0 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 3 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To introduce the concepts of statistical inference.
10. Details of the Course

S.No. Contents Contact

hours
1. Principle of Data Reduction: Sufficiency principle, Factorization criterion, 8
minimal sufficiency, Completeness and bounded completeness, Likelihood
principle, Equivariance principle.
2. Theory of Estimation: Basic concepts of estimation, Point estimation, methods of 12
estimation; method of moments, method of maximum likelihood; Unbiasedness,
Minimum variance estimation, Cramer – Rao bound and its generalization, Rao
Blackwell theorem, Existence of UMVUE estimators. Interval Estimation, Some
results for normal population case.
3. Testing of Hypothesis: Null and alternative hypothesis, Type I and II errors error 18
probability and power function, Method of finding tests, Neyman – Pearson lemma,
Uniformly most powerful tests, Likelihood ratio principle, Likelihood ratio test,
Sequential probability ratio test, Some results based on normal population.
4. Analysis of Variance: one- way classification; simple linear regression analysis 4
with normal distribution.
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/ Reprint
1. Miller, I. and Miller, M.,"Freund’s Mathematical Statistics with 2006
Applications", Prentice Hall PTR, 7th edition
2. Lehman, E.L., "Testing of Statistical Hypothesis", Wiley Eastern Ltd 1959
3. G. Casella, R. L. Berger, "Statistical Inference", Duxbury Press 2002
4. Lehman, E.L., "Point Estimation", John Wiley & sons 1984
5. Rohatgi, V.K., "Statistical Inference", Dover Publications 2011
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE
NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence
1. Subject Code: AID-555 Course Title: Time Series Data Analysis
2. Contact Hours: L:3 T:1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: The objective of this course is to understand and analyze time-series data facilitated
by R programming

10. Details of the Course:

S.No. Contents Contact

Hours
1 Basic Properties of time-series data: Distribution and moments, Stationarity, 4
Autocorrelation, Heteroscedasticity, Normality
2 Autoregressive models and forecasting: AR, ARMA, ARIMA models 4
3 Random walk model: Non-stationarity and unit-root process, Drift and Trend 4
models
4 Regression analysis with time-series data using R programming 5
5 Principal Component Analysis (PCA) and Factor Analysis 5
6 Conditional Heteroscedastic Models: ARCH, GARCH. T-GARCH, BEKK- 6
GARCH
7 Introduction to Non-linear and regime-switching models: Markov regime- 5
switching models, Quantile regression, Contagion models
8 Introduction to Vector Auto-regressive (VAR) models: Impulse Response 5
Function (IRF), Error Correction Models, Co-integration
9 Introduction to Panel data models: Fixed-Effect and Random-Effect models 4
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication /Reprint
Chris Brooks “Introductory Econometrics for Finance,” Fourth
1 2019
Edition, Cambridge University Press
2 Ruey S. Tsay “Analysis of Time-series data,” Third Edition, Wiley 2014
3 John Fox and Sanford Weisberg “An R Companion to Applied 2018
Regression,” Third Edition, SAGE
4 Yves Croissant and Giovanni Millo “Panel Data Econometrics with 2018
R,” First Edition, Wiley
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-575 Course Title: Blockchain Technology

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To provide knowledge about cryptographic and cybersecurity concepts of blockchain
technology with some applications.

10. Details of the Course

S.No. Contents Contact

hours
1. Basics of Blockchain: Distributed Database, Two General Problem, Byzantine 5
General problem and Fault Tolerance, Hadoop Distributed File System, Distributed
Hash Table, ASIC resistance, Turing Complete
2. Crypto Primitives: Hash functions, security aspects of hash function, Collison 8
resistant hash, digital signatures, public key cryptography, verifiable random
functions, NIST standards
3. Blockchain Theory: Advantage over conventional distributed database, 8
Blockchain Network, Mining Mechanism, Distributed Consensus, Merkle Patricia
Tree, Gas Limit, Transactions and Fee, Anonymity, Reward, Chain Policy, Life of
Blockchain application, Soft & Hard Fork, Private and Public blockchain.
3. Distributed Consensus: Nakamoto consensus, Proof of Work, Proof of Stake, 6
Proof of Burn, Difficulty Level, Sybil Attack, Energy utilization and alternate
4. Cryptocurrency and regulations: Distributed Ledger, Bitcoin protocols - Mining 10
strategy and rewards, Ethereum - Construction, DAO, Smart Contract, GHOST,
Vulnerability, Attacks, Sidechain, Namecoin, IBM hyper ledger, Stakeholders,
Roots of Bitcoin, Legal Aspects - Cryptocurrency Exchange, Black Market and
Global Economy
5. Blockchain Applications: Good blockchain examples and how to identify 5
potential use-cases, Design Thinking, Internet of Things, Medical Record
Management System, Domain Name Service
Total 42
11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication / Reprint
1. Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller 2016
and Steven Goldfeder, Bitcoin and Cryptocurrency Technologies: A
Comprehensive Introduction, Princeton University Press
2. Bettina Warburg, Bill Wanger, Tom Serres, “Basics of Blockchain ” 2019
Independently published
3. Andreas M. Antonopoulos, “Mastering Bitcoin: unlocking digital 2014
cryptocurrencies”, O'Reilly Media Inc.,
4. Wattenhofer, Roger, “Blockchain Science”, Inverted Forest 2019
Publishing, 3rd Edition
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-568 Course Title: ML and AI Applications in Earth Sciences

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Good foundation in Mathematics and Physics with specific exposure in Numerical
Methods. Understanding of fundamental principles of Geology and Geophysics would be preferable.

9. Objective: To make the participants familiar with tools and techniques in Earth Sciences and the use of
Machine Learning and Artificial Intelligence for optimizing the workflows for more accurate prediction
of events and properties of the subsurface.

10. Details of the Course:

S.No. Contents Contact

Hours
1 Familiarization with Major Domains and Data Types in Earth Sciences: 4
Earthquake Seismology, Engineering Geology and Rock Mechanics, Reservoir
Characterization, Paleontology
2 General Introduction to ML and AI in Earth Sciences: 6
ML and statistical pattern recognition: Supervised learning (generative/ descriptive
learning, parametric/ non-parametric learning, neural networks, Support vector
machines), Unsupervised learning (clustering, dimensionality reduction, kernel
methods); time series modelling, linear regression, regularization, linear classifiers,
ensemble methods, neural networks, model selection and evaluation, scalable
algorithms for big data, and data ethics.
Data science: Extreme value statistics, multi-variate analysis, factor analysis,
compositional data analysis, spatial information aggregation models, spatial estimation,
geo-statistical simulation, treating data of different scales of observation, spatio-
temporal modelling (geo-statistics).
3 Automating Data Mining and Analysis in Seismology: Basics of earthquake 6
detection and phase picking using short-term average (STA)/long-term average (LTA);
detection using waveform similarity: Network Matched Filtering/template matching,
Fingerprint And Similarity Thresholding (FAST). Associating seismic phases across all
stations using deep-learning techniques and combining the ones have the same origin
source (PhaseLink). Generic workflow of data collection, preprocessing, model
training, model evaluation, and production. Applications of ML in ground motion
synthesis, and future directions.
4 Classification of Earthquake Sources: Using supervised learning for classifying 4
earthquakes and finding their occurrence mechanism. Training dataset (waveforms) on
different kinds of sources: earthquake, glacial, volcanic, landslide, explosion, etc. A
brief discussion on seismic sources and radiation pattern of emerging waves.
5 Deep learning (DL) based Seismic Inversion: Theory of Seismic Inversion, 4
Convolutional neural network (CNN) and fully connected network (FCN) architectures,
Performance evaluation, Geophysical inversion versus ML, their applications to
reflectivity inversion in seismic, Numerical examples.
 6 Automation in 3D Reservoir Property Prediction: Data Mining, Automated 4
Petrophysics, Statistical and Regression Methods for Elastic Property Prediction, ML
and AI application in Geostatistics, Convoluted Neural Networks for Seismic
Interpretation, Deep Learning for Impedance Inversion and Porosity Prediction.
7 Data-Driven Analytics in Shale Resources: Concepts of shale as source-reservoir- 4
seal, Modeling Production from Shale, Shale Analytics, Decline Curve Analysis, Shale
Production Optimization Technology (SPOT), Numerical Simulation and Smart Proxy
8 Machine learning Applications in Engineering Geology and Rock Mechanics: ML 6
in rock mass characterization, Rock Mass Rating, Slope Mass Rating, Q-System,
Engineering properties of rock and various rock engineering applications, AI in
Landslides study.
9 Separation and Taxonomic Identification of Microfossil: 3D object recognition and 4
segmentation applied to X-ray MicroCT images; Testing different algorithms for
identifying and localizing individual microfossils in rock samples: Automated
Computer Vision, Deep learning-based CNN semantic, and other segmentation
architectures.
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publications/ Reprint
1 Patrick Wong, Fred Aminzadeh, and Masoud Nikravesh, Soft 2002
Computing for Reservoir Characterization and Modeling, Springer-
Verlag Berlin Heidelberg GmbH
2 William Sandham & Miles Leggett, Geophysical Applications of 2003
Artificial Neural Network and Fuzzy Logic, Springer
3 C. Cranganu, H. Luchian, M. E. Breaban, Artificial Intelligent 2015
Approached in Petroleum Geosciences, Springer
4 Shahab D. Mohaghegh , Data-Driven Analytics in Unconventional 2017
Resources, Springer
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-576 Course Title: Data Science in Bioinformatics

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: The course provides exposure to the Data Science within the context of its importance in
biology. The course discusses various methodologies and techniques as well as relevant problems in
biology addressed using Data Science.

10. Details of the Course

S.No. Contents Contact

hours
1. Relevance of Data Science in Bioinformatics. Why Data Science in Biology and 7
Healthcare? Visualization tools for biological and bioinformatics datasets; data
handling; transformations of data
2. Data Science in genomics. From genetics to genomes. Alignment and 7
phylogenetic trees.
3. Structural bioinformatics, Proteomics, Protein structure prediction, integrative 7
structural modeling, and structure-based drug design.
4. AI algorithms, statistical tools, graph algorithms for bioinformatics data analytics 7
5. Deep learning algorithms in perspective of bioinformatics applications; GANs 7
for biological applications
6. Whole-cell modeling approaches, Big Data Consortiums; Hands-on experience 7
ofapplying Data Science in Biology
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication / Reprint
1. Arthur M. Lesk, “Introduction to Bioinformatics”, Oxford University 2019
Press) (Fifth Edition)
2. Jeil Grus, “Data Science from Scratch: First Principles with Python”, 2019
O’Reilly Media Inc. (Second Edition,)
3. Vince Buffalo, “Bioinformatics Data skills”, O’Reilly Media Inc. 2015
4. Neil C. Jones and Pavel A. Pevzner, “An introduction to 2004
Bioinformatics Algorithms”, The MIT Press
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE
NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-577 Course Title: Data Science for Decision Making
2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To introduce the concept of data driven decision making systems to the students.
10. Details of the Course:

S.No. Contents Contact

Hours
1 Fundamentals of Analytics: Introduction to data-driven decision 8
making; general introduction to data driven strategy and its importance;
use of examples and mini-case studies to illustrate the role of statistical
analysis in decision making.
2 Basic Data Analysis: Various types of data that are commonly collected 10
by firms; methods to be used and inferences/insights that can be
obtained depending on the type of data that are available (stated versus
revealed preference, level of aggregation, cross- sectional, time series,
panel data and so forth); use of frequency distributions, mean
comparisons, and cross tabulation; statistical inferences using chi-
square; t-test and ANOVA.
3 Experimental Design and Natural Experiments: Issues of design of 10
experiments and internal and external validity; case studies in marketing;
economics; and medicine etc.; A-B testing; and circumstances that
provide us with “natural” experiments.
4 Decision making tools: Regression analysis and its applications; use of 10
regression output in forecasting; promotional planning and optimal pricing;
multivariate analysis (unsupervised learning) cluster analysis; factor
analysis decision trees; elastic nets and random forests.
5 Case Studies: To understand the problem at an intuitive level; use of simple 4
data analysis and visualization to verify (or falsify) the intuition; use of
appropriate statistical analysis to present your arguments.
Total 42
11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1. F.S. Hillier and G.J. Liberman “Introduction to 2001
Operations Research” Tata McGraw Hill Education Private
Limited.
2. Gregory S. Parnel, Terry A. Bresnick, Steven N. Tani, Eric 2013
R.Johnson “Handbook of Decision Analysis”, Wiley.
3. Emily Moberg and Igor Linkov “Multi-Criteria Decision 2011
Analysis: Environmental Applications and Case Studies”,
CRCPress, Taylor and Francis group.
4. Adiel Teixeira de Almeida, Emel Aktas, Sarah Ben Amor, 2020
João Luis de Miranda “Advanced Studies in Multi-Criteria
Decision Making“, CRC Press.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE
NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence
1. Subject Code: AID-562 Course Title: AI for Investment
2. Contact Hours: L: 3 T: 0 P: 2
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 10-25 PRS: 25 MTE: 15-25 ETE: 30-40 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: The objective of this course is to understand the application of Artificial Intelligence
and Machine Learning techniques in financial markets, trading, and asset management.

10. Details of the Course:

S.No. Contents Contact

Hours
1 Introduction to financial markets and market microstructure 4
2 Introduction to risk-return framework 4
3 Introduction to asset management and portfolio optimization 4
4 Market efficiency and behavioral finance 4
5 Prediction in Financial markets using AI and machine learning models, AI and 6
machine learning in Trading execution and portfolio management
6 Credit scoring and credit modeling with non-linear machine learning models 4
and deep learning
7 Model risk management and stress testing 4
8 Robo advisory, social and quantitative investing 5
9 Machine learning for asset management 4
10 AI and machine learning in regulatory compliance and supervision 3
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
M. Dixon, I Halperin, and P. Bilokon “Machine Learning in
1 2020
Finance,” First Edition, Springer
2 Marcos Lopez “Advances in Financial Machine Learning,” First 2018
Edition, Wiley
3 Marcos Lopez “Machine Learning for Asset Managers,” First 2020
Edition,Cambridge University Press
4 Stefan Jansen “Machine Learning for Algorithmic Trading,” Second
2020
Edition, Packt
5 Elton and Gruber, “Modern Portfolio Theory,” Ninth Edition, Wiley 2014
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-553 Course Title: Digital Image Processing

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weight: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
9. Pre-requisite: Nil
10. Objective: The objective of this course is to introduce the fundamental techniques and
algorithms used for acquiring, processing and extracting useful information from digital images.

11. Details of the Course

S.No. Contents Contact

Hours
1. Introduction: Signal processing overview; Image processing basics; 4
Fundamental signals (1-D and 2-D); Classification of systems; Characteristics
of LTI/LSI systems. Introduction to the DIP areas and applications.
2. Digital Image Fundamentals: Human visual system and visual 4
perception; Image sensing and acquisition Image file types; Pixel
representation and spatial relationship
3. Image Digitization: Sampling and quantization. Image Transforms: 2- D 8
DSFT and 2-D DFT, 2-D discrete cosine transform (DCT), 1-D and 2-D
Karhonen Loeve (KL) or principal component analysis (PCA) and 1-D and 2-
D discrete wavelet transforms and relation to filter banks.
4. Image Enhancement: Point and algebraic operations, edge detection and 6
sharpening, filtering in the spatial and transformed domains. Rotation,
interpolation, image filtering, spatial operators, morphologicaloperators.
5. Image Segmentation: Thresholding; Edge based segmentation; Region 6
growing; Watershed transform.
Image Restoration: Degradation models, inverse and pseudo-inverse
filtering, 2-D Wiener filtering and implementation
6. Image Compression and Encoding: Entropy-based schemes, Transform- based 4
encoding, Predictive encoding and DPCM, Vector quantization, Huffman
coding.
7. Feature Extraction and Segmentation: Contour and shape dependent feature 5
extraction, textural features, region-based and feature-based segmentation.
8. Pattern Classification: Standard linear and Bayesian classifiers, 5
supervised Vs unsupervised classification, classification performance index.
Applications in satellite, sonar, radar and medical areas.
Total 42
12. Suggested Books:

S.No. Name of Authors/Book/ Publisher Year of

Publication/Reprint
1. Gonzalez R. C. and Woods R. E., “Digital image processing,” 2017
FourthEdition, Prentice Hall.
2. Lim J. S., “Two-dimensional signal and image processing,” Prentice 1990
Hall.
3. Dudgeon D.E. and Merserau R. M., “Multidimensional digital 1984
signalprocessing,” Prentice Hall Signal Processing Series.
4. Bose T., “Digital Signal and Image Processing”, Wiley India. 2010
5. Sonaka M., Hlavac V. and Boyle R., “Image Processing, Analysis 2017
and Machine Vision,” Fourth edition, Cengage India Private
Limited.
6. W.K. Pratt. “Digital Image Processing,” Fourth Edition, John Wiley 2007
&Sons, New York.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-578 Course Title: Graphs Algorithms in Data Science

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To acquaint the students with the knowledge of graph algorithms in ML and Data
Science.
10. Details of the Course:

S.No. Contents Contact

Hours
1 Fundamentals: graph models, Isomorphic graphs, Spanning tree, connectivity in 5
graphs, Eulerian and Hamiltonian Graphs, matching, vertex colouring and
domination, random graphs.
2 Graph Modelling with Neo4j: Graph Databases, directed vs undirected, 14
weighted vs unweighted, cyclic vs acyclic, dense vs sparse, connected vs
disconnected, graph traversal, Cypher Query Language, nodes and relationships,
managing databases with Neo4j, creating, selecting a node, filtering, creating a
relationship, selecting relationship, updating and deleting nodes and
relationships, pattern matching and data retrieval, aggregation functions,
importing data from CSV to JSON, Empowering business with pure Cypher,
knowledge graphs, graph-based search, recommendation engines.
3 Graph Algorithms: The Graph Data Science Library and Path finding, Dijkstra’s 10
shortest path algorithm, A-star algorithm, k-shortest path, optimizing processes
using graphs, travelling salesman problem, spanning tress, prims algorithm,
minimum spanning tree in a Neo4j graph.
4 Spatial data: Node importance, representation spatial attributes, creating a 8
geometry layer with Neo4j, spatial queries, visualization spatial data with Neo4j,
Community detection and similarity measures.
5 Machine Learning on Graphs: Using graph-based features in machine Learning, 5
predicting relationships, graph embedding from graphs to matrices, Applications
of Neo4j in web applications.
Total 42
11. Suggested Books:

S.No. Name of Authors/Book/ Publisher Year of

Publication/Reprint
1 Jonathan Gross and Jay Yellen, Graph Theory and its 2018
Applications, SecondEdition, CRC Press.
2 Estelle Scifo, Hands-On Graph Analytics with Neo4j, Kindle Edition. 2020
3 Bondy J.A. and Murty U.S.R., Graph Theory ǁ, Springer. 2013
4 Bela Bollobas, Random Graphs, Cambridge University Press. 2008
5 Douglas B. West ―Graph Theory, Prentice Hall. 2014
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Department of Computer Science and Engineering

1. Subject Code: CSN-527 Course Title: Internet of Things

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Knowledge of computer networks
9. Objective: To impart the know-how of Internet of Things and their applications, architectures and
protocols, building IoT applications/systems, securing the IoT systems, and their recent advances.

10. Details of the Course

S.No. Contents Contact

hours
1. Basic concepts revisited: Introduction to sensing & actuating, Basic networking, 7
Wireless networks, Wireless sensor networks (WSN), Communication protocols,
and other enabling technologies, IoT standards, Data storage & management
issues and approaches, Cloud computing, Key challenges, research, and future
directions of IoT, and security & privacy issues.
2. Embedded Systems: Hardware and software of IoT, Microcontrollers, 6
Understanding and programming Arduino, Raspberry Pi, NodeMCU, Lora, etc.
Integrating microcontrollers with sensors and actuators, Building the IoT
applications with any microcontroller.
3. IoT Architectures and Protocols: Layers of communication, Architectures: 9
State-of-the-art, IoT architecture reference models, Different views of IoT
architectures and frameworks design, Protocols: Application protocols, Service
discovery protocols, Infrastructure protocols, and other protocols. Understanding
various types of protocols like HTTP, MQTT, CoAP, AMQP, 6LoWPAN, etc.
Cross-layer implementations, and Data dissemination.
4. Support Technologies for IoT: Big Data, Data Analytics, Artificial Intelligence, 8
Mobile, Cloud, Software defined networks, 5G, and Fog/Edge computing. IoT
integration with recent technologies. State-of-the-art. Design goals, challenges,
and components.
5. Cyber Physical Systems: Industry 4.0, Society 5.0, Design & use cases, 6
Development, and implementation insights some examples like smart cities, smart
homes, smart grids, smart agriculture, smart healthcare, smart transportation,
smart manufacturing, and other smart systems. State-of-the-art. Conceptualizing
the new IoT-based smart systems using a case study.
6. IoT Security & Privacy: –, IoT Security and Privacy issues and challenges, Risks 6
involved with IoT infrastructures, Trust in IoT platforms and other integrating
technologies, Data aggregation, storage, retrieval, and other management issues
including fault tolerance, interoperability, security, and privacy, Cyber-physical-
systems and their security and privacy, Mitigation approaches.
Total 42
11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/ Reprint
1. Edited by: Buyya, Rajkumar, and Amir Vahid Dastjerdi, Internet 2016
of Things: Principles and paradigms. Elsevier/Morgan Kaufmann
2. Bahga, Arshdeep; Madisetti, Vijay, Internet of Things (A Hands- 2014
on-Approach), AbeBooks.com
3. Sohraby, Kazem, Daniel Minoli, and Taieb Znati. Wireless sensor 2007
networks: technology, protocols, and applications. John Wiley &
Sons
4. Marinescu, Dan C., Cloud computing: theory and practice. 2017
Elsevier/ Morgan Kaufmann
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Department of Computer Science and Engineering

1. Subject Code: AID-579 Course Title: Leveraging Data Science for Finance
2. Contact Hours: L: 3 T: 0 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 3 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: The objective of this course is to understand and apply the knowledge of data science
related applications in the domain of finance.

10. Details of the Course:

S.No. Contents Contact

Hours
1 Data Science basics: Preparation, organizing, and visualization of financial market 4
data and examination of basic properties of security prices
2 Quantiative models of risk-return framework in financial markets 4
3 Linear and non-linear price dynamics and modelling of security prices 4
4 Stock market prediction modelling, portfolio optimization, and wealth market 5
maximization
5 Application of latent factor and commonality models in financial markets 5
6 Modelling of financial market volatility using Conditional Heteroscedastic Models 6
7 Introduction to Crisis/Non-crisis models (Non-linearity, extreme-value modelling, 5
Markov regime-switching models, Quantile regression, Contagion models)
8 Introduction to data modelling for high-frequency algorithmic trading 5
9 Use cases for application of data science in Finance: Investment Management, 4
Sharpe ratio analysis, Capital Asset Pricing Model, etc. (using R programming)
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1 Chris Brooks “Introductory Econometrics,” Fourth Edition, Cambridge
2019
University Press
2 Ruey S. Tsay “Analysis of Time-series data,” Third Edition, Wiley 2014
3 John Fox and Sanford Weisberg “An R Companion to Applied 2018
Regression,” Third Edition, SAGE
4 Yves Croissant and Giovanni Millo “Panel Data Econometrics with R,” 2018
First Edition, Wiley
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE
NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-580 Course Title: Multi-Objective and Multi-Criteria Decision Making
2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To introduce the concept of multi-objective and multi criteria decision making
systems to the students.

10. Details of the Course:

S.No. Contents Contact

Hours
1 Introduction: Review of decision making process in optimization and 8
operations research models; overview of machine learning algorithms; ranking
methods.
2 Multi Objective Optimization (MOO): Introduction to multi objective 10
optimization, classical and recent methods for multi objective optimization
like genetic algorithms and particle swarm optimization.
3 Multi Criteria Decision Making (MCDM): Introduction to MCDM 10
methods; group decision making, weighing methods and ranking methods.
4 Data Manipulation: Data wrangling and data management for large sized 10
multi objective and multi criteria problems.
5 Implementation: Implementation of the models developed in 2, 3 and 4 in 4
Python
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1. G.H. Tzeng, J.J. Huang, “Multiple Attribute Decision 2011
Making:Methods and Applications”, CRC Press
2. M. Köksalan. J. Wallenius, S. Zionts, “Multiple Criteria 2011
Decision Making. From Early History to the 21st Century”,
World Scientific
3. J. Branke, K. Deb, K. Miettinen, R. Slowinski (Eds.), 2008
“Multiobjective Optimization: Interactive and Evolutionary
Approaches”, Springer-Verlag, Berlin, Heidelberg
4. A. Ishizaka, P. Nemery, “Multicriteria Decision Aid: Methods 2013
and software”, Wiley.
5. K Deb, “Multi-Objective Optimization Using Evolutionary 2011
Algorithms”, Wiley.
6. Michael Carter, Camille C. Price and Ghaith Rabadi 2018
“Operations Research, A Practical Introduction”, CRC Press.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Department of Mathematics

1. Subject Code: MAN-634 Course Title: Parallel Computing

2. Contact Hours: L: 3 T: 0 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE:0
5. Credits: 3 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To provide knowledge about parallel computing.
10. Details of the Course:

S.No. Contents Contact

Hours
1 Introduction, history, temporal parallelism, data parallelism, combined 7
temporal and data parallelism, data parallelism with dynamic and quasi-
dynamic assignment, specialist data parallelism, coarse-grained specialized
temporal parallelism, agenda parallelism, task dependencies and task graphs.
2 Structures of parallel computers: classification of parallel computers based 8
on data / instruction flow, coupling, mode of accessing memory, grain size,
vector supercomputers, systolic processors.
3 Shared memory parallel computers based on shared bus& intercommunication 5
networks, direct and indirect networks.
4 Message Passing Systems, MPI Programming, point-to-point communications, 6
collective communications
5 CUDA Programming, host, device, threads, blocks, indexing, synchronization, 6
performance optimization.
6 Performance evaluation, parallel balance point, concurrency, scalability, 5
speedup, Amdahl’s law, Gustafson’s law, Sun and Ni’s law.
7 Parallel algorithms, matrix multiplication, system of linear equations, 5
sorting, discrete Fourier transforms, numerical integration.
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint

1 Aki, Selim G.: “The Design and Analysis of Parallel Algorithms”, 1989
Prentice Hall, Englewood Cliffs, New Jersey.
2 Krik, David B. and Hwu, W.W.: “Programming Massively 2010
Parallel Processors - A Hands on Approach: Applications of
GPU ComputingSeries”, Elsevier Inc.
3 Pacheco, Peter S.: “Parallel Programming with MPI”, Morgan 1997
Kaufmann Publishers, Inc., California.
4 Quinn, M. J.: “Parallel Computing: Theory and Practice”, Tata 1994
McGraw Hill.
5 Rajaraman, V and Murthy, C. Siva Ram: “Parallel Computers 2000
Architecture and Programming”, Prentice Hall of India.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

1. Subject Code: AID-581 Course Title: Pattern Recognition

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To introduce various pattern recognition algorithms.

10. Details of the Course

S.No. Contents Contact

hours
1. Introduction to Pattern Recognition and Bayesian Theory: Pattern 8
recognition systems, The design cycle, Modeling using continuous and discrete
features, Discriminant functions, The Gaussian density, Error estimation, Some
basic examples
2. Parametric Models: Maximum-likelihood estimation, Bayesian estimation, 6
Expectation-Maximization and mixture density estimation, Hidden Markov
Models, Bayesian Belief Networks
3. Non-parametric Methods and Feature Reduction: Density estimation, 8
Parzen windows estimation, Nearest neighbor estimation, Curse of
dimensionality, Principal Component Analysis, Linear Discriminant Analysis,
Feature selection
4. Non-Bayesian Classifiers and Clustering: K-nearest neighbor classifier, 8
Linear discriminant functions, Support vector machines, Neural networks,
Decision trees, Random Forests, Criterion functions for clustering, k-means
clustering, Hierarchical clustering, Graph-theoretic clustering, Cluster validity
5. Algorithm-Independent Learning Issues: No Free Lunch Theorem, 6
Resampling for classifier design, Comparing classifiers, Combining classifiers
6. Structural and Syntactic Pattern Recognition: Recognition with strings, 6
Grammatical methods, Graph-theoretic methods
Total 42
11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1. R. O. Duda, P. E. Hart, D. G. Stork, Pattern Classification, 2nd 2000
edition, John Wiley & Sons, Inc
2. C. M. Bishop, Neural Networks for Pattern Recognition, 1995
Oxford University Press
3. K. Fukunaga, Introduction to Statistical Pattern Recognition, 1990
Academic Press
4. R. Schalkoff, Pattern Recognition: Statistical, Structural and 1992
Neural Approaches, John Wiley & Sons, Inc.
5. A. K. Jain, R. C. Dubes, Algorithms for Clustering Data, Prentice 1988
Hall
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence

Subject Code: AID-582Course Title: Recommender Systems

1. Contact Hours: L: 3 T: 0 P: 2
2. Examination Duration (Hrs.): Theory: 3 Practical: 0
3. Relative Weightage: CWS: 10-25 PRS: 25 MTE: 15-25 ETE: 30-40 PRE: 0
4. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: The objective of this course is to learn and understand the algorithms, theories, and
designs of recommender systems with relevant use cases.

10. Details of the Course:

S.No. Contents Contact

Hours
1 Basic concepts for recommender systems, Detailed taxonomy of recommender 4
systems, Evaluation of recommender systems
2 Content-based filtering algorithms, Collaborative filtering algorithms 6
3 Neighborhood-based collaborative filtering algorithms (Memory-Based 6
Algorithms)
4 Model-Based Collaborative Filtering Algorithms and Dimensionality Reduction 8
5 Ensemble-Based and Hybrid Recommender Systems 6
6 Advanced Topics in Recommendation Systems: The Cold Start, Context-aware 12
recommender systems, time-sensitive, location-sensitive, social, and multi-criteria
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication/Reprint
1 Charu Aggarwal “Recommender Systems: The Textbook,” First 2016
Edition, Springer
2 Francesco Ricci, Lior Rokach, and Bracha Shapira “Recommender 2015
SystemsHandbook,” First Edition, Springer
3 Rounak Banik “Hands-On Recommendation Systems with Python,” 2018
First Edition, Packt Publishing
4 Kim Falk “Practical Recommender Systems,” First Edition, 2019
Manning Publications
5 Deepak Agarwal and Bee-Chung Chen “Statistical Methods for 2016
RecommenderSystems,” First Edition, Cambridge University Press
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Department of Computer Science and Engineering

1. Subject Code: CSN-519 Course Title: Social Network Analysis

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Spring 7. Subject Area: PEC
8. Pre-requisite: Knowledge of computer networks
9. Objective: To introduce the basic notions used for social network analysis.

10. Details of the Course:

S.No. Contents Contact

hours
1. Social Network Analysis: Preliminaries and definitions, Erdos Number Project, 4
Centrality measures, Balance and Homophily.
2. Random graph models: Random graphs and alternative models, Models of 4
network growth, Navigation in social Networks
3. Network topology anddiffusion, Contagion in Networks, Complex contagion, 4
Percolation and information, Epidemics and information cascades
4. Cohesive subgroups, Multidimensional Scaling, Structural equivalence, Roles 6
and positions, Ego networks, Weak ties, Structural holes
5. Small world experiments, Small world models, Origins of small world, Heavy 6
tails, Small Diameter, Clustering of connectivity
6. The Erdos Renyi Model, Clustering Models, Preferential Attachment 6
7. Navigation in Networks Revisited, Important vertices and page rank algorithm, 6
Towards rational dynamics in networks, Basics of game theory
8. Coloring and consensus, biased voting, network formation games, network 6
structure and equilibrium, behavioral experiments, Spatial and agent-based
models
Total 42

11. Suggested Books:

S.No. Name of Authors/Book/Publisher Year of

Publication / Reprint
1. Wasserman, Stanley, and Joseph Galaskiewicz. Advances in social 1994
network analysis: Research in the social and behavioral sciences.
Sage
2. Knoke, David, and Song Yang. Social network analysis. Sage 2019
Publications.
3. Carrington, Peter J., John Scott, and Stanley Wasserman, eds. 2005
Models and methods in social network analysis. Vol. 28.
Cambridge university press.
4. Liu, Bing. "Social network analysis." In Web data mining, pp. 269- 2011
309. Springer, Berlin, Heidelberg.
 INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

NAME OF DEPARTMENT/CENTRE: Mehta Family School of Data Science and Artificial Intelligence
1. Subject Code: AID-583 Course Title: Data-driven Analytics for Smart Transportation Systems
2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs.): Theory: 3 Practical: 0
4. Relative Weightage: CWS: 20-35 PRS: 0 MTE: 20-30 ETE: 40-50 PRE: 0
5. Credits: 4 6. Semester: Both 7. Subject Area: PEC
8. Pre-requisite: Nil
9. Objective: To familiarize with the applications of data science in traffic and transportation engineering
and to demonstrate the applications of the data science in smart transportation planning

10. Details of the Course:

S.No. Contents Contact

hours
1. Data Science in Transportation 4
Overview and Practical Applications; Transportation Data Sources; Data
Collection; Data Preparation and Visualization.
2. Sensing and Data Mining for Smart Transportation Systems 8
Intelligent Transportation Systems, Incident Management Program, Efficient
Emergency Vehicle Movement (Pre-Emption), Crash Detection, Reporting, and
Clearance; Traffic Surveillance, Identification of Hotspots, Violation Detection;
Road Network Asset Management, Inventory of Potholes, other Deficiencies;
Adaptive Traffic Signal.
3. Data Analytics in Urban Transportation Planning 10
Basics of Urban Transportation Planning, Data Collection and Advanced Data
Sources, Household Surveys, Demand Modeling using WiFi/ Bluetooth/ Call Data
Record, Data Extraction and Analysis using APIs, Trip Distribution Modelling
Approaches, Route Choice Models, Choice Set Generation Methods, Genetic
Algorithms, Transportation Planning Example using Data-Driven Modeling and
Simulation.
4. Urban Mass Transit System 6
Basics of Urban Mass Transit System, Static and Dynamic GTFS, Real-Time
Transit, Travel Time Variability, Transit Reliability, Transit Planning using Smart-
Card Data, Real-Time Accessibility Analysis.
5. Applications in Environmental Impact of Transport System 6
IOT based Air pollution, Real-Time Air Pollution Monitoring and Data Analysis,
Placement of Mobile Sensors, Pollution Prediction using ML, Noise Data, Analysis
of Key Parameters, Development of Policy Framework.
6. Crash Data Analytics 8
Crash Data, Data Preparation, Model Estimation, Real-Time Data-Driven
Analysis; Emergency Vehicle Data, Crash Prone Stretches, Ambulance
Deployment; Near-misses/Traffic Conflict Data, Surrogate Approach, Proactive
Assessment and Safety Interventions.
Total 42
11. Suggested books
S.No. Name of Authors/Book/Publisher Year of
Publication/ Reprint
1. Fumitaka Kurauchi, Jan-Dirk Schmöcker “Public transport planning 2021
with smart card data” CRC Press
2. Juan de Dios Ortúzar, Luis G. Willumsen “Modelling Transport”, 2011
Wiley
3. Vukan R. Vuchic “Urban Transit: Operations, Planning, and 2005
Economics” Wiley
4. Constantinos Antoniou, Loukas Dimitriou, Francisco Pereira 2018
“Mobility Patterns, Big Data and Transport Analytics” Elsevier
5. Sara Moridpour, Alireza Toran Pour, Tayebeh Saghapour “Big Data 2019
Analytics in Traffic and Transportation Engineering: Emerging
Research and Opportunities” IGI Global
6. Khaled R. Ahmed, Aboul-Ella Hassanien “Deep Learning and Big 2021
Data for Intelligent Transportation” Springer
7. Davy Janssens, Ansar-Ul-Haque Yasar and Luk Knapen “Data 2013
Science and Simulation in Transportation Research” IGI Global