0% found this document useful (0 votes)

392 views36 pages

1691488222216-MTech Data Science Syllabus

Uploaded by

SAJJAN SHAH

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

392 views36 pages

1691488222216-MTech Data Science Syllabus

Uploaded by

SAJJAN SHAH

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 36

Scheme for

Master of Technology Program

in
Data Science & Engineering

Department of Computer Science & Engineering

Dr B R Ambedkar National Institute of Technology

Jalandhar Punjab India (144027)

Institute Vision and Mission

Vision

"To build a rich intellectual potential embedded with interdisciplinary knowledge, human values and
professional ethics among the youth, aspirant of becoming engineers and technologists, so that they
contribute to society and create a niche for a successful career".

Mission

"To become a leading and unique institution of higher learning, offering state-of-the-art education,
research and training in engineering and technology to students who are able and eager to become
change agents for the industrial and economic progress of the nation. To nurture and sustain an
academic ambience conducive to the development and growth of committed professionals for
sustainable development of the nation and to accomplish its integration into the global economy. To
strive to be a Swachch NIT providing a guarantee of clean hostel, clean mess, clean water and
hygienic & wholesome food to its students".

Department Vision and Mission

Vision

To be recognized globally for imparting computer science education and research of high distinction,
both of value and relevance to society.

Mission

M1: To impart contemporary knowledge and skill relevant to the field of Computer Science and
Engineering to maximize employability and potential.

M2: To strengthen multifaceted competence in the different core and allied areas of Computer
Science in order to nurture creativity, innovations and out-of-the-box thinking.

M3: To promote research and expertise in Computer Science and Engineering in order to serve the
needs of Industry, Government and Society and motivate the students for lifelong learning.

M4: To inculcate professional ethics and social values through co-curricular and extra–curricular
activities for holistic nation building.
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Program Educational Objectives (PEOs)

PEO1: Analyze, design and formulate complex research problems by applying in-depth domain
knowledge and research principles.

PEO2: Pursue a successful career in academics, entrepreneurship, design and development, or

research in the domain of Computer Science and allied fields.

PEO3: Work effectively in multi-disciplinary and multi-cultural environments by respecting

professionalism, ethical and social norms; along with environmental awareness at national and
international level.

PEO4: Engage in lifelong learning to always be an active learner towards the technical professional
growth along with betterment of the society and country.

Program Outcomes (POs)

PO1: An ability to independently carry out research /investigation and development work to solve
practical problems.

PO2: An ability to write and present a substantial technical report/document.

PO3: Students should be able to demonstrate a degree of mastery over the area as per the
specialization of the program. The mastery should be at a level higher than the requirements in the
appropriate bachelor program

Program Specific Outcomes (PSOs)

PSO1: Apply mathematical, statistical concepts and programming skills to analyse and develop
innovative solutions for the problems in the domain of data science.

PSO2: Demonstrate inferential analysis and enrich skills required to qualify for Employment,
Higher studies and Research in Data science with ethical values.
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Eligibility criteria for admission to M.Tech (Data Science & Engineering)– Full
Time (CCMT & Self-Sponsored) for the Academic batch 2023 onwards

M. Tech, Data Science & Engineering (CCMT) Programme:

• Must have a valid GATE score (as per CCMT Rules)
• 4 year B.Tech/ BE/ BSc (Engineering) in relevant branch of Engineering/Technology with a first
class or minimum 60% marks (or CGPA of 6.5 on 10 point scale).
• Candidates with MCA and should have studied mathematics at graduation level with a firstclass
or minimum 60% marks (or CGPA of 6.5 on 10 point scale).

Following are relevant branches for M. Tech, Data Science & Engineering (CCMT)Programme:
B.E./B.Tech. in Computer Engineering, Computer Science, Computer Science and
Engineering, Computer Science and Information Technology, Computer Technology,
Information Technology,Computer and Communication Engineering, Computer Engineering
and Application, Computer Networking, Computer Science and Systems Engineering,
Computer Science and Technology, Computing in Computing, Computing in Multimedia,
Computing in Software, Information and Communication Technology, Information
Engineering, Information Science, Information Science and Engineering Software
Engineering, Information Technology and Engineering, and other relevant branch in Computer
Science and Information Technology

M. Tech, Data Science & Engineering (Self-Sponsored) Programme:

• 4 year B.Tech/ BE/ BSc (Engineering) in relevant branch of Engineering/Technology as defined
inthe M.Tech Data Science & Engineering (CCMT) programme with a first class or minimum
60% marks (or CGPA of 6.5 on 10 point scale).
• Candidates with MCA and should have studied mathematics at graduation level with a first
class or minimum 60% marks (or CGPA of 6.5 on 10-point scale).

i. GATE Qualified candidates shall be admitted without any entrance test, based upon the GATE
score.
ii. Non-GATE candidates shall be admitted based upon the admission test to be carried out by the
department.

The reservation rules will be followed as per Government of India guidelines prevailing at the
timeof admission, at the Institute level.

Number of seats:
Programme No. of seats No. of seats
(CCMT) (Self-sponsored)
M. Tech. in Data Science & 20 10
Engineering
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Scheme for M. Tech. in Data Science & Engineering

SEMESTER I

S. No Course Course Title Teaching Load Credit

Code
L T P
1. CS-504 Advanced data structures and algorithms 3 0 0 3
2. CS-603 Statistical foundations of Data Science 3 0 0 3
3. CS-605 Advanced Machine Learning 3 0 0 3
4. CS-607 Ethics and IT acts 3 0 0 3
5. CS-6XX Elective I 3 0 0 3
6. CS-6XX Elective II 3 0 0 3
7. CS-524 Advanced data structures and algorithms 0 0 2 1
Laboratory
8. CS-623 Programming Laboratory for Data 0 0 2 1
Science
9. CS-625 Advanced Machine Learning Laboratory 0 0 3 2
TOTAL 15 0 7 22

SEMESTER II
S. No Course Course Title Teaching Load Credit
Code
L T P
1. CS-542 Big Data Analytics 3 0 0 3
2. CS-546 Deep Learning 3 0 0 3
3. CS-602 Data Engineering and Visualization 3 0 0 3
4. CS-606 Optimization Techniques for Data 3 0 0 3
Science
5. CS-6XX Elective III 3 0 0 3
6. CS-6XX Elective IV 3 0 0 3
7. CS-622 Data Engineering and Visualization 0 0 3 2
Laboratory
8. CS-624 Big Data Analytics Laboratory 0 0 3 2
TOTAL 15 0 6 22

SEMESTER III
S. No Course Course Title Teaching Load Credit
Code L T P
1. CS-601 Project Seminar / Independent study 0 0 6 3
2. CS-600 Dissertation Phase-I 0 0 12 6
TOTAL 0 0 18 9

SEMESTER IV
S. No Course Course Title Teaching Load Credit
Code L T P
1. CS-600 Dissertation Phase – II 0 0 24 12
TOTAL 0 0 24 12
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

ELECTIVE I and II

S. No Course Course Title Teaching Load Credit

Code L T P
1. CS-503 Advanced Databases and Data Mining 3 0 0 3
2. CS-505 Digital Image Processing 3 0 0 3
3. CS-532 Cloud Computing and communication 3 0 0 3
4. CS-631 Advanced Internet of Things 3 0 0 3
5. CS-632 Natural Language Processing 3 0 0 3
6. CS-633 Information Retrieval 3 0 0 3
7. CS-634 Soft Computing 3 0 0 3
8. CS-642 Green Computing 3 0 0 3

ELECTIVE III and IV

S. No Course Course Title Teaching Load Credit

Code L T P
1. CS-635 Blockchain Technologies and 3 0 0 3
Applications
2. CS-636 Advanced Computer Vision & Video 3 0 0 3
Analytics
3. CS-637 Business Intelligence 3 0 0 3
4. CS-638 Time Series Analysis 3 0 0 3
5. CS-639 Game Theory for Data Science 3 0 0 3
6. CS-640 Machine Learning for Cyber-Physical 3 0 0 3
Systems
7. CS-641 Quantum Computing for Data Analysis 3 0 0 3
8. CS-643 Financial Data science and Analytics 3 0 0 3
9. CS-644 Bioinformatics in Data Science 3 0 0 3

Proposed Number of Seats: 30 Totals Credits: 65

Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

DETAILED CURRICULUM FOR M. TECH PROGRAMME IN

DATA SCIENCE & ENGINEERING
CORE COURSES SEMESTER I

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Advanced Data Structures and Course Code: CS-504
Algorithms
Course Designation:
L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.

The course will enable the student to:

CO1 Enhance their expertise in algorithmic analysis and algorithm design
techniques.
CO2 Analyze, design, apply and use data structures and algorithms to solve
Course
engineering problems and evaluate their solutions
Outcomes
CO3 Understand and apply amortized analysis on data structures, including
binary search trees, merge able heaps and graphs.
CO4 Have an idea of applications of algorithms in a variety of areas including
string matching, and databases etc
Topics to be covered:

Elementary Data Structures and Complexity Analysis: Overview of Basic Data Structures: Arrays,
Linked List, Stack, Queues. Implementation of Sparse Matrices, Algorithm Complexity: Average,
Best- and worst-case analysis, asymptotic notations, Simple Recurrence Relations and use in
algorithm analysis.
Search Structures: Binary search trees, AVL trees, 2-3 trees, 2-3-4 trees, Red-black trees, Btrees,
weak AVL tree.
Graph Algorithms: Representation of Graphs, Traversals, Single-source shortest path Algorithms,
All-pairs shortest path algorithms, Sub graphs, Disjoint Graphs, Connected Components,
Articulation Points, Spanning tree, Minimum Spanning Trees Algorithms, Topological sort
String Matching Algorithms: Introduction, The Brute-Force- Algorithm, Rabin-Karp
Algorithm, String Matching with Finite automata, Knuth-Marries-Pratt Algorithm,
Aho-Corasick algorithm.

Heap Structures: Min-max heaps, Deaps, Leftist heaps, Binomial heaps, Fibonacci heaps, Skew
heaps
Multimedia Structures: Segment trees, k-d trees, Point Quad trees, MX-Quad trees, R-trees,
Splay tree; Bags and Sets.
1. E. Horowitz, S.Sahni and Dinesh Mehta, Fundamentals of Data structures in C++,
Galgotia, 1999.
Text Books 2. Adam Drozdex, Data Structures and algorithms in C++, Second Edition, Thomson
learning
vikas publishing house, 2001.
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Reference 1. G. Brassard and P. Bratley, Algorithmics: Theory and Practice, Printice –Hall,
Books: 1988.
2. Thomas H.Corman, Charles E.Leiserson, Ronald L. Rivest, ”Introduction to
Algorithms”, PHI.
Department: Computer Science and Engineering Programme: M. Tech. in DSE
Course Title: Statistical foundations of Data Course Code: CS-603
Science
Course Designation: Core
L T P C
Credit Scheme
3 0 0 3

Introduction: Big Data and Data Science; Current landscape of perspectives; Impact of Big Data;
Impact of Dimensionality; Aims of High-dimensional statistical learning; Statistics: Descriptive and
Inferential principles Real world problems.

Probability: The concept of probability, The axioms of probability, Some important theorems on
Probability, Assignment of Probabilities, Conditional Probability, Theorems on conditional
probability, Independent Event’s, Bayes’ Theorem.

Random Variables: Random variables, Discrete probability distributions, Distribution functions for
discrete random variables, Continuous probability distribution, Distributions for continuous random
variables, joint distributions, Independent random variables, Mathematical Expectation.

Probability Distributions: The Binomial Distribution, The Normal Distribution, The Poisson
Distribution, Relations between different distributions, Central limit theorem, Uniform distribution,
Chi-square Distribution, Exponential distribution; Maximum Likelihood Estimator.

Sampling Theory: Population and Sample, Independent identically-distributed sampling, Sampling

with and without replacement, the sample mean, Sampling distribution of means, proportions,
differences and sums, the sample variance, the sample distribution of variances.

Tests of Hypotheses and Significance: Statistical Decisions, Statistical hypotheses, Null

Hypotheses, Tests of hypotheses and significance, Type I and Type II errors, level of significance,
Tests involving the Normal distribution, One-Tailed and Two-tailed tests, Special tests of
significance for large and small samples, The Chi-square test for goodness of fit.

Analysis of variance: One Way Classification: ANOVA for fixed effect model, ANOVA for
Random Effect Model, Two-way Classification (one observation per cell): ANOVA for fixed effect
model, ANOVA for Random Effect Model.
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Advance Topics: Missing Values, Pruning Time-series/Sequential Learning, Random Process;

Gaussian Process, Markov Chains; Random Walks and Markov Chains and Applications

1. Fan, J., Li, R., Zhang, C.-H., and Zou, H. (2020). Statistical Foundations of Data
Text Books
Science. CRC Press.
Reference 1. Carlos Fernandez-Granda, Probability and Statistics for Data Science,
Books: Center for Data Science in NYU, 2017, available online.
2. Avrim Blum, John Hopcroft, and Ravi Kannan, Foundations of Data
Science, Cambridge University Press, March 2020, available online.
3. Dirk P. Kroese, Zdravko Botev, Thomas Taimre, Radislav Vaisman, Data
Science and Machine Learning: Mathematical and Statistical Methods, CRC
Press.
4. James D. Miller, Statistics for Data science, Packt Publishing, 2019.
5. Davy Cielen, Arno D. B. Meysman, and Mohamed Ali, Introducing Data
Science, Manning Publication, 2016, available online.

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Advanced Machine Learning Course Code: CS-605
Course Designation: Core
L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
The course will enable the student to:
CO1 Basic understanding of theories and techniques in machine learning.
Course CO2 Understand the idea behind different machine learning algorithms.
Outcomes CO3 Understand significance of machine learning in comparison to traditional
techniques.
CO4 Apply machine learning in real world problems.
Topics to be covered:
Artificial Intelligence & Problem-Solving
What Is AI? Intelligent Agents, Solving Problems by Searching: Problem-Solving Agents, Example
Problem, Search Algorithms, Uninformed Search Strategies, Informed (Heuristic) Search Strategies.
Local Search Algorithm, Adversarial Search, Constraint Satisfaction Problems

Knowledge Representation & Reasoning

Logical agents, Propositional Logic, First-Order Logic, and Inference in First-Order Logic
Resolution & Unification. Quantifying uncertainty: Probability, conditional probability, Bayes Rule,
Probabilistic reasoning: Bayesian Networks- representation, construction and inference, temporal
model, Hidden Markov model.

Machine Learning Introduction Statistical Models, Model Selection, Curse of Dimensionality,

Designing a Leaning System, Perspectives and Issues in Machine Learning.

Learning
Forms of Learning, Supervised Learning and Unsupervised Learning, Regression and Classification,
Support vector machine, Artificial Neural Networks, Ensemble Learning, and Reinforcement
Learning.

Supervised learning: Linear Regression, Logistic Regression, Classification.

Unsupervised Learning: Clustering, kernel PCA, non-negative matrix, nonlinear dimension

reduction, Google page rank algorithm.

Decision Tree Learning: Decision tree representation, appropriate problems for decision tree
learning, Univariate Trees (Classification and Regression), Multivariate Trees, Basic Decision Tree
Learning algorithms, Hypothesis space search in decision tree learning, Inductive bias in decision
tree learning, Issues in decision tree learning.

Support Vector Machine: Maximum margin linear separators, Quadratic Programming Solution to
finding maximum margin separators, Kernels for learning non-linear functions.

Artificial Neural Network: Neural network representation, Gradient Descent, Back propagation
Algorithm.

Ensemble Learning: Bagging, Boosting, ADA boost

Reinforcement Learning: Bandit algorithms, Dynamic Programming, Hierarchical RL.

1. C. Bishop, “Pattern Recognition and Machine Learning, Springer”, 2006.
Text Books
2. Tom Mitchell, “Machine Learning”, McGraw-Hill, 1997.
1. K. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press,
Reference 2012.
Books 2. The Elements of Statistical Learning by T. Hastie, R. Tibshirani, J.
Friedman, Springer, (2008), 2nd ed.

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Ethics and IT acts Course Code: CS- 607
Course Designation: Core
L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
The course will enable the student to:
CO1 Basic understanding of ethics in data science
Course
CO2 Understand the relation between fairness and consent
Outcomes
CO3 Understand the concept of privacy and security in ethical data science.
CO4 Analyze the various case studies and their application of ethics
Topics to be covered:
Introduction:
History and Concept of Ethics, Need for Trust, Responsibility and Ethics, Practices for Data
Practitioners, ACM Code of Ethics, IEEE and American Statistical Association codes of ethics,
Challenges of Putting Ethics in Practice

Fairness & Consent: Algorithmic Fairness, Correct but Misleading results, The Ethical Cycle,
Principle of Informed Consent, Data Ownership, Limit on Usage, Five Cs, Ethics and Technology

Privacy: Ethics and Security Training, Regulation, Ethics in Data-Driven Culture, History of
Privacy, Degree of Privacy, Modern Privacy Risks, Privacy in Targeted Ads

Data Validity: Validity of data, Errors in Data Processing, Errors in Design, Choice of Measures,
Managing Change
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Ethics in Action: Societal Implications and Consequences, Ossification and Surveillance, Medical
Applications and Implications, Law enforcing Applications

Basics of Intellectual Property Law: Introduction to Intellectual Property Law; Evolutionary past;
Intellectual Property Law Basics; Types of Intellectual Property; Innovations and Inventions of Trade
related Intellectual Property Rights; Introduction to Copyrights; Principles of Copyright;
Fundamentals of Patent and Cyber Law: Introduction to Patent Law; Rights and Limitations;
Introduction to Cyber Law; Information Technology Act; and Cyber Crime and E-commerce
1. Ethics and Data Science, by Mike Loukides, Hilary Mason, and DJ Patil
Text Books (2018)

1. An Introduction to Data Ethics:Shannon Vallor, Ph.D. William J. Rewak,

S.J. Professor of Philosophy, Santa Clara University
Reference 2. Data Science Ethics by University of Michigan, Coursera
Material

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Advanced Data Structure and Course Code: CS- 524
Algorithm Laboratory
Course Designation: Core
L T P C
Credit Scheme
0 0 3 2
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
The course will enable the student to:
CO1 Implement various advance problems using data structures such as stacks,
queues, trees, graphs, etc. to solve various computing problems.
CO2 Understand how several fundamental algorithms work particularly those
Course concerned with Stack, Queues, Trees and various Sorting algorithms.
Outcomes CO3 Design new algorithms or modify existing ones for new applications and
able to analyse the space & time efficiency of most algorithms.
CO4 Decide a suitable data structure and algorithm to solve a real-world
problem.
Topics to be covered:
List of Experiments: (This is only the suggested list of Practicals. Instructor may frame additional
Practicals relevant to the course contents.)
1. Implementation of various algorithms & operations based on Arrays such as Insertion, Deletion,
Sorting (Insertion, Bubble, Selection, Shell, Radix, Merge, Quick), Searching (Linear, Binary)
and Sparse matrices such as addition, multiplication & transpose.
2. Implementation of Stacks & Queues including priority queues along with various operations on
them such as Infix to Postfix conversion, postfix expression evaluation, get minimum element
in O(1) time using O(1) additional space using stacks & calculate no. of page faults, reversal of
the entire or a part of a queue.
3. Implementation of Linked list and doubly linked list along with solving various problems based
on them such as removal of duplicate elements from sorted/Unsorted Linked List, Swapping of
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

nodes by changing link, Segregating odd & even nodes together, binary Search, number of
elements in a loop, print nth element from the last, finding the middle element.
4. Implementation of binary trees and various operations based on them such as preorder/ inorder/
postorder traversal using stack, level order traversal, level order traversal in spiral form, left/
right/ top/ bottom view of the tree, vertical order traversal, printing sum of inorder predecessor
& successor for each node.
5. Implementation of binary search tree and various problem solving based on them such as finding
minimum/ maximum element, traversal in ascending/ descending order, kth largest & kth
minimum element, converting binary tree to binary search tree, finding a pair with a given sum.
6. Implementation of AVL trees and various operations based on them such as insertion, deletion
and traversal.
7. Implementation of Red/Black trees and various operations based on them such as insertion,
deletion and traversal.
8. Implementation of B trees and various operations based on them such as insertion, deletion and
traversal.
9. Implementation of heaps & deaps along with various operations based on them such as insertion,
deletion, extracting minimum/ maximum element, heap sort, priority queues.
10. Implementation of fibonacci & binomial heaps with various operations based on them such as
insertion, union, deletion, extracting minimum/ maximum element.
11. Implementation of various graph based algorithms Dijkstra’s shortest path, Warshall’s all pair
shortest path, breadth & depth first search.
12. Implementation of greedy algorithms like kruskal & prims to find the minimum spanning tree
from a given set of nodes and edges.
13. Implementation of various string matching algorithms like brute force, Rabin-karp,
Knuth_marries-Pratt and using finite automata.

Department: Computer Science and Engineering Programme: M.Tech in DSE

Course Title: Programming for Data Science Course Code: CS-623
Laboratory
Course Designation: Core
L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
The course will enable the student to:
CO1 Understand syntactical structure of various programming constructs.
Course
CO2 Develop programming solution for organizing the data, extracted from
Outcomes
different sources, in suitable format for analytical study
CO3 Perform effective analysis by using data visualization tools
Lis of Experiments:
(This is only the suggested list of Practicals. Instructor may frame additional Practicals relevant
to the course contents.)
1. Demonstration and setup procedure of the software environment/ tools used for data science.
2. Programs for demonstrating the Data Types, Operators, and built in data structures.
3. Programs for demonstrating the creation and use of various decision-making statements.
4. Programs for demonstrating the looping statements and different types of loops used.
5. Programs for exploring useful the library functions for data science.
6. Writing programs for showing the use of anonymous and inner functions.
7. Programs for dealing with various types of data stored in text files or excel files.
8. Implementing programs for handling multidimensional arrays.
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

9. Programs for loading and crating data sets and performing various operations on the data.
10. Programs for Data visualization.

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Advanced Machine Learning Course Code: CS-625
Laboratory
Course Designation: Core
L T P C
Credit Scheme
0 0 3 2

Course Assessment Methods: Assignments for each topic to be evaluated in the lab, and final
evaluation at the end which includes Viva Voce, Conduct of experiment.
The course will enable the student to:
CO1 Basic to build machine learning models in Python using popular machine
learning libraries NumPy and scikit-learn.
Course CO2 Hands on knowledge of methods and theories in the field of machine
Outcomes learning for learning principles, techniques, and applications of machine
learning.
CO3 Apply best practices for machine learning development for model
generalization to data and tasks in the real world.

List of Practicals (This is only the suggested list of Practicals. Instructor may frame additional
Practicals relevant to the course contents.):

1. Study and Implement Naive Bayes.

2. Study and Implement the Decision Tree.
3. Estimate the different performance metrics of precision, recall, accuracy, and F-measure of the
decision tree classifier on classification task.
4. Implement cross-validation.
5. Build a linear regression model.
6. Implement and understand the purpose of a cost function.
7. Implement and understand how gradient descent is used to train a machine learning model.
8. Build and train a regression model that takes multiple features as input.
9. Implement and understand the cost function and gradient descent for multiple linear regression.
10. Implement and understand methods for improving machine learning models.
11. Implement and understand the logistic regression model for classification.
12. Implement and understand the cost function and gradient descent for logistic regression.
13. Understand the problem of “overfitting” and improve model performance using regularization.
14. Implement regularization to improve both regression and classification models.
15. Implement K-mean clustering.
16. Implement anomaly detection.
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

CORE COURSES SEMESTER II

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Big Data Analytics Course Code: CS- 542
Course Designation: Core
L T P C
Credit Scheme
3 0 0 3

Hadoop Fundamentals: Hadoop Architecture, Hadoop ecosystem components, Hadoop Storage:

HDFS, Hadoop Processing: MapReduce Framework, MapReduce Types and Formats,YARN and
its applications, Hadoop Server Roles

Pig & Hive: Introduction to Pig, Execution modes, Data-Processing, Grouping and Joining in Pig,
Hive Shell, Hive Query Language, Hive Configuration, Tables, Partitioning, Serialization and
Deserialization, Bucketing.

HBase: HBasics, Concepts, Clients, Example, Hbase Versus RDBMS.

Spark: Resilient Distributed Datasets, Transformations and Actions, Dataframes and SparkSQL

NoSQL: Different types of databases, CAP theorem, HDFS as a foundation for NoSQL, Data
Control, definition and manipulation, Types of NoSQL database, Advantages, New SQL,
Comparison of SQL, NoSQL and NewSQL.

1. Tom White “ Hadoop: The Definitive Guide” Third Edit on, O’reilly
Media, 2012.
Text Books 2. Big Data Analytics: From Strategic Planning to Enterprise Integration with
Tools, Techniques, NoSQL, and Graph by David Loshin

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Deep Learning Course Code: CS-546
Course Designation: Core
L T P C
Credit Scheme
3 0 0 3

Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

lieu of internal assessment.

The course will enable the student to:
CO1 Basic understanding of the fundamentals of neural networks as well as
the learning mechanism of deep learning.
Course
CO2 Understand basic and advanced architectures of deep learning models.
Outcomes
CO3 Implementation of the popular models of deep learning.
CO4 Exposure to the current research in deep learning to solve real world
problems.
Topics to be covered:
Basics: Biological Neuron, Idea of computational units, McCulloch–Pitts unit and thresholding logic,
Perceptron Learning Algorithm, Linear separability, Convergence theorem for Perceptron Learning
Algorithm, Shallow versus Deep network, overfitting versus under fitting, Bias variance tradeoff,
loss function.

Deep Neural Networks: Gradient Descent, Backpropagation, Vanishing & exploding gradient
problem, Empirical Risk Minimization, regularization.

Training of Neural Networks: Optimization methods, AdaGrad, AdaDelta, RMSProp, ADAM,

NAG, Saddle point problem in neural networks.

Regularization: L1, L2, Early Stopping, Dropout, batch normalization.

Convolutional Neural Networks: CNN Architecture and operations, Convolution operation,

Different kind of filters, Edge detection, Down Sampling, Pooling, Padding, Flatten operation, Fully
connected layer, different activation function, Different popular convolution neural networks.

Recurrent Neural Networks: RNN vs CNN, Back propagation through time, Long Short Term
Memory, Gated Recurrent Units, Bidirectional LSTMs, Bidirectional RNNs.

Recent trends: Variational Autoencoders, Generative Adversarial Networks, Multi-task Deep

Learning, Multi-view Deep Learning; Zero-shot, One-shot, Few-shot Learning; Self-supervised
Learning; Reinforcement Learning in Vision; Other Recent Topics and Applications

Applications of Deep Learning: Large Scale Deep Learning, Computer Vision, Speech
Recognition, Natural Language Processing, Other Applications.
1. Deep Learning, Ian Goodfellow and Yoshua Bengio and Aaron Courville,
Text Books MIT Press, 2016.
2. Deep Learning with Python, Francois Chollet, 2017.
Reference 1. Hands-On Machine Learning with Scikit-Learn, Keras, and Tensorflow,
Books Aurélien Géron, O’Reilly, Second Edition, 2019.

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Data Engineering & Visualization Course Code: CS-602
Course Designation: Core
L T P C
Credit Scheme
3 0 0 3

optimize business processes.

CO2 To organize and critically apply the concepts and methods of business
analytics that support the decision process in business operations.

CO3 Work independently or in a team to get actionable insights using

sophisticated data visualisation methods
Topics to be Covered:
Introduction:
Data Types: Nominal, Binary, Ordinal, Numeric, Discrete, and Continuous, Statistics of Data,
Similarity & Distance Measures, Data Quality, Data Cleaning and Data Integration, Data
Transformation

Data Gathering & Data Cleaning

Data formats, parsing and transformation, Scalability and real-time issues, Consistency checking,
Heterogeneous and missing data, Data Transformation and segmentation

Exploratory Data Analysis

Descriptive and comparative statistics, Clustering and association, Hypothesis generation, Extract
Transfer & Load(ETL): Need of ETL, Challenges in ETL systems, Data Wrangling

Prescriptive analytics, creating data for analytics through designed experiments, creating data for
analytics through Active learning, creating data for analytics through Reinforcement learning

Performance Evaluation: Evaluating Predictive Performance, Judging Classifier Performance,

Judging Ranking Performance, Oversampling

Data Visualization: Use of Data Visualization, Data Examples, Basic Charts, Multidimensional
Visualization, and Specialized visualization: Network Data, Hierarchical Data, Geographical Data.
1. Shmueli, G., Bruce, P. C., Yahav, I., Patel, N. R., & Lichtendahl Jr, K. C.
(2017). Data mining for business analytics: concepts, techniques, and
Text Books applications in R. John Wiley & Sons.
2. Han, J., Pei, J., & Tong, H. (2022). Data mining: concepts and techniques.
Morgan kaufmann.
1. Hastie, T., Tibshirani, R. and Friedman, J., The Elements of Statistical
Learning, Springer (2009) 2nd Edition.
Reference 2. Simon, P., The Visual Organization: Data Visualization, Big Data, and the
Books Quest for Better Decisions, John Wiley & Sons (2014).
3. Making sense of Data : A practical Guide to Exploratory Data Analysis and
Data Mining, by Glenn J. Myatt

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Optimization Techniques for Data Course Code: CS-606
Science
Course Designation: Core
L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
Course The course will enable the student to:
Outcomes CO1 Understand the mathematical characteristic of unconstrained optimization
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

techniques
CO2 To build the foundation for unconstrained and convex optimization
techniques
CO3 Implement and analyse the Optimization Techniques
Topics to be covered:
Introduction to Linear Programming: Connections with Geometry. Simplex Method: Duality
Theorem. Complementary Slackness. Farkes' Lemma. Revised Simplex Method.

General LP Problems: Infeasibility. Sensitivity Analysis. Primal-Dual Algorithm: Applications to

Network Flow and Matching.

Efficient Algorithm: Linear Programming in fixed dimensions. Randomized Linear Programming.

Integer Linear Programming: Total Uni-modularity. Semidefinite Programming: Application to
MAXSAT problems.

Convex Optimization (CO): Convex sets, functions, and programs and their properties, Basics of
convex analysis, cones, Optimality conditions, introduction to duality theory, theorems of
alternatives, Algorithms: Unconstrained minimization, Descent methods, Newton’s method, and
Interior-point methods.

Classical Optimization Techniques: Single variable optimization without constraints, Multi

variable optimization without constraints, multivariable optimization with constraints method of
Lagrange multipliers, Kuhn-Tucker conditions.

Modern methods of optimizations and evolutionary algorithms: Differences and similarities

between conventional and evolutionary algorithms, working principle, Genetic Operators-
reproduction, crossover, mutation, Particle Swarm Optimization (PSO)

Fuzzy Systems: Fuzzy set Theory, Optimization of Fuzzy systems. Non-traditional optimization
algorithm

Application of the CO machinery in Data Science: Maximum likelihood and elements of Robust
Statistics

Regularization: ridge regression, LASSO, and their analysis, Elements of Bayesian Statistics, SVD,
Matrix norms, Robust Principal Component Analysis, Matrix completion, Examples from
engineering and machine learning.
1. C. S. Beightler , D. T. Phillips and D. J. Wilde,”Foundations of Optimization",
Text Books Prentice Hall, 1979

Reference 2. E. K. P. Chong and S. H. Zak, “An Introduction to Optimization", John Wiley and
Books: Sons, 2013
3. A. Beck, First-Order Methods in Optimization, MOS-SIAM Series on
Optimization, 2017.
4. K. Lange, “Optimization", Springer-Verlag, 2004
5. David G. Luenberger (1969). Optimization by Vector Space Methods, John Wiley
& Sons (NY)

Department: Computer Science and Engineering Programme: M.Tech. in DSE

Course Title: Data Engineering & Visualization Course Code: CS-622
Laboratory
Course Designation: Core
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

L T P C
Credit Scheme
0 0 3 2

List of Experiments (This is only the suggested list of Practical. The instructor may frame
additional Practical relevant to the course contents.)
Data Analysis:
Apply Data Cleaning, Concepts of Exploratory Data Analysis on publicly available datasets like:
Charles Book Club, German Credit, Tayko Software Cataloger, Voter Persuasion, Taxi cancellation,
Bath Soap , Future Fund Raising, Bankruptcy, Titanic, etc.

Data Visualization:
Hands-on Visualization Tools like Knime, Tableau

Visualization workflow: describing data visualization workflow, process in practice; Data

Representation: chart types: categorical, hierarchical, relational, temporal & spatial;

2-D: bar charts, Clustered bar charts, dot plots, connected dot plots, pictograms, proportional shape
charts, bubble charts, radar charts, polar charts, Range chart, Box-and-whisker plots,

univariate scatter plots, histograms word cloud, pie chart, waffle chart, stacked bar chart, back-to-
back bar chart, treemap and all relevant 2-D charts.

3-D: surfaces, contours, hidden surfaces, pm3d coloring, 3D mapping; multi-dimensional data
visualization; manifold visualization; graph data visualization; Annotation.

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Big Data Analytics Laboratory Course Code: 624
Course Designation: Core
L T P C
Credit Scheme
0 0 3 2

The course will enable the student to:

CO1 Understand Big Data and its Applications
Course CO2 Understand the fundamentals of Hadoop and Yarn
Outcomes CO3 Apply the various fundamentals of Big Data analytics using Hadoop
ecosystem tools.
CO4 Analyze the different types of data which can be handled by NoSQL
Lab Experiments: (This is only the suggested list of Practical’s. Instructor may frame additional
practical relevant to the course contents.)
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

1. Install Apache Hadoop and setup Single Node Hadoop Cluster

2. Write a program using MapReduce to calculate the frequency of a given word in a given file.
3. Write a program using MapReduce to analyze weather data and generate reports with on
maximum and minimum temperature
4. Write a program implement clustering using mapReduce
5. Write a program using Pig Latin to filter, sort and join data records
6. Write a program to perform database operations on a table using Hive
7. Write a program to make a user defined function in Hive
8. Write a program to analyse a dataset using Spark Dataframe.
9. Install MongoDB server and perform basic insert, delete and update operations on a given
data.

ELECTIVE I AND II
Department: Computer Science and Engineering Programme: M. Tech. in DSE
Course Title: Advanced Databases and Data Course Code: CS-503
Mining
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
The course will enable the student to:
CO1 Understand the advanced concepts of Databases, security and privacy
issues and the techniques to handle the same.
Course CO2 To design and develop data warehouses and data marts models and their
Outcomes applications.
CO3 Learn and apply the data mining techniques to find out the hidden
patterns and to turn into useful knowledge.
CO4 To identify Business applications and Trends of Data mining
Topics to be covered:
Basics: Formal review of relational database and FDs Implication, Closure, its correctness

Normalization and Joins: 3NF and BCNF, Decomposition and synthesis approaches,
Review of SQL99, Basics of query processing, external sorting, file scan. Processing of
joins, materialized vs. pipelined processing, query transformation rules, DB transactions,
ACID properties, interleaved executions, schedules, serializability, Query optimization,
object-oriented databases, and multimedia databases.

Transaction Control: Correctness of interleaved execution, Locking and management of locks,

2PL, deadlocks, multiple level granularity, CC on B+ trees, Optimistic CC, T/O based techniques,
Multiversion approaches, Comparison of CC methods, dynamic databases, Failure classification,
recovery algorithm, XML and relational databases

Advance Databases: Big Data Revolution- CAP Theorem- Birth of NoSQL- Document
Database—XML Databases- JSON Document Databases- Graph Databases.

Column Databases— Data Warehousing Schemes- Columnar Alternative- Sybase IQ- CStore and
Vertica- Column Database Architectures- SSD and In-Memory Databases— InMemory Databases-
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Berkeley Analytics Data Stack and Spark.

Distributed Database Patterns— Distributed Relational Databases-Non-

relational Distributed Databases- MongoDB - Sharing and Replication- HBase-
CassandraConsistency Models— Types of Consistency- Consistency MongoDB- HBase
Consistency- Cassandra Consistency.

1. U. M. Fayyad, G. P. Shapiro, P. Smyth and R. Uthurusamy, “Advances in

Knowledge Discovery and Data Mining”, The M.IT. Press, 1996.
Text Books
2. Jiawei Han and Micheline Kamber, “Data Mining Concepts and
Techniques”, Morgan Kauffmann Publishers, 3/e, 2011.
3. Silberschatz, Abraham, Henry F. Korth, and Shashank Sudarshan.
"Database system concepts." (2011).
1. Sean Kelly, “Data Warehousing in Action”, John Wiley & Sons Inc., 1997.
Reference
Books 2. Michael J. A. Berry, Gordon S. Linoff, “Mastering Data Mining”, Wiley,
1999.

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Digital Image Processing Course Code: CS-505
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3

Image Enhancement and Restoration: Basic Intensity Transformation Functions, Histogram

processing, Spatial Domain methods: Fundamentals of spatial filtering, Smoothing Spatial Filters,
Sharpening Spatial Filters, Frequency domain methods: low pass filtering, High pass filtering, Image
Degradation/Restoration model.

Image Compression: Fundamentals of image compression, error criterion, Coding Inter-pixel and
Psycho visual redundancy, Image Compression models, Error free compression: Huffman,
Arithmetic, Run length Coding, Lossy Compression: Block Transform Coding based on DCT and
DWT, Image Compression standard: JPEG.

Morphological image processing: Basic Morphology concepts, Binary dilation and erosion,
Opening and Closing operations, Basic Morphological Algorithms: Boundary extraction, Hole
Filling, Extraction of Connected Components.
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Image Segmentation and Edge Detection: Fundamentals, Point, Line and Edge Detection:
Detection of isolated points, lines, Basic Edge Detection, Advanced Edge detection using Canny
edge detector, Laplacian edge detector and Laplacian of Gaussian edge detector. Edge Linking and
Boundary Detection, Thresholding: Basic Global Thresholding and Optimum Global Thresholding
using Otsu’s Method, Region Based Segmentation: Region Growing, Region Splitting and Merging.

Representation and Description: Representation schemes like chain coding, Polygonal

approximation using minimum perimeter polygon, Signatures, Boundary Descriptors: Shape
Numbers, Fourier, and Statistical moments. Regional Descriptors: Topological Descriptors, Texture,
Moment Invariants.

Recognition and Interpretation: Pattern and pattern classes, Decision Theoretic methods:
minimum distance classifier, matching by correlation, Structural Methods: Matching Shape
Numbers.
1. Rafael C. Gonzales and Richard E. Woods, “Digital Image Processing”,
Pearson Education, 3/e, 2007.
Text Books
2. Milan Sonka, Vaclav Hlavac and Roger Boyle, “Digital Image Processing
and Computer Vision”, Cengage Learning, 2007.
3. Anil K. Jain, “Fundamentals of Digital Image Processing”, Pearson
Education, 1988.
1. B. Chanda, “Digital Image Processing and Analysis”, PHI Learning Pvt.
Reference Ltd., 2011.
Books 2. William K. Pratt, “Digital Image Processing”, Wiley-Interscience, 4/e,
2007.

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Cloud Computing & Communication Course Code: CS-532
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3

Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
The course will enable the student to:
CO1 Explain the core concepts of the cloud computing paradigm.
CO2 Discuss system, network and storage virtualization and outline their role in
Course enabling the cloud computing system model.
Outcomes CO3 Illustrate the fundamental concepts of cloud storage and demonstrate their
use in storage systems
CO4 Analyze various cloud programming models and apply them to solve
problems on the cloud.
Topics to be covered:
Introduction: Cloud-definition, benefits, usage scenarios, History of Cloud Computing, Cloud
Architecture, Types of Clouds, Business models around Clouds, Major Players in Cloud Computing,
Research issues and challenges in Cloud Computing, Examples: Eucalyptus, Nimbus, Open Nebula,
Cloud simulator: CloudSim.
Cloud Services: Types of Cloud services: SaaS, IaaS, PaaS, CaaS,
Service providers – Google, Amazon, Microsoft Azure, IBM, Salesforce.
Resource Management: Server consolidation, Dynamic resource provisioning, Resource
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Optimization, Scheduling Techniques for Advance Reservation, SLA Requirements and

Management, Load Balancing, various load balancing techniques, Broad Aspects of Migration into
Cloud, Migration of virtual Machines and techniques. Fault Tolerance Mechanisms.
Virtualization For Cloud: Need for Virtualization, Pros and cons of Virtualization, Virtualizations
at Server, Networks and Application Levels. Xen, KVM, VMWare, Virtual Box, Hyper-V.
Security, Standards and Applications: Security in Cloud, Security challenges in Cloud Computing,
Common Standards, Standards for Security, End user access to cloud computing, Mobile Internet
devices and the cloud.
Advances in Cloud Computing: Fog Computing, Edge Computing, Green Cloud, Mobile Cloud
Computing, Serverless Computing, Web of Things.
1. Thomas Erl, “Cloud Computing: Concepts, Technology and Architecture”,
Pearson, 2020
Text Books 2. Dan C. Marinescu, “Cloud-Computing Theory and Practice” Morgan Kaufmann
2018
3. Shailendra Singh, “Cloud Computing” Oxford University Press, 2018
1. Douglas E. Comer, “The Cloud Computing Book: The Future of Computing
Explained” CRC Press, 2021.
Reference
2. Michael Kavis, “Architecting the Cloud: Design Decisions for Cloud Computing
Books
Service Models (SaaS, PaaS, and IaaS)”, Wiley, 2014

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Advanced Internet of Things Course Code: CS-631
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3

IoT Hardware and Sensors: Introduction to sensor interfacing, types of sensors (gas sensor,
obstacle sensor, heartbeat sensor, gyro sensor, GPS, pH sensor, etc.), controlling sensors through
webpages, IoT microcontrollers-8051, Advanced RISC Machine-ARM7.

IoT Protocols: Messaging and Transport protocol - Message Queuing Telemetry Transport (MQIT),
Constrained Application Protocol, XMPP and DDS Protocols, Extensible Messaging and Presence
Protocol (XMPP), Data Distribution Service (DDS). Transport Protocols - Bluetooth Low Energy,
Light Fidelity (Li-Fi). Addressing and Identification protocols - Internet Protocol Version 4 (IPv4),
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Internet Protocol Version 6 (IPv6), IPv6 versus IPv4, Legacy of IPv4 Devices , Switching Over to
IPv6, Uniform Resource Identifier ( URI).

IoT Cloud Computing and Edge Computing: Challenges, Selection of Cloud Service Provider:
An Overview, Introduction to Fog Computing, Working of Fog Computing, Difference Between
Edge and Fog Computing, Cloud Computing: Security Aspects

Data Analytics and Machine Learning: Data Analysis, Machine Learning — Visualising,
Supervised Learning, Unsupervised Learning, Types of Machine Learning Models - Classification,
Regression, and Clustering, Model Building process, Modelling algorithms, Model performance, Big
data platform and pipeline.

IoT Applications: IFTTT, IFTTT versus Other Cloud Services, Smart Perishable Tracking with IOT
and Sensors , Smart Healthcare —Elderly Fall Detection with 1oT and Sensors, Smart Inflight
Lavatory Maintenance with IoT, IoT—Based Application to Monitor Water Quality, Smart
Warehouse Monitoring, Smart Retail —IoT Possibilities in the Retail Sector, Prevention of
Drowsiness of Drivers by IoT-Based Smart Driver Assistance, System to Measure Collision Impact
in an Accident with IoT, Integrated Vehicle Health Management.
1. Shriram K Vasudevan,Abhishek S Nagarajan, RMD Sundaram, "Internet
of Things", Wiley 2020
2. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Robert Barton,
Text Books
Jerome Henry, IoT Fundamentals: Networking Technologies, Protocols,
and Use Cases for the Internet of Things, Cisco Press, 2017, ISBN:
1587144565.
1. Perry Lea, IoT and Edge Computing for Architects: Implementing edge
and IoT systems from sensors to clouds with communication systems,
analytics, and security, 2nd Edition, Packt Publishing, 2020,
ISBN:1839214805
Reference
Books 2. S. Misra, A. Mukherjee, and A. Roy, Introduction to IoT. Cambridge
University Press, 2021, ISBN: 1108959741

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Natural Language Processing Course Code: CS-632
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3

The course will enable the student to:

CO1 Understand and develop a conversational agent that uses natural language
Course processing.
Outcomes CO2 Automatically extract information from text using concepts and methods
from natural language processing (NLP).
CO3 Understand semantics and pragmatics of English language for processing.
Topics to be covered:
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Introduction: NLP introduction, origins of NLP, Language and Knowledge, The challenges of NLP,
Language and Grammar, Processing Indian Languages, NLP applications, Some successful Early
NLP systems, Information Retrieval

Language Modeling: Introduction, Various Grammars- based language models, Statistical

Language Model.

Word Level Analysis: Introduction, Regular Expressions, Finite State Automata, Morphological
Parsing, Spelling Error Detection and Correction, Words and Word Classes, Part-of-Speech Tagging.

Syntactic Analysis: Introduction, Context-Fee Grammar, Constituency, Parsing, Probabilistic

Parsing, Indian Languages.

Semantic Analysis: Introduction, Meaning Representation, Lexical Semantics, Ambiguity, Word

Sense Disambiguation.

Discourse Processing: Introduction, Cohesion, Reference Resolution, Discourse Coherence and

Structure.

Natural Language Generation: Introduction, Architecture of NLG Systems, Generation Tasks and
Representations, Application of NLG.

Machine Translation: Introduction, Problems in Machine Translation, Characteristics of Indian

Languages, Machine Translation Approaches, Direct Machine Translation, Rule-based Machine
Translation, Corpus-based Machine Translation, Semantic or Knowledge –based MT Systems,
Translation involving Indian Languages.

Other Applications: Introduction, Information Extraction, Automatic Text Summarization,

Question - Answering System.

Lexical Resources: Introduction, Word Net, Frame Net, Stemmers, Part-of-Speech Tagger.
1. D. Jurafsky and J. H. Martin, “Speech and Language Processing”, Prentice
Hall, 2/e, 2008.
Text Books
2. Tanveer Siddiqui and U. S. Tiwary, “Natural Language Processing and
Information Retrieval”, Oxford Higher Education, 2008.
3. L.M. Ivansca and S. C. Shapiro, “Natural Language Processing and
Language Representation”, AAAI Press, 2000.
Reference 1. Akshar Bharti, Vineet Chaitanya and Rajeev Sangal, “NLP: A Paninian
Books Perspective”, Prentice Hall, New Delhi, 2004.

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Information Retrieval Course Code: CS-633
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in lieu of
internal assessment.
The course will enable the student to:
Course CO1 Understand different Information Retrieval models.
Outcomes CO2 Evaluate various Information Retrieval models.
CO3 Understand the concepts of information visualization and text search.
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

CO4 Evaluate and optimize search engines and develop optimized web sites.
Topics to be covered:
Introduction: Information retrieval process, Indexing, Information retrieval model, Boolean retrieval
model, Dictionary and Postings: Tokenization, Stop words, Stemming, Inverted index, Skip pointers,
Phrase queries,

Information Retrieval-1: Introduction, Design Features of Information Retrieval systems, Information

Retrieval Models, Classical Information Retrieval Models, Non-classical models of IR, Alternative
Models of IR, Evaluation of the IR Systems.

Information Retrieval-2: Introduction, Natural Language Processing in IR, Relation Matching,

Knowledge-base Approaches, Conceptual Graphs in IR, Cross-lingual Information Retrieval.

Tolerant Retrieval: Wild card queries, Permuterm index, Bigram index, Spelling correction, Edit
distance, Jaccard coefficient, Soundex, Evaluation Precision, Recall, F-measure, Normalized recall,
Latent Semantic Indexing, Eigen vectors, Singular value decomposition, Lowrank, approximation,
Problems with Lexical Semantics, Query Expansion Relevance feedback, Rocchio algorithm,
Probabilistic relevance feedback, Query Expansion and its types, Query drift,

Probabilistic Information Retrieval: Probabilistic relevance feedback, Probability ranking principle,

Binary Independence Model, Bayesian network for text retrieval, Structural terms, Content Based, Image
Retrieval

Content Based Image retrieval: Challenges in Image retrieval, Image representation, Indexing and
retrieving images, Relevance feedback, Open source Search engine Frameworks: Components of a
Search engine, Web search: The structure of the web, Queries and users, Static ranking, Dynamic
ranking, Evaluating web search, The user, paid placement, Search engine optimization/spam, Web
Search Architectures: Crawling, Meta-crawlers and Focused Crawling, Web Crawlers: Crawling the
web, Document feeds, Storing documents and detecting duplicates,

Index Compression: Statistical properties of terms in IR, Dictionary compression, Postings File
compression, XML retrieval: XML Indexing and Search, Data vs. Text-centric XML, Text-Centric XML
retrieval, A vector space model for XML retrieval, Link Analysis: hubs and authorities, Page Rank and
HITS algorithms.
1. Introduction to Information Retrieval by C. Manning, P. Raghavan, and H.
Schutze, Cambridge University Press.
Text Books
2. Modern Information Retrieval: The Concepts and Technology behind Search
by Ricardo Baeza Yates and Berthier Ribeiro Neto, ACM Press.
1. Search Engines: Information Retrieval in Practice by Bruce Croft, Donald
Metzler and Trevor Strohman, Addison Wesley.
Reference
Books 2. Kowalski, Gerald, Mark T May bury: INFORMATION RETRIEVAL
SYSTEMS: Theory and Implementation, Kluwer Academic Press, 1997.

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Soft Computing Course Code: CS-634
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3

Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

lieu of internal assessment.

The course will enable the student to:
CO1 Identify and describe soft computing techniques and their roles in
building intelligent machines
Course
CO2 Apply fuzzy logic and reasoning to handle uncertainty and solve
Outcomes
engineering problems,
CO3 To implement genetic algorithm and artificial neural network real-time
scenario
Topics to be covered:
Introduction to Soft Computing: Concept of computing systems, "Soft" computing versus "Hard"
computing, Characteristics of Soft computing, Some applications of Soft computing techniques

Fuzzy logic: Introduction to Fuzzy logic, Fuzzy sets and membership functions, Operations on Fuzzy
sets, Fuzzy relations, rules, propositions, implications and inferences, Defuzzification techniques,
Fuzzy logic controller design, Some applications of Fuzzy logic.

Genetic Algorithms: Concept of "Genetics" and "Evolution" and its application to probabilistic
search techniques, Basic GA framework and different GA architectures, GA operators: Encoding,
Crossover, Selection, Mutation, etc., Solving single-objective optimization problems using GAs.

Multi-objective Optimization Problem Solving: Concept of multi-objective optimization problems

(MOOPs) and issues of solving them, Multi-Objective Evolutionary Algorithm (MOEA), Non-Pareto
approaches to solve MOOPs, Pareto-based approaches to solve MOOPs, Some applications with
MOEAs.

Artificial Neural Networks: Biological neurons and their working, Simulation of biological neurons
to problem-solving, Different ANNs architectures, Training techniques for ANNs, Applications of
ANNs to solve some real life problems.
1. Networks, Fuzzy Logic and Genetic Algorithms: Synthesis & Applications,
Text Books
S.Rajasekaran, G. A. Vijayalakshami, PHI.
Reference 1. Genetic Algorithms: Search and Optimization, E. Goldberg.
Books: 2. Neuro-Fuzzy Systems, Chin Teng Lin, C. S. George Lee, PHI.

Department: Computer Science and Engineering Programme: M.Tech. CSE(DS)

Course Title: Green Computing Course Code: CS-642
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
The course will enable the student to:
CO1 Basic understanding of the green computing practices to minimize
negative impacts on the environment.
Course CO2 Acquiring skill in energy saving practices in use of hardware and discuss
Outcomes how the choice of hardware and software can facilitate a more sustainable
operation.
CO3 Examine technology tools that can reduce paper waste and carbon
footprint by user and understand how to minimize equipment disposal
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

requirements.
CO4 Development of case studies related to environmentally responsible
strategies.
Topics to be covered:
Fundamentals: Business, IT, and the Environment, carbon foot print, regulations and industry
initiatives, green maturity model for virtualization.

Operating system support: Power supply, Storage, video card, Display, web, temporal and spatial
data mining materials recycling, Tele-computing.

Middleware support for green computing: Tools for monitoring, HPC computing, Green Mobile,
Embedded computing and networking, Management frameworks, Standards and metrics for
computing green.

Environmentally Sustainable Infrastructure Design: Sustainable technology, Sustainable

intelligence, decomposing infrastructure environment, Profiling energy usages for the application.
Profiling energy usages for the operating system and Extra energy usages profile.

Green Networking: Where to save energy in wired networking, Taxonomy of green networking
research, Adaptive link rate, Interface proxying, Energy ware infrastructure, Energy ware
application.

Green Cellular Networking: Survey, measuring greenness metrics, Energy saving in base stations,
Research issues, Challenges, Future generation wireless systems, Wireless sensor network for green
networking.

Green Compliance: Socio-cultural aspects of Green IT, Green Enterprise Transformation Roadmap,
Protocols, Standards, and Audits, Emergent Carbon Issues.

Case Studies: The Environmentally Responsible Business Strategies (ERBS), Case Study Scenarios
for Trial Runs, Applying Green IT Strategies and Applications to a Home, Hospital, Packaging
Industry and Telecom Sector.
1. Bud E. Smith, “Green Computing: Tools and Techniques for Saving
Energy, Money, and Resources”, Auerbach Publications, 2018.
Text Books 2. Jason Harris, “Green Computing and Green IT Best Practices on
Regulations and Industry Initiatives, Virtualization, Power Management,
Materials Recycling and Telecommuting”, Emereo Publishing, 2008.
3. Bhuvan Unhelkar, “Green IT Strategies and Applications-Using
Environmental Intelligence”, CRC Press, June 2011
1. Toby Velte, Anthony Velte, Robert Elsenpeter, “Green IT: Reduce Your
Reference
Information System's Environmental Impact While Adding to the Bottom
Books
Line”, MC-Graw Hill, 2008.

ELECTIVE III AND IV

Department: Computer Science and Engineering Programme: M. Tech. in DSE
Course Title: BlockChain Technologies and Applications Course Code: CS-635
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

lieu of internal assessment.

The course will enable the student to:
CO1 Basic understanding of concepts and technologies used for blockchain.

Course CO2 Illustrate the concepts of Bitcoin and their usage; the importance of
Outcomes consensus.
CO3 To deploy blockchain and Implement Ethereum blockchain smart
contracts.
CO4 To implement Blockchain for different use cases.
Topics to be covered:
Introduction: Need for Distributed Record Keeping, Modeling faults and adversaries, Byzantine
Generals problem, Multichain and its features, Consensus algorithms, Requirements for the
consensus protocols and their scalability problems, Nakamoto Concept with Blockchain based
cryptocurrency, Technologies Borrowed in Blockchain – hash pointers, consensus, byzantine fault-
tolerant distributed computing, digital cash etc.

Basic Distributed Computing and & basic Crypto primitives: Atomic Broadcast, Consensus,
Byzantine Models of fault tolerance, Hash functions, Puzzle friendly Hash, Collison resistant hash,
digital signatures, public key crypto, verifiable random functions, Zero-knowledge systems

Blockchain 1.0: Bitcoin blockchain, the challenges, and solutions, proof of work (PoW), Proof of
stake (PoS), alternatives to Bitcoin consensus, Bitcoin scripting language and their use.

Blockchain 2.0 and Blockchain 3.0: Ethereum and Smart Contracts, The Turing Completeness of
Smart Contract Languages and verification challenges, using smart contracts to enforce legal
contracts, comparing Bitcoin scripting vs. Ethereum Smart Contracts, Hyperledger fabric, the plug
and play platform and mechanisms in permissioned blockchain

Privacy, Security issues in Blockchain: Pseudo-anonymity vs. anonymity, Zcash and Zk-SNARKS
for anonymity preservation, attacks on Blockchains – such as Sybil attacks, selfish mining, 51%
attacks - -advent of algorand, and Sharding based consensus algorithms to prevent these attacks.

Case Studies: Blockchain in Financial Service, Supply Chain Management and Government
Services.
1. Melanie Swa “Blockchain”, First Edition, O’Reilly Jan 2015
2. Narayanan, Bonneau, Felten, Miller and Goldfeder, “Bitcoin and
Cryptocurrency Technologies – A Comprehensive Introduction”, Princeton
University Press.
3. Andreas M. Antonopoulos, “Mastering Bitcoin: Unlocking Digital
Text Books Cryptocurrencies”, O’Reilly Media Inc, 2015
4. Josh Thompson, ‘Blockchain: The Blockchain for Beginnings, Guild to
Blockchain Technology and Blockchain Programming’, Create Space
Independent Publishing Platform, 2017.
5. Imran Bashir, “Mastering Blockchain: Distributed ledger technology,
decentralization, and smart contracts explained”, Packt Publishing.
1. Zero to Blockchain - An IBM Redbooks course, by Bob Dill, David Smits -
https://www.redbooks.ibm.com/Redbooks.nsf/RedbookAbstracts/crse0401.
Reference html
Books Hyperledger Fabric - https://www.hyperledger.org/projects/fabric

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Advanced Computer Vision & Video Analytics Course Code: CS-636
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Course Designation: Elective

L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
The course will enable the student to:
CO1 To articulate the main features of Computer Vision for interpret and
analyze the visible environment around us.
CO2 To build the applications of Deep Learning in image processing,
Course
Computer vision and video processing.
Outcomes
CO3 Understand the various CNN architectures and able to implement the
same for various application.
CO4 Understand and implement the state-of-the-art computer vision and video
analytics concepts for the various application.
Topics to be covered:
Introduction to computer vision and video processing: Introduction of Computer Vision, The 4-
R’s of Computer Vision and Challenges in Computer Vision, Low-level vs High-level processing,
Two View Geometry,

Binocular Stereopsis: Camera and Epipolar Geometry, Planar Scenes and Homography, Depth
estimation and multi-camera views, 3-D reconstruction, Auto-calibration, DLT and RANSAC,
Structure from Motion, Hough Transform, Interest Point Detection, Edge Detection, Local Binary
Pattern and its variants, Convolution and Filtering, Gaussian derivative filters, Gabor Filters, DWT,

Pyramids, Visual Matching: Bag-of-words, Pyramid Matching, Recognition: Detectors and

Descriptors, Optical Flow & Tracking, Shape, Texture, Color, Motion and Edges, Face Detection,
Feature Tracking and Motion Layers, SIFT and BRISK feature descriptor, Single Object
Recognition, Dense Neural Networks, Backpropagation, Convolutional Neural Networks (CNNs),
Image Quality Enhancement, Image Restoration, Super resolution, Residual Learning.

Various CNN Architectures: AlexNet, VGG16, MobileNet, InceptionNets, ResNets, DenseNets,

3D CNN for images and videos, Unsupervised image segmentation, Watershed, Level set, Active
Contour, Graph Cut, Supervised image segmentation, Agglomerative clustering, Segmentation as
pixel classification, UNets, FCN, Deep Generative Models, GANs, VAEs, PixelRNNs, NADE,
Normalizing Flows, Zero-shot, One-shot, Few-shot Learning, Self-supervised Learning,

Reinforcement Learning in Vision, Video Analytics, Spatial Domain Processing, Frequency

Domain Processing, Background Modelling, Crowd Analysis, Video Surveillance, Traffic
Monitoring and Intelligent Transport System, Optical Character Recognition, Online Character
Recognition, Visual Anomaly Detection, Anomalous action recognition, Post Estimation, Action
Recognition, Graph CNN, Shape Recognition, Shape Retrieval, Content based Image retrieval,
Visual Instance Recognition, Emotion Recognition from videos, Video Generation.
1. J. Nedumaan, Prof Thomas Binford, J. Lepika, J. Tisa, J. Ruby and P. S.
Jagadeesh Kumar, Modern Deep Learning and advanced Computer Vision
Text Books (1 ed.), missing, 2019. ISBN 9781708798641.
2. Rajalingappaa Shanmugamani, Deep Learning for Computer Vision (1
ed.), Packt Publishing, 2018. ISBN 9781788295628.
Reference 1. Krishnendu Kar, Mastering Computer Vision with TensorFlow (1 ed.),
Books missing, 2020. ISBN 9781838826939.
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Business Intelligence Course Code: CS-637
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
The course will enable the student to:
CO1 Analyze the impact of Business Intelligence (BI) theories, architectures,
and methodologies on the organizational decision-making process.
Course
CO2 Explain how different data can be integrated for querying and reporting to
Outcomes
improve the performance of marketing and sales strategies.
CO3 Build business projects and generate, manage BI reports
CO4 Perform BI deployment, administration and security
Topics to be covered:
Business Intelligence Concepts and Platform Capabilities: Understanding the scope of today’s BI
solutions and how they fit into existing infrastructure, assessing new options such as SaaS and cloud-
based technology, Describe BI, its components & architecture, Setting up Data for BI, The Functional
Area of BI Tools, Query Tools and Reporting, OLAP and its applications, difference between OLAP
and OLTP.

Data Visualization and Dashboard Design: Job responsibilities of BI analysts like creating data
visualization and dashboards, importance of data visualization, types of visualization methods,
determining effective visualization method, common characteristics and types of dashboards,
guidelines for designing dashboard.

Business Performance Management Systems: Use of BI for Business Performance Management

(BPM), components of BPM, purpose of performance measurement systems, determination of key
performance indicators (KPIs), difference between dashboard and scorecard, role of visual and
business analytics (BA) in BI.

BI Deployment, Administration and Security: Centralized Versus Decentralized Architecture, BI

Architecture Alternatives, phased & incremental BI roadmap, Measurements and Dependencies,
Expanding BI Authentication Authorization, Access Permissions, Groups and Roles, Single-sign on
Server Administration, Manage Status & Monitoring, Audit, Mail server & Portal integration.
1. Sharda, R., Delen, D., & Turban, E. (2015). Business Intelligence and
Analytics: Systems for Decision Support (10th ed.). Upper Saddle River, NJ:
Text Books
Pearson. ISBN-13: 978-0-13- 305090-5.
2. Business Intelligence (IBM ICE Publication).
Reference 1. Business Intelligence Roadmap: The Complete Project Lifecycle For
Books Decision-Support Applications" by Larissa T. Moss & Shaku Atre.

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Time Series Analysis Course Code: CS-638
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3

Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

lieu of internal assessment.

The course will enable the student to:
Course CO1 To explain the working of different components of a time series.
Outcomes CO2 To build autoregressive models for time series forecasting.
CO3 To implement multiple time series methods on real-world datasets.
Topics to be covered:
Purpose of Time Series Analysis, Descriptive techniques, Times series plots, Line chart, visualizing
multidimensional Time series, Visualizing multiple time series, Histograms, Seasonal effects and
trend identification, Transformations, Sample autocorrelation, Correlogram, Time series filtering,
Probability models, Stochastic processes, Bernoulli Process, Weiner process, Brownian Motion,
Ornstein-Uhlenbeck Process, Stationarity, Second-order stationarity, Autocorrelation.

White noise model, Random walks, moving average, Invertibility, ARIMA Models, Autoregressive
processes, Fitting an AR process, Yule–Walker equations, General linear process, Wold
decomposition theorem, Time series Forecasting, Exponential smoothing, Holt- Winters, Box-
Jenkins forecasting, Optimality models for exponential smoothing, Model selection for time series
forecasting.

Spectral analysis, Sinusoidal model, Wiener-Khintchine theory, Cramer representation, Periodogram

analysis, Statistical properties of periodogram, Consistent estimators of spectral density, Bivariate
processes, Cross-covariance, Cross-correlation, ARCH, GARCH.

Gaussian Process, Gaussian Regression, Vector autoregression models VAR, Structural Form,
Reduced Form, Parameter Estimation, Kernel Methods for forecasting, Adaptive filtering mechanism
for forecasting, Statistical Testing for stationarity, Augmented Dickey-Fuller, Kwiatkowski–
Phillips–Schmidt–Shin Test, Goodness of estimation.
1. Aileen Nielsen, Practical Time Series Analysis: Prediction with Statistics
and Machine Learning, 1st ed 2019, ISBN: 1492041653
Text Books 2. Terence C. Mills, Applied Time Series Analysis: A Practical Guide to
Modelling and Forecasting (1st ed) 2019, Academic Press, ISBN: 978-0-12-
813117-6
Reference 1. George E. P. Box, Gwilym M. Jenkins, Gregory C. Reinsel, Greta M.
Books: Ljung, Time Series Analysis : Forecasting And Control, (5th ed) 2016,
ISBN: 9781118675021

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Game Theory for Data Science Course Code: CS-639
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3
Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
The course will enable the student to:
CO1 Understand the concept of game theory: rationality, equilibrium,
dominance, backward induction,
Course
CO2 • The ability to apply solution concepts to examples of games, and to state
Outcomes
and explain them precisely

CO3 Analyse economic situations using game theoretic techniques

Topics to be covered:
Introduction to game theory, Games and solutions. Game theory and mechanism
design, Games to play, Strategic form games. Matrix and continuous games. Dominant and
dominated strategies, Nash Equilibrium; existence and uniqueness. Pareto efficiency

Mixed and correlated equilibrium. Equilibrium refinement, Computation of Nash equilibrium in

matrix games, Algorithms and their properties, Extensive games with perfect information,
Backward induction and subgame perfect equilibrium, Applications in bargaining games.

Nash bargaining solution, Evolutionary games. Evolutionarily stable strategies, Games with
incomplete information: Mixed and behavioral strategies. Bayesian Nash equilibrium,
Applications in auctions.

Different auction formats. Revenue and efficiency properties of different auctions, Repeated and
evolutionary games, Cooperative games, Shapley value and applications, Matching algorithms,
TTC and Gale-Shapley algorithm.

Parametric Mechanisms for Unverifiable Information, Nonparametric Mechanisms: Multiple

Reports, Nonparametric Mechanisms: Multiple Tasks, Prediction Markets: Combining Elicitation
and Aggregation, Agents Motivated by Influence, Decentralized Machine Learning
1. Faltings, Boi, and Goran Radanovic. "Game theory for data science:
Text Books Eliciting truthful information." Synthesis Lectures on Artificial Intelligence
and Machine Learning 11, no. 2 (2017): 1-151.
Reference 1. Osborne, M.J.An Introduction to Game Theory, Oxford University Press,
Books: 2004
2. Gibbons, R.A Primer in Game Theory,Pearson Education, 1992

Department: Computer Science and Engineering Programme: M. Tech. in DSE

Course Title: Machine Learning for Cyber- Course Code: CS-640
Physical Systems
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3

Course Assessment Methods: Two sessional exams and one end-semester exam, along with
assignments, presentations and class tests, which may be conducted by the course coordinator in
lieu of internal assessment.
The course will enable the student to:
CO1 Basic understanding of cyber-physical systems (CPS), characteristics and
its applications.
CO2 Understanding about the basic principles, techniques and applications of
Course
machine learning
Outcomes
CO3 Broad understanding of machine learning algorithms and their use in
data-driven knowledge discovery and program synthesis.
CO4 The ability to adapt or combine some of the key elements of existing
machine learning algorithms to design new algorithms for CPS.
Topics to be covered:
Cyber-Physical Systems (CPS) Overview: Introduction – CPS analysis by example, Application
domains, Significance; Hybrid system Vs CPS; Emergence of CPS; CPS Characterization; Analysis
of Representative Cps Domains.
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Learning Tools and Techniques for CPS: Introduction to learning models; data pre-processing and
tools used for pre-processing; Programming for learning models.

Supervised and Unsupervised learning models for CPS: Bayesian Networks; KNN classifier;
Decision Trees; Random Forest; Support Vector Machines; Introduction to Neural Networks;
Feedforward Neural Networks; Sequence modelling using RNN; Echo State Networks; Gated RNNs;
K-Means Clustering and its applications towards CPS, Graph theoretic clustering for CSP.

Reinforcement Learning: RL framework in CPS and its terminology, Introduction to Markov-

decision process, MDP formulation for CPS, Bellman Equations, Dynamic Programming and Monte
Carlo methods.

Model Integration in Cyber-Physical Systems: Introduction and Motivation; Basic Techniques –

Causality, Semantic Domains for Time, Interaction Models for Computational Processes, Semantics
of CPS DSMLs; Advanced Techniques- ForSpec, The Syntax of CyPhyML, Formalization of
Semantics, Formalization of Language Integration.

Applications of Machine Learning in Cyber-Physical Systems - Medical Cyber-Physical

Systems: Introduction and Motivation; System Description and Operational Scenarios - Virtual
Medical Devices, Clinical Scenarios; Key Design Drivers and Quality Attributes – Trends, Quality
Attributes and Challenges of the MCPS Domain, High-Confidence Development of MCPS, On-
Demand Medical Devices and Assured Safety, Smart Alarms and Clinical Decision Support Systems,
Closed-Loop System, Assurance Cases.
1. Rajkumar R, et al. “Cyber-physical systems”. Addison-Wesley
Text Books Professional, 2016.
2. E. Alpaydin, “Introduction to Machine Learning”, MIT Press, 2010.
1. C. Bishop, “Pattern Recognition and Machine Learning, Springer”, 2006.
Reference 2. H. Song, et al. “Cyber-physical systems: foundations, principles and
Books applications”. Morgan Kaufmann, 2016.
Department: Computer Science and Engineering Programme: M. Tech. in DSE
Course Title: Quantum Computing for Data Analysis Course Code: CS-641
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3

The course will enable the student to:

CO1 Basic understanding of quantum computing and quantum computation
with reference to the relevant concepts in quantum theory.
Course CO2 Understand the data representation and retrieval in quantum computers.
Outcomes CO3 Understanding of different SVE-based quantum computing algorithms by
simulating it on a classical computer with real datasets.
CO4 Applying the quantum algorithms for Monte Carlo and understand the q-
means algorithm with its analysis.
Topics to be covered:
Introduction to Quantum Computing: Qubits, Quantum Mechanics, Quantum gates, Vector
Spaces. Linear Combination of Vectors, Applications of quantum computing.

Matrices & Operators: Observables, The Pauli Operators, Outer Products & matrix representation,
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Operators Representation of using matrices, Eigen values & Eigen Vectors, Pauli Matrix, Hermitian
unitary and normal operator, Projection Operator, Positive Operators, Trace of an operator, important
properties of Trace, Expectation Value of Operator.

Classical data in quantum computers: Representing data in quantum computers, Access models,
Implementations, Block encodings, Importance of quantum memory models, QRAM architectures
and noise resilience, Working with classical probability distributions, Retrieving data.

Quantum Machine Learning: Quantum perceptron, Classical perceptron, Online quantum

perceptron, Version space quantum perceptron.

SVE-based quantum algorithms: Spectral norm and the condition number estimation, estimating
quality of representations, Extracting the SVD representations, Singular value estimation of a product
of two matrices, Slow algorithms for log-determinant.

Quantum algorithms for Monte Carlo: Monte Carlo with quantum computing, Bounded output,
Bounded ℓ2 norm, Bounded variance and its applications, Dimensionality reduction, Unsupervised
and Supervised algorithms .

q-means: The k-means algorithm, The q-means algorithm and its analysis.

QML on real datasets: Theoretical considerations, data pre-processing, Experiments on real

datasets.
1. Quantum Computation and Quantum Information, Michael A. Nielsen, Isaac
L. Chuang, ISBN 978-1-107-00217-3, Cambridge University Press.
Text Books 2. Practical Quantum Computing for Developers Programming Quantum Rigs
in the Cloud using Python, Quantum Assembly Language and IBM Q
Experience, Vladimir Silva, 978-1-4842-4217-9, Apress.

1. Quantum computing for everyone, Bernhardt, Chris, 9780262350914, The

MIT Press, 2019.
Reference
Books 2. Mathematics of Quantum Computing: An Introduction, Wolfgang Scherer,
9783030123581, Springer, 2019.

Department: Computer Science and Engineering Programme:

Course Title: Financial Data science and Analytics Course Code: CS-643
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3
The course will enable the student to:
CO1 Analyze the impact of Data science in Finance, and its architectures.
CO2 Understanding the role of data science methodologies in the organization
Course for decision-making process. And explore the data integrated to querying
Outcomes and reporting to improve the performance of finance management.
CO3 Build Financial projects and generate, manage the accounts reports.
CO4 Performance of Financial management tools with the help of data science
methodology with Security.
Topics to be covered:
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Introduction of Finance in Data Analytics: Understanding the scope of Data Science and Its
solutions in Finance, how data science fit into existing infrastructure, assessing new options such
Cloud and Artificial Intelligence technology, describe finance management its components &
architecture,

Role and Responsibilities of Data Science in Finance: The key role and responsibility of Data
science in Accounts and Finance. The Functional Area of Data analytics Tools, Query Tools and
Reporting, OLAP and its applications, the key process and Matrices of accounts and finance with the
help of data science.

Data Science Workflow in Finance: Analysis the role of data science in Financial Management like
creating data visualization of Finance management, Descriptive Analytics to derive insights from
data, Workflow Optimization and Process Improvements in finance and Accounts Record, analysis
the predictive learning process and core concept of data analytics and data science in finance
Management.

Predictive Analytics application and Challenges of data science in Finance: Predictive Analytics
core concepts Machine Learning application in Finance. Limitations of Data Science adaption in
Finance Challenges in transition, Data Science Industry use case in Finance domain.
1. Ruey S. Tsay (2012), “An Introduction to Analysis of Financial Data with
R”, Wiley, ISBN: 978-0-470-89081-3
Text Books 2. Irene Aldridge and Marco Avellaneda, “Big Data Science in Finance”
ISBN: 978-1119602989

1. Argimiro Arratia (2014), “Computational Finance An Introductory Course

with R”, Atlantis Press, ISBN 978-94-6239-069-0
Reference
Books 2. David Ruppert (2011), “Statistics and Data Analysis for Financial
Engineering”, Springer, ISBN978-1-4419-7786-1

Department: Computer Science and Engineering Programme: M. Tech. CSE(DS)

Course Title: Bioinformatics in Data Science Course Code: CS- 644
Course Designation: Elective
L T P C
Credit Scheme
3 0 0 3

Topics to be covered:
The Beginning of Bioinformatics: Margaret Dayhoff, Richard Eck, Robert Ledley, and the
Beginning of Bioinfomatics; Definition of Bioinformatics; Bioinformatics Versus Computational
Biology; Goals of Bioinformatic Analysis; Bioinformatics Technical Toolbox.
Dr. B R AMBEDKAR NATIONAL INSTITUTE OF TECHNOLOGY, JALANDHAR
G T Road Bye Pass, Jalandhar-144011, Punjab (India)
Department of Computer Science and Engineering
Scheme of M. Tech. in Data Science & Engineering

Data, Databases, Data Format, Database Search, Data Retrieval Systems, and Genome
Browsers: Genomic Data; Sequence Data Formats - FASTA Format, PHYLIP Format; Conversion
of Sequence Formats Using Readseq; Primary Sequence Databases—GenBank, EMBL-Bank,
DDBJ, Sequence Submission to the Databases, Availability of the Submitted Sequence to the Public,
Sequence Flatfile Format, Sequence Accession Numbers and Redundancy in Primary Databases,
Divisions of the NCBI Primary Sequence Database; Secondary Databases; Some Examples of
Publicly Available Secondary and Specialized Databases; Data Retrieval; An Example of Retrieval
of mRNA/Gene Information; Data Visualization in Genome Browsers; Using Map Viewer to Search
the Genome.

Sequence Alignment and Similarity Searching in Genomic Databases - BLAST and FASTA:
Evolutionary Basis of Sequence Alignment; Sequence Identity and Sequence Similarity; Global
Versus Local Alignment; Pairwise and Multiple Alignment; Alignment Algorithms, Gaps, and Gap
Penalties; Scoring Matrix, Alignment Score, and Statistical Significance of Sequence Alignment;
Database Searching with the Heuristic Versions of the Smith-Waterman Algorithm—BLAST and
FASTA; Sequence Comparison, Synteny, and Molecular Evolution.

Big Data Analytics in Bioinformatics: Introduction - Big data in bioinformatics, Types of big data
in bioinformatics, Big data problems in bioinformatics, Techniques for big data Analytics;
Architectures for big data analytics - MapReduce architecture, Fault tolerant graph architecture,
Streaming graph architecture.

Machine learning for big data analytics: Feature Selection, Supervised Learning, Unsupervised
learning, Deep Learning, Inference of Large Scale GRN with Association Rule Mining; Challenges
and issues in big data analytics - Challenges in big data analytics, Issues in big data Analytics;

Tools for big data analytics in bioinformatics: Tools for microarray data analysis; Tools for gene-
gene network analysis; Tools for PPI data analysis; Tools for sequence analysis; Tools for pathway
analysis;

1. Choudhuri, S. “Bioinformatics for beginners: genes, genomes, molecular

evolution, databases and analytical tools”. Elsevier, 2014.
Text Books
2. H Kashyap, et al. “Big data analytics in bioinformatics: A machine learning
perspective”, 2015.
1. Tan, T. W. et al. “Beginners Guide to Bioinformatics for High Throughput
Sequencing”. World Scientific, 2018.
2. Satpathy, R., et al. “Data Analytics in Bioinformatics: A Machine Learning
Reference
Perspective”. John Wiley & Sons, 2021.
Books
3. Neil Jones and Pavel Pevzner, An Introduction to Bioinformatics
Algorithms.

*END of Curriculum for M. Tech. in DSE*****\

Artificial Intelligence in Banking System Hdfc1
No ratings yet
Artificial Intelligence in Banking System Hdfc1
91 pages
SMS Lift Controller
88% (8)
SMS Lift Controller
40 pages
MTechSyllabus CSE DataScience
No ratings yet
MTechSyllabus CSE DataScience
60 pages
Curriculum 621202591224
No ratings yet
Curriculum 621202591224
156 pages
Computer - Science - and - Engineering - 2023-NITW Syllabus
No ratings yet
Computer - Science - and - Engineering - 2023-NITW Syllabus
69 pages
Btech Syllabus Cse 2018 31545
No ratings yet
Btech Syllabus Cse 2018 31545
100 pages
Data Science Concept Note
No ratings yet
Data Science Concept Note
3 pages
Fet New Self-Finance BTech and MTech Programs
No ratings yet
Fet New Self-Finance BTech and MTech Programs
6 pages
Undergraduate Programs: Computer Science & Engineering (Data Science)
No ratings yet
Undergraduate Programs: Computer Science & Engineering (Data Science)
108 pages
1722496821005-M Tech
No ratings yet
1722496821005-M Tech
32 pages
CS IIT Madras
No ratings yet
CS IIT Madras
4 pages
Curriculum Booklet CSE-Core 22-26
No ratings yet
Curriculum Booklet CSE-Core 22-26
319 pages
M.Tech. Syllabus (IIIT Kalyani) Course Structure (2021.03.02) 2 Senate Approved
No ratings yet
M.Tech. Syllabus (IIIT Kalyani) Course Structure (2021.03.02) 2 Senate Approved
5 pages
M.tech (CSE) Data Science-Int 2019 2020
No ratings yet
M.tech (CSE) Data Science-Int 2019 2020
163 pages
Detailed Curriculum Contents
No ratings yet
Detailed Curriculum Contents
137 pages
Syllabus - Int. B.tech & M.tech (CSE)
No ratings yet
Syllabus - Int. B.tech & M.tech (CSE)
176 pages
Btech Ai Bitj 2023
No ratings yet
Btech Ai Bitj 2023
12 pages
LecturePlan CS201 21CSH-471
No ratings yet
LecturePlan CS201 21CSH-471
8 pages
Syllabus Data Science 2020
No ratings yet
Syllabus Data Science 2020
93 pages
Admissions Brochure MSC DS 2025
No ratings yet
Admissions Brochure MSC DS 2025
6 pages
Sy Cse Ds Syllabus 23102024
No ratings yet
Sy Cse Ds Syllabus 23102024
19 pages
B.Tech AI &DS Curriculum - 16102020
No ratings yet
B.Tech AI &DS Curriculum - 16102020
64 pages
Old Syllabi
No ratings yet
Old Syllabi
132 pages
CSE (DS) R22 II Year Syllabus
No ratings yet
CSE (DS) R22 II Year Syllabus
42 pages
CSE (Data Science)
No ratings yet
CSE (Data Science)
3 pages
B.Tech CSE
No ratings yet
B.Tech CSE
34 pages
B TechinDataScience
No ratings yet
B TechinDataScience
5 pages
MTech AIML Syllabus 2022-23
No ratings yet
MTech AIML Syllabus 2022-23
130 pages
M.tech CSE Course-Curriculum Ver-3
No ratings yet
M.tech CSE Course-Curriculum Ver-3
10 pages
Mtech Cse
No ratings yet
Mtech Cse
105 pages
M.TECH Syllabus 2021 AI
No ratings yet
M.TECH Syllabus 2021 AI
104 pages
Complete Syllabus R2022
0% (1)
Complete Syllabus R2022
626 pages
M.Tech.: Data Science & Engineering
No ratings yet
M.Tech.: Data Science & Engineering
17 pages
B.Tech CSE BS 2021 2022
No ratings yet
B.Tech CSE BS 2021 2022
184 pages
B.Tech - AIDS - 2024 - 2024 7 8 20 14 5
No ratings yet
B.Tech - AIDS - 2024 - 2024 7 8 20 14 5
153 pages
Handbook AY2023-24 Odd
No ratings yet
Handbook AY2023-24 Odd
63 pages
B.tech - CSE - AI & ML - 2020 - 2021 - Curriculum and Syllabus V4
100% (1)
B.tech - CSE - AI & ML - 2020 - 2021 - Curriculum and Syllabus V4
263 pages
B.tech - CSE - AI & ML - 2020 - 2021 - Curriculum and Syllabus V4 Aug 13-2021
No ratings yet
B.tech - CSE - AI & ML - 2020 - 2021 - Curriculum and Syllabus V4 Aug 13-2021
185 pages
Computer & Communication Course
No ratings yet
Computer & Communication Course
36 pages
Dev CF
No ratings yet
Dev CF
29 pages
B.tech AI DS Brochure
No ratings yet
B.tech AI DS Brochure
5 pages
AIA Final SOC Sept24
No ratings yet
AIA Final SOC Sept24
224 pages
Data Science & Engineering: M.Tech
No ratings yet
Data Science & Engineering: M.Tech
18 pages
MTech DATA SCIENCE & ENGINEERING HCL - 0
No ratings yet
MTech DATA SCIENCE & ENGINEERING HCL - 0
11 pages
B.Tech CSE-2
No ratings yet
B.Tech CSE-2
144 pages
MTech-Course-Structure-AI-and-Data Science
No ratings yet
MTech-Course-Structure-AI-and-Data Science
5 pages
M.SC Data Science Syllabus
No ratings yet
M.SC Data Science Syllabus
116 pages
B.Tech AI DS Brochure 2024 - Compressed
No ratings yet
B.Tech AI DS Brochure 2024 - Compressed
5 pages
PES MTech Brochure
No ratings yet
PES MTech Brochure
12 pages
M.Tech. (Computational & Data Science) Admissions Brochure, 2021
No ratings yet
M.Tech. (Computational & Data Science) Admissions Brochure, 2021
1 page
Curriculum and Syllabi (2020-2021) : School of Computer Science and Engineering
No ratings yet
Curriculum and Syllabi (2020-2021) : School of Computer Science and Engineering
26 pages
M.tech (CSE) 2021 2022 Portion
No ratings yet
M.tech (CSE) 2021 2022 Portion
69 pages
Cs&se Naac
No ratings yet
Cs&se Naac
74 pages
Admission Brochure
No ratings yet
Admission Brochure
7 pages
BOS CSE-Data Science (10!5!25)
No ratings yet
BOS CSE-Data Science (10!5!25)
39 pages
Curriculum and Syllabus - CSE - Feb 2025
No ratings yet
Curriculum and Syllabus - CSE - Feb 2025
251 pages
R22 B.tech DS Course Structure and Contents
No ratings yet
R22 B.tech DS Course Structure and Contents
135 pages
DL Lab Manual A.Y 2022-23-1
100% (1)
DL Lab Manual A.Y 2022-23-1
67 pages
NIT Warangal Curriculum
No ratings yet
NIT Warangal Curriculum
90 pages
Syllabus
No ratings yet
Syllabus
157 pages
M.Tech 2025
No ratings yet
M.Tech 2025
27 pages
Machine Learning Mastery for Engineers
From Everand
Machine Learning Mastery for Engineers
Abdellatif Sadeq
No ratings yet
Business Management Science
No ratings yet
Business Management Science
5 pages
Aws Minikube
No ratings yet
Aws Minikube
9 pages
Data For Practise
No ratings yet
Data For Practise
2 pages
Research Proposal
No ratings yet
Research Proposal
3 pages
SHS LCS Q1 Las Le2
No ratings yet
SHS LCS Q1 Las Le2
6 pages
Fisica1 Apuntes
100% (1)
Fisica1 Apuntes
220 pages
RD 01 Mus 2
No ratings yet
RD 01 Mus 2
9 pages
2 - Benefits of IEEE Membership and Join IEEE
No ratings yet
2 - Benefits of IEEE Membership and Join IEEE
15 pages
NB 06 Cisco en Software Matrix
No ratings yet
NB 06 Cisco en Software Matrix
2 pages
Staad Aashto LRFD Parameters
No ratings yet
Staad Aashto LRFD Parameters
2 pages
Breaking The Chain
No ratings yet
Breaking The Chain
42 pages
ABIO - AirScale - Capacity - Datasheet
No ratings yet
ABIO - AirScale - Capacity - Datasheet
4 pages
Controllable Sentence Simplification With A Unified Text-to-Text Transfer Transformer
No ratings yet
Controllable Sentence Simplification With A Unified Text-to-Text Transfer Transformer
12 pages
Libre Office Writer MCQ
No ratings yet
Libre Office Writer MCQ
13 pages
Application of Cognitive Ergonomics To The Control Room Design of Advanced Technologies
No ratings yet
Application of Cognitive Ergonomics To The Control Room Design of Advanced Technologies
40 pages
Testbank and Solutions For Microelectronic Circuits 7th Edition
No ratings yet
Testbank and Solutions For Microelectronic Circuits 7th Edition
18 pages
Introduction To Computer L1-L3
No ratings yet
Introduction To Computer L1-L3
66 pages
Print On Demand
No ratings yet
Print On Demand
41 pages
TR 23689330.01.1.w
No ratings yet
TR 23689330.01.1.w
20 pages
Thinmanager 13.2 Thin Client Management Platform: User Manual
No ratings yet
Thinmanager 13.2 Thin Client Management Platform: User Manual
638 pages
Quectel BC660K-GL TCPIP Application Note V1.1
No ratings yet
Quectel BC660K-GL TCPIP Application Note V1.1
37 pages
Updated FDPP Request For Rectification Form
No ratings yet
Updated FDPP Request For Rectification Form
2 pages
Katalog - Body Vzplanuti PDF
No ratings yet
Katalog - Body Vzplanuti PDF
44 pages
18.10.2007 Electroni 3rd Year RAGHVENDRA KUMAR
No ratings yet
18.10.2007 Electroni 3rd Year RAGHVENDRA KUMAR
31 pages
University Licensure Examination Reviewer For Teacher: A Framework For Developing Gamified Examination
No ratings yet
University Licensure Examination Reviewer For Teacher: A Framework For Developing Gamified Examination
14 pages
Students File - S4
No ratings yet
Students File - S4
6 pages
MT 199 Corrección
No ratings yet
MT 199 Corrección
3 pages
Intelligent Transportation Systems Using External Infrastructure: A Literature Survey
No ratings yet
Intelligent Transportation Systems Using External Infrastructure: A Literature Survey
18 pages
Stock Ledger
0% (1)
Stock Ledger
25 pages
290 Assignment 1 - Neuroscience in The Media Outline
No ratings yet
290 Assignment 1 - Neuroscience in The Media Outline
5 pages
New Microsoft Excel Worksheet
No ratings yet
New Microsoft Excel Worksheet
171 pages