MTechData Science&Engineering

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
CURRICULUM AND SYLLABUS
Under CBCS
(Applicable for Students admitted from Academic Year 2018-19)
MTech (COMPUTER SCIENCE AND ENGINEERING)

SPECIALIZATION IN DATA SCIENCE AND ENGINEERING
SCHOOL OF COMPUTING SCIENCES

CURRICULUM AND SYLLABUS M.TECH – COMPUTER SCIENCE AND ENGINEERING
HINDUSTAN INSTITUTE OF TECHNOLOGY & SCIENCE
VISION AND MISSION
MOTTO
“To Make Every Man a Success and No Man a Failure”
VISION
To be an International Institute of Excellence, providing a conducive environment for
education with a strong emphasis on innovation, quality, research and strategic partnership blended with values
and commitment to society.
MISSION
To create an ecosystem that promotes learning and world class research.

To nurture creativity and innovation.
To instill highest ethical standards and values.
To pursue activities for the development of the Society.
To develop national and international collaborations with institutes and industries of eminence.
To enable graduates to become future leaders and innovators.
Value Statement
Integrity, Innovation, Internationalization

VISION AND MISSION
VISION
To excel in Computer Science and Engineering education, research and project management by
empowering the students with strong conceptual knowledge.
MISSION
M1. To educate the students with basic foundation blocks of core and allied disciplines of Computer
Science and Engineering.
M2. To provide practical skills in the advancements of the Computer Science and Engineering field required for
the growing dynamic IT and ITES industries.
M3. To sculpt strong personal, technical, research, entrepreneurial, and leadership skills.
M4. To inculcate knowledge in lifelong learning, professional ethics and contribution to the society.
M.Tech (COMPUTER SCIENCE AND ENGINEERING)
PROGRAMME EDUCATIONAL OBJECTIVES (PEO)
The program is expected to enable the students to
PEO I Excel in their professional career by applying advanced knowledge and/or pursue higher
education including research by applying the knowledge of Computer Science and
Engineering.
PEO II Asses the industry requirements and provide tangible solutions with social
consciousness and ethical values.
PROGRAM OUTCOMES (ALIGNED WITH GRADUATE ATTRIBUTES) (PO)
At the end of this program, graduates will be able to
PO1 Scholarship of knowledge: Acquire in-depth knowledge of specific discipline or professional

area, including wider and global perspective, with an ability to discriminate, evaluate,
analyses and synthesize existing and new knowledge, and integration of the same for
enhancement of knowledge.
PO2 Critical Thinking: Analyze complex engineering problems critically, apply independent judgment for
synthesizing information to make intellectual and/or creative advances for conducting research
in a wider, theoretical, practical and policy context.
PO3 Problem Solving: Think laterally and originally, conceptualize and solve engineering problems,
evaluate a wide range of potential solutions for those and arrive at feasible, optimal solutions after
considering public health and safety, cultural, societal and environmental factors in the core
areas of expertise.
PO4 Research Skill: Extract information pertinent to unfamiliar problems through literature survey and
experiments, apply appropriate research methodologies, techniques and tools, design, conduct
experiments, analyze and interpret data,, demonstrate higher order skill and view things in a
broader perspective, contribute individually / in group(s) to the development of scientific of
scientific / technological knowledge in one or more domains of engineering.
PO5 Usage of modern tools: Create, select, learn, and apply appropriate techniques, resources,
and engineering and IT tools, including prediction and modeling, to complex engineering activities
with an understanding of the limitations.
PO6 Collaborative and multidisciplinary work: Process knowledge and understanding of group
dynamics, recognize opportunities and contribute positively to collaborate- multidisciplinary
scientific research, demonstrate a capacity for self-management and teamwork, decision—
making based on open-mindedness, objectivity and rational analysis in order to achieve
common goals and further the learning of themselves as well as others.
PO7 Project Management and Finance: Demonstrate knowledge and understanding of
engineering and management principles and apply the same one’s own work, as a member
and leader in a team, manage projects efficiently in respective disciplines and multidisciplinary
environments after consideration of economic and financial factors.
PO8 Communication: Communicate with engineering community, and with society at large, regarding
complex engineering activities confidentially an effectively, such as, being able to comprehend
and write effective reports and design documentation by adhering to appropriate standards, make
effective presentations, and give and receive clear instructions.
PO9 Life-Long Learning: Recognize the need for, and have the preparation and ability to engage in
life-long learning independently, with a high level of enthusiasm and commitment to
improve knowledge and competence continuously.
PO10 Ethical Practices and Social Responsibility: Acquire professional and intellectual
integrity, professional code of conduct, ethics of research and scholarship,
consideration of the impact of research outcomes on professional practices and an
understanding of responsibility to contribute to the community for sustainable
development of society.
PO11 Independent and Reflective Learning: Observe and examine critically the outcomes of one’s
actions and make corrective measures subsequently, and learn from mistakes without
depending on external feedback
PROGRAM SPECIFIC OUTCOMES (PSO)
PSO1: Posses knowledge in Advanced Operating System, Advance Data Base Technology,
Advanced Data Structures & Algorithms for analyzing and the solving complex problem.
PSO2: Acquire the skill set especially in Data Science and Engineering, Software
Engineering and Information Security.
PSO3: Solve complex problems through innovative system design using modern tools and
techniques.
M.Tech - COMPUTER SCIENCE AND ENGINEERING
(65 CREDITS STRUCTURE)

SEMESTER – I
SL. COURSE COURSE
NAME OF THE COURSE L T P C S TCH
NO CATEGORY CODE
1 BS MAA3706 Statistics for Computer Science + 3 0 2 4 1 5
Advanced Data Structures and

2 PC CSA3701 2 0 2 3 1 4
Algorithms +
3 PC CSA3702 Machine Learning + 2 0 2 3 2 4
4 PE CSA**** Department Elective - I 3 0 0 3 0 3
5 PE CSA**** Department Elective - II 3 0 0 3 0 3
6 PC ZZZ3715 Research Methodology & IPR* 2 0 0 2 0 2
PRACTICAL
7 PC CSA3781 Mini project 0 0 6 2 0 6
Total 20 4 27
SEMESTER – II
SL. COURSE COURSE
NO CATEGORY CODE
1 PC CSA3703 Advanced Operating Systems 2 0 2 3 1 4
2 PC CSA3704 Soft computing 3 1 0 4 1 5
3 PC CSA3705 Advanced Data Base Technology 2 1 2 4 1 5
4 PC CSA3706 MOOC Course 0 0 0 2 3 3
5 PE CSA**** Department Elective - III 3 0 0 3 0 3
6 OE ****** Open Elective 2 0 0 2 0 2
PRACTICAL
7 PC CSA3751 Seminar 0 0 3 2 0 2
Total 20 6 24
*Research Methodology & IPR is a compulsory Course.

+
Professional Core papers Common to M.Tech. CSE and M.Tech. IT
SEMESTER – III
SL. COURSE COURSE
NO CATEGORY CODE
1 PE CSA**** Department Elective – IV 3 0 0 3 0 3
PRACTICAL
2 PC CSA3782 Project Phase –I 0 0 24 8 0 24
Internship/Mini Project 2 0
Total 13 27
SEMESTER –
IV
SL. COURSE COURSE
NO CATEGORY CODE
PRACTICAL
1 CSA3783 PC Project Phase –II 0 0 24 12 0 24
Total 12 24
ELECTIVE I – SPECIALIZATION IN DATA SCIENCE AND ENGINEERING

SL. COURSE COURSE NAME OF THE COURSE L T P C S TCH
NO CATEGORY CODE
1 PE CSB3721 Data Storage Technologies 3 0 0 3 0 3
2 PE CSB3722 Recommender System 3 0 0 3 0 3
3 PE CSB3723 Agent Based Intelligent Systems 3 0 0 3 0 3
ELECTIVE II – SPECIALIZATION IN DATA SCIENCE AND ENGINEERING
SL. COURSE COURSE
NO CATEGORY CODE
1 PE CSB3724 Data Warehousing and Data Mining 3 0 0 3 0 3
2 PE CSB3725 Big Data Analytics 3 0 0 3 0 3

PE CSB3726 Data Classification Methods and
3 3 0 0 3 0 3
Evaluation
ELECTIVE III – SPECIALIZATION IN DATA SCIENCE AND ENGINEERING
SL. COURSE COURSE
NO CATEGORY CODE
1 PE CSB3727 Data Visualization Techniques 3 0 0 3 0 3
2 PE CSB3728 Hadoop Administration 3 0 0 3 0 3
3 PE CSB3729 Principles of Deep Learning 3 0 0 3 0 3

ELECTIVE IV – SPECIALIZATION IN DATA SCIENCE AND ENGINEERING
SL. COURSE COURSE
NO CATEGORY CODE
1 PE CSB3730 Web Analytics and Development 3 0 0 3 0 3
2 PE CSB3731 Virtual Reality 3 0 0 3 0 3
3 PE CSB3732 Risk Analysis and Management 3 0 0 3 0 3

SEMESTER – I
COURSE TITLE STATISTICS FOR COMPUTER SCIENCE CREDITS 4

COURSE CODE MAA3706 COURSE CATEGORY BS L-T-P-S 3- 0- 2- 1
CIA 60% ESE 40%
LEARNING LEVEL BTL-3 - APPLY
Prerequisite : NIL
CO OUTCOMES PO
1 Develop statistical models for business analytics 1
Use forecasting methods to support managerial, financial, and operational
2 7
statistics.
3 Perform marketing analytics using statistical models. 4
4 Analyze customer data for customer acquisition, retention, and profitability 7
5 Analysis of variance 4
MODULE: PROBABILITY (12)
Introduction to probability –Bayes theorem-Random variables-discrete random variable (Binomial, Poisson,
Geometric), Continues random variable (Uniform, Exponential and Normal distribution). Moment generating
function.
Suggested Activities: Basic knowledge on probability
Suggested sources: Introduction to probability
MODULE 2: TWO DIMENSIONAL RANDOM VARIABLES (12)

Joint distribution –Marginal and conditional distribution covariance –correlation and regression (linear and
Multiple). Central limit theorem, Chebyshev’s inequality.
Suggested Activities: Basic knowledge on probability
Suggested sources: Probability, Statistics and Random Processes-T.Veerarajan
MODULE 3: THEORY OF SAMPLING AND TEST OF HYPOTHESIS (12)

Introduction to hypothesis, Large and small samples test -mean and variance (single and double), test,
Independent of attributes and contingency table.
Suggested Activities: Basic knowledge of sampling
MODULE 4: TIME SERIES ANALYSIS (12)

Introduction to Stochastic process, Time series as a discrete stochastic process. Stationarity, Main
characteristics of stochastic process (mean, auto covariation and auto correlation function).
Autoregressive models AR (p), Yull-Worker equation Auto regressive moving average models ARMA.
Seasonality in Box –Jenkins model.
Suggested Activities: Basic knowledge of Time series analysis
Suggested sources: Time series-Maurice George kendall,j.k.Ord
MODULE 5: DESIGN OF EXPERIMENTS (12)

Analysis of variance (one way & two ways) classification – completely randomized design –
randomized block design – Lattin square design.
Suggested Activities: Basic knowledge of design of experiments
TEXT BOOKS
T.Veerarajan , “Probability, Statistics and Random Processes” Tata McGraw-Hill,Education
1 2008
Maurice George Kendall, J. K. Ord,”Time series” Oxford University Press, 1990
2
REFERENCE BOOKS
1 K.S.Trivedi.John , “Probability and statistics with reliability, Queuing and computer Science
Application”, Second edition, Wiley&Son, 2016
2 Levin Richard and Rubin Davids, “Statistics for Management “, Pearson Publications,2016
3 Robert Stine, Dean Foster ,“Statistical for Business: Decision Making and Analysis”. Pearson
Education, 2nd edition ,2013
E BOOKS
http://www.math.harvard.edu/~knill/teaching/math144_1994/probability.pdf
1
http://www.dartmouth.edu/~chance/teaching_aids/books_articles/probability_book/book.pd
2 f
MOOC
1 https://nptel.ac.in/courses/IIT-MADRAS/Principles_of_Communication1/Pdfs/1_5.pdf
2 https://nptel.ac.in/courses/110104024/
COURSE TITLE ADVANCED DATA STRUCTURES AND ALGORITHMS CREDITS 3

COURSE CODE CSA3701 COURSE CATEGORY PC L-T-P-S 2- 0- 2- 1
CIA 60% ESE 40%
LEARNING LEVEL BTL-4 - ANALYZE
CO OUTCOMES PO
1 Estimate time and space complexities for a given algorithm. 1,2
Describe the heap property and the use of heaps as an implementation of
2 1,2,3
priority queues.
3 Illustrate the various self- balanced trees and their operations. 1,2,3
4 Apply an appropriate algorithmic approach to a given problem. 1,2,3,4,5
5 Illustrate parallel algorithm models. 1,2,3,4
6 Use a heuristic approach to solve an appropriate problem. 1,2,3,4,5
Prerequisites : 1. Fundamentals of Data Structures 2. Design and Analysis of Algorithm

MODULE 1: INTRODUCTION (9)
Abstract Data Types - Time and Space Analysis of Algorithms - Big Oh and Theta Notations - Average,
best and worst case analysis - Simple recurrence relations – Mappings.
Suggested Activities: Find the time and space complexities of the following algorithms
1. Sum of n numbers 2. Factorial of a n 3. Matrix multiplication 4. Insertion sort
Suggested sources: https://nptel.ac.in/courses/106105164/
https://nptel.ac.in/courses/106105085/18
MODULE 2: HEAP STRUCTURES (9)

Min-max heaps - Heaps - Leftist heaps -Binomial heaps - Fibonacci heaps - Skew heaps - Lazy- binomial
heaps.
Suggested Activities: Implement the following Heap structures using C, C++, Java or Python
1. Max-min Heap 2. Binomial Heap 3. Fibonacci Heap
Suggested sources: https://nptel.ac.in/courses/106102064/20, 21
MODULE 3: SEARCH STRUCTURES (9)

Binary search trees - AVL trees - 2-3 trees - 2-3-4 trees - Red-black trees - B-trees - splay trees – k-d trees,Tries.
Suggested Activities: Implement the following tree structures using C, C++, Java or Python
1. AVL Tree 2. Red-Black tree 3. Splay Trees 4. K-d Trees 5. Tries
Suggested sources: https://nptel.ac.in/courses/106102064/11, 12,14,15,18
MODULE 4: ALGORITHM DESIGN TECHIQUES (9)

Divide and Conquer and Greedy : Quick sort - Strassen’s matrix multiplication - Convex hull - Tree- vertex
splitting - Job sequencing with deadlines - Optimal storage on tapes Dynamic Programming and Backtracking:
Multistage graphs - 0/1 knapsack - 8- queens problem - graph coloring, Palindrome partitioning.
Suggested Activities: Solve the following problems
1. Quicksort 2. Strassen’s matrix multiplication 3. 8-queens problem 4. Palindrome
Partitioning
Suggested Sources: https://nptel.ac.in/courses/106106131/15,

https://nptel.ac.in/courses/106102011/7
MODULE 5: ADVANCED ALGORITHMS (9)

Parallel Algorithms: Basic Techniques- Work & Efficiency - Distributed Computation - Heuristic &
Approximation Approaches.
Suggested Activities: Implement following heuristic algorithms
1. Hill Climbing 2. Simulated Annealing 3. Particle Swarm Optimization 4. Genetic Algorithm
Suggested sources: https://nptel.ac.in/courses/106104120/4, 5

https://nptel.ac.in/courses/106106126/9 - 15
TEXT BOOKS
Thomas H.Coremen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein , "Introduction to
1 algorithms", Third edition, MIT press,2013
REFERENCE BOOKS
1 E. Horowitz, S.Sahni and Dinesh Mehta, Fundamentals of Data structures in C++, University
Press, 2009.
2 E. Horowitz, S. Sahni and S. Rajasekaran, Computer Algorithms/C++, Second Edition, University
Press, 2007.
3 Mark Allen Weiss, "Data Structures and Algorithm Analysis in C", Third Edition, Pearson
Education, Asia.2007.
4 Ananth Grama, Anshul Gupta, George Karypis, Vipin Kuma, “Introduction to Parallel Computing
“, Second Edition, Addison Wesley, 2003
E BOOKS
Omid Bozorg-Haddad, Mohammad Solgi, Hugo A. LoÃ¡iciga, “Meta-heuristic and Evolutionary
1 Algorithms for Engineering Optimization 1st Edition”, Wiley , 2017
Introduction To Parallel Computing - ResearchGate - Free Ebook, www.researchgate.net
2
MOOC
1 Advanced Data structures and Algorithms , https://nptel.ac.in/courses/106105164/
2 Artificial Intelligence Search Methods for problem Solving,
https://onlinecourses.nptel.ac.in/noc18_cs51/
COURSE TITLE MACHINE LEARNING CREDITS 3

CIA 60% ESE 40%
LEARNING LEVEL BTL-4 - ANALYZE
CO OUTCOMES PO
1 Apply multilayer perceptron using simple machine learning techniques. 1,2,3
2 Use decision trees and statistics models 1,2,3
3 Use data analysis for machine learning 1,2,3
4 Use Genetic algorithm and reinforced learning for appropriate applications 1,2,3
5 Use the Python programming for machine learning. 1,2,3,5

Prerequisites : NIL
MODULE 1: Introduction (6+6)
Learning - Types of machine learning - Supervised learning - The brain and the neurons, Linear
Discriminants -Perceptron - Linear Separability -Linear Regression - Multilayer perceptron - Examples
of using MLP - Back propagation of error.
Suggested Activities: Design a Multilayer Perceptron for Rain Forecasting system

Suggested sources: Enrico C, Simon W, Jay R, Machine Learning Techniques for Space Weather,
Elsevier, 2018
MODULE 2: Classification Algorithms (6+6)
Decision trees - Constructing decision trees - Classification of regression trees - Regression example
- Probability and Learning: Turning data into probabilities - Some basic statistics - Gaussian mixture models -
Nearest Neighbor methods.
Suggested Activities: Explore the Regression Examples in Machine Learning

Suggested sources: Norman Matlof, “Statistical Regression and Classification: From Linear Models to
Machine Learning”, CRC Press, 2017.
MODULE 3: Analysis (6+6)
The k-Means algorithm - Vector Quantization’s - Linear Discriminant Analysis - Principal component analysis -
Factor Analysis - Independent component analysis - Locally Linear embedding – Isomap - Least squares
optimization - Simulated annealing.
Suggested Activities: Simulated annealing / Modelling on any data science application.

Suggested sources: L.M. Rasdi, Simulated Annealing Algorithm for Deep Learning, Procedia
Computer Science, Volume: 72, 2015.
MODULE 4: Optimization Techniques (6+6)

The Genetic algorithm - Genetic operators - Genetic programming - Combining sampling with genetic
programming - Markov Decision Process - Markov Chain Monte Carlo methods: sampling - Monte carlo -
Proposal distribution.
Suggested Activities: Design an Encryption algorithm using Genetic algorithm

Suggested sources:Harsh Bhasin, Application of Genetic Algorithms in Machine learning,,
International Journal of Computer Science and Information Technologies, Vol. 2 (5), 2011.
MODULE 5: Python for Machine Learning (6+6)
Baysean Networks - Markov Random moFields - Hidden Markov Models -Tracking methods. Python: Installation -
Python for MATLAB AND R users - Code Basics - Using NumPy and MatPolitB.
Suggested Activities: Design a simple application using NumPy and MatPolitB.

Suggested sources: Rakshith Vasudev, Introduction to Numpy -1 : An absolute beginners guide to Machine
Learning and Data science., 2017.
TEXT BOOKS
1 Kevin P. Murphy, “Machine Learning – A probabilistic Perspective”, MIT Pres, 2016.
2 Randal S, “Python Machine Learning, PACKT Publishing, 2016.
REFERENCE BOOKS
1 Ethem Alpaydin, "Machine Learning: The New AI”, MIT Press, 2016.
2 Shai Shalev-Shwartz, Shai Ben-David, "Understanding Machine Learning: From Theory to
Algorithms”, Cambridge University Press, 2014.
3 Sebastian Raschka, “Python Machine Learning”, Packt Publishing Ltd, 2015.
E BOOKS
1 http://www.cs.huji.ac.il/~shais/UnderstandingMachineLearning/index.html
2 http://www.mlyearning.org/
MOOC
1 https://www.coursera.org/learn/practical-machine-learning
2 https://www.coursera.org/learn/python-machine-learning
SEMESTER – II
COURSE TITLE ADVANCED OPERATING SYSTEMS CREDITS 3

CIA 60% ESE 40%
LEARNING LEVEL BTL - 4 - Analyze
CO OUTCOMES PO
1 Design distributed operating system. 4
2 Detect, prevent and avoid the deadlocks in distributed environment. 2, 9
3 Explain the need for load distribution and the corresponding techniques. 3, 9
4 Design security mechanisms for distributed operating system. 4
5 Analyze and find out the requirements to construct a database operating systems 2, 4
Prerequisites : Fundamentals of Programming
MODULE 1: DISTRIBUTED OPERATING SYSTEM (9)
Synchronization Mechanisms: Introduction – concept of a process – concurrent process – the critical section problem –
Synchronization problems – language mechanisms for synchronization: Monitors. System Architecture types – issues in
distributed operating systems – communication networks – communication primitives. Theoretical Foundations:
inherent limitations of a distributed system – lamport logical clocks – vector clocks – casual ordering of messages – global
state – cuts of a distributed computation – termination detection.
MODULE 2: DISTRIBUTED DEADLOCK DETECTION (9)

Deadlock handling strategies in distributed systems – issues in deadlock detection and resolution – control organizations
for distributed deadlock detection – centralized and distributed deadlock detection algorithms – hierarchical deadlock
detection algorithms. Agreement protocols – introduction-the system model, a classification of agreement problems, solutions to
the Byzantine agreement problem, applications of agreement algorithms.
MODULE 3: DISTRIBUTED SHARED MEMORY (9)

Architecture– algorithms for implementing DSM – memory coherence and coherence protocols – design issues. Distributed
Scheduling: introduction – issues in load distributing – components of a load distributing algorithm – stability – load distributing
algorithm – performance comparison – selecting a suitable load sharing algorithm – requirements for load distributing -task
migration and associated issues. Failure Recovery and Fault tolerance: introduction – basic concepts – classification of
failures – backward and forward error recovery approaches - recovery in concurrent systems – synchronous and
asynchronous check pointing and recovery – check pointing for distributed database systems - recovery in replicated
distributed databases systems.
MODULE 4: MULTIPROCESSOR OPERATING SYSTEM (9)

Basic multiprocessor system architectures – basic multiprocessor system architecture - inter connection networks
for multiprocessor systems – caching – hypercube architecture – structures of multiprocessor operating system -
operating system design issues – threads - process synchronization – processor scheduling – Memory
management. The Mac OS.
MODULE 5: DATABASE OPERATING SYSTEM (9)
Requirements of a database operating system Concurrency control: theoretical aspects - introduction, database systems - a
concurrency control model of database systems- the problem of concurrency control - Serializability theory- distributed
database systems, concurrency control algorithms - introduction, basic synchronization primitives, lock based algorithms-
timestamp based algorithms, optimistic algorithms - concurrency control algorithms, data replication.
Practical Component
1. Implementation of semaphores for multiprocessor OS
2. Implementation of multithreading for multiprocessor OS
3. Implementation of multiple sleeping barbers problem for synchronization in distributed OS
4. Implementation of network operating system.
5. Design a real time operating system to control the temperature of a boiler.
6. Implementation of transactions and concurrency in Database operating system.
7. Implement a banking application using distributed Operating system.
TEXT BOOKS
Mukesh Singhal, Niranjan G.Shivaratri, "Advanced concepts in operating systems", TMH, 2011
1
REFERENCE BOOKS
1 Abraham Silberschatz, Peter B. Galvin, G. Gagne, “Operating System Concepts”, Ninth Edition, Addison Wesley
Publishing Co., 2013.
2 Andrew S.Tanenbaum, "Modern operating system", PHI, 3rd edition,2008
3 Pradeep K.Sinha, "Distributed operating system-Concepts and design", PHI, 2003.
4 Andrew S.Tanenbaum, "Distributed operating system", Pearson education, 2003
E BOOKS
1 https://books.google.co.in/books/about/Advanced_Concepts_In_Operating_Systems.html?id=nel4vdeLcqkC
2 http://www.cs.iit.edu/~sun/pdfd/cs550-lec1.pdf
COURSE TITLE SOFT COMPUTING CREDITS 4

COURSE
COURSE CODE CSA3704 PC L-T-P-S 3- 1- 0- 1
CATEGORY
CIA 50% ESE 50%
LEARNING LEVEL BTL4 - Analyze
CO OUTCOMES PO
Apply concepts of fuzzy sets, fuzzy logic and heuristics based systems. 1,2,3
1
Derive appropriate rules for inference systems. 1,2
2
3 Use the mathematical background to optimize neural network learning. 3,9

Implement optimization algorithms and random search procedures useful
4 4,7,10
to seek global optimum in self-learning.
Develop case studies to illustrate the intelligent behavior of programs 6,7,10
5
based on soft computing.
Prerequisites :Artificial Intelligence, Problem solving , Expert Systems
MODULE 1: FUZZY SET THEORY (12)
Introduction to Neuro – Fuzzy and Soft Computing – Fuzzy Sets – Basic Definition and Terminology – Set-
theoretic Operations – Member Function Formulation and parameterization – Fuzzy Rules and Fuzzy
Reasoning – Extension Principle and Fuzzy Relations – Fuzzy If-Then Rules – Fuzzy Reasoning – Fuzzy
Inference Systems – Mamdani Fuzzy Models – Sugeno Fuzzy Models – Tsukamoto Fuzzy Models – Input
Space Partitioning and Fuzzy Modeling.
Suggested Activities: Apply fuzzy logic and reasoning to handle uncertainty and solve engineering problems.
Suggested sources: https://swayam.gov.in/course/4574-introduction-to-soft-computing
MODULE 2: OPTIMIZATION (12)

Derivative-based Optimization – Descent Methods – The Method of Steepest Descent – Classical Newton’s
Method – Step Size Determination – Derivative-free Optimization – Genetic Algorithms – Simulated Annealing
– Random Search – Downhill Simplex Search- Particle Swarm Techniques - Ant Colony Optimization.
Suggested Activities: Develop the application based on Genetic Algorithm and Ant Colony
optimization Suggested sources: https://swayam.gov.in/course/4574-introduction-to-soft- computing
MODULE 3: NEURAL NETWORKS (12)

Supervised Learning Neural Networks – Perceptrons - Adaline – Back propagation Mutilayer
Perceptrons – Radial Basis Function Networks – Unsupervised Learning Neural Networks –
Competitive Learning Networks – Kohonen Self-Organizing Networks – Learning Vector Quantization
– Hebbian Learning.
Suggested Activities: Compare and Analyze the features of supervised and Unsupervised Neural Networks
Suggested sources: https://swayam.gov.in/course/4574-introduction-to-soft-computing
MODULE 4: NEURO FUZZY MODELING (12)

Adaptive Neuro-Fuzzy Inference Systems – Architecture – Hybrid Learning Algorithm – Learning Methods
that Cross-fertilize ANFIS and RBFN – Coactive Neuro Fuzzy Modeling – Framework Neuron Functions for
Adaptive Networks – Neuro Fuzzy Spectrum.
Suggested Activities: Build Adaptive Neuro-Fuzzy Inference Systems (ANFIS), train Sugeno systems using
neuro-adaptive learning
Suggested sources:
http://in.mathworks.com/help/fuzzy/adaptive-neuro-fuzzy-inference-systems.html
MODULE 5: APPLICATIONS OF COMPUTATIONAL INTELLIGECE (12)

Printed Character Recognition – Inverse Kinematics Problems – Automobile Fuel Efficiency Prediction
– Soft Computing for Color Recipe Prediction.
Suggested Activities: Prepare the students for developing intelligent modeling, optimization and control of
non-linear systems through case studies.
Suggested sources:
https://towardsdatascience.com/introductory-guide-to-artificial-intelligence-11fc04cea042
TEXT BOOKS
J.S.R.Jang, C.T.Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI, 2004,Pearson
1 Education.
2 N.P.Padhy, “Artificial Intelligence and Intelligent Systems”, Oxford University Press, 2006
REFERENCE BOOKS
1 Samir Roy” Introduction to Softcomputing “Neuro Fuzzy and Genetic Algorithms”, First edition,
Pearson Publishers, 2015.
2 J.S.R.Jang, C.T.Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, Pearson, 2004.
3 Timothy J.Ross, “Fuzzy Logic with Engineering Applications”, McGraw-Hill, 1997.
4 Davis E.Goldberg, “Genetic Algorithms: Search, Optimization and Machine Learning”, Addison
Wesley, 2009.
5 S. Rajasekaran and G.A.V.Pai, “Neural Networks, Fuzzy Logic and Genetic Algorithms”, PHI,
2003.
E BOOKS
https://stimelstep.firebaseapp.com/15/Introduction-to-Soft-Computing-Neuro-Fuzzy-and-
1 Genetic- Algorithms.pdf
2 http://www.a-zshiksha.com/forum/viewtopic.php?f=147&t=61593
MOOC
1 https://www.class-central.com/tag/soft-computing
2 https://www.class-central.com/course/nptel-introduction-to-soft-computing-10053
COURSE TITLE ADVANCED DATA BASE TECHNOLOGY CREDITS 4

CSA370 COURSE
COURSE CODE PC L-T-P-S 2- 1- 2- 0
5 CATEGORY
CIA 60% ESE 40%
LEARNING LEVEL BTL - 5 (EVALUATE)
CO OUTCOMES PO
1 Implement parallel and distributed databases. 1,2,3,4,5,6,7
2 Implement object and object relational databases. 1,2,3,4,5,6,7
Learn advanced data models 1,2,3,4,5,6,7,
3
11
Learn emerging databases 1,2,3,4,5,6,7,
4
11
Prerequisites :Database Management System
MODULE 1: PARALLEL AND DISTRIBUTED DATABASES (9)
Database System Architectures: Centralized and Client-Server Architectures – Server System Architectures
– Parallel Systems- Distributed Systems – Parallel Databases: I/O Parallelism – Inter and Intra Query Parallelism –
Inter and Intra operation Parallelism – Design of Parallel Systems- Distributed Database Concepts - Distributed
Data Storage – Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query
Processing – Case Studies
Suggested Activities: Assignments and Case Study
Suggestedsources: NPTEL and http://mazsola.iit.unimiskolc.hu/tempus/discom/doc/db/tema01a.pdf
MODULE 2: OBJECT AND OBJECT RELATIONAL DATABASES(9)
Concepts for Object Databases: Object Identity – Object structure – Type Constructors – Encapsulation of Operations
– Methods – Persistence – Type and Class Hierarchies – Inheritance – Complex Objects – Object Database
Standards, Languages and Design: ODMG Model – ODL – OQL – Object Relational and Extended – Relational
Systems: Object Relational features in SQL/Oracle – Case Studies.
Suggested sources: NPTEL and
https://www.uio.no/studier/emner/matnat/ifi/INF3100/v13/undervisningsmateriale/lysark/sect10_3-
5.pdf
MODULE 3: INTELLIGENT DATABASES (9)

Active Databases: Syntax and Semantics (Starburst, Oracle, DB2)- Taxonomy- Applications- Design Principles for
Active Rules- Temporal Databases: Overview of Temporal Databases- TSQL2- Deductive Databases: Logic of
Query Languages – Datalog- Recursive Rules- Syntax and Semantics of Datalog Languages- Implementation of
Rules and Recursion- Recursive Queries in SQL- Spatial Databases- Spatial Data Types- Spatial Relationships-
Spatial Data Structures-Spatial Access Methods- Spatial DB Implementation.
Suggested sources:
https://www.cse.iitb.ac.in/~cs6212011/.../Intelligent%20Database%20Systems.ppt
MODULE 4: ADVANCED DATA MODELS (9)

Mobile Databases: Location and Handoff Management - Effect of Mobility on Data Management - Location
Dependent Data Distribution - Mobile Transaction Models - Concurrency Control - Transaction Commit Protocols-
Multimedia Databases- Information Retrieval- Data Warehousing- Data Mining- Text Mining.
Suggested sources: https://www.slideshare.net/avnishpatel165/multimedia-database-56310108,
https://www.geeksforgeeks.org/dbms-multimedia-database/
MODULE 5: EMERGING TECHNOLOGIES (9)

XML Databases: XML-Related Technologies-XML Schema- XML Query Languages- Storing XML in
Databases-XML and SQL- Native XML Databases- Web Databases- Geographic Information Systems- Biological
Data Management- Cloud Based Databases: Data Storage Systems on the Cloud- Cloud Storage Architectures-Cloud
Data Models- Query Languages- Introduction to Big Data-Storage-Analysis.
Suggested sources: https://www.tutorialspoint.com/xml/,
https://www.techwalla.com/articles/what-is-a-web-database
https://www.ibm.com/cloud/learn/what-is-cloud-database
TEXT BOOKS
Approach to Design, Implementation, and Management”, Sixth Edition ,Pearson Education, 2015.
1
REFERENCE BOOKS
1 Ramez Elmasri & Shamkant B.Navathe, “Fundamentals of Database Systems”, Seventh Edition ,
Pearson Education , 2016.
2 Tamer Ozsu M., Patrick Ualduriel, “Principles of Distributed Database Systems”, Second Edition,
Pearson Education, 2003.
3 Prabhu C.S.R., “Object Oriented Database Systems”, PHI, 2003.
4 Peter Rob and Corlos Coronel, “Database Systems – Design, Implementation and Management”,
Thompson Learning, Course Technology, 9th Edition, 2011.
5 Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”, Seventh Edition,
McGraw Hill, 2010.
E BOOKS
http://aries.ektf.hu/~hz/pdf-tamop/pdf-xx/Radvanyi-hdbms-eng2.pdf
1
https://dsinghpune.wordpress.com/advanced-database-management-system/
2
MOOC
1 https://www.coursera.org/learn/distributed-database
2 https://nptel.ac.in/courses/106106093/38
ELECTIVES
ELECTIVE I – SPECIALISATION IN DATA SCIENCE AND ENGINEERING
COURSE TITLE DATA STORAGE TECHNOLOGIES CREDITS 3

COURSE CODE CSB3721 COURSE CATEGORY PE L-T-P-S 3- 0- 0- 0
CIA 50% ESE 50%
LEARNING LEVEL BTL-6(CREATE)
CO OUTCOMES PO
1 Explain the Storage Media and Technologies 1,2,3,4
2 Illustrate the Memory Hierarchy and design the Hardware and Software for access 1,2,3,4
Discuss the Large Storages and Scalability issues 1,2,3,4
3
Analysis and discuss the Storage Partitioning, Storage System Design, Legacy Systems 1,2,3,4
4
Analysis the Performance, Reliability, and Security issues 1,2,3,4
5
Design and develop the model for any real world application using Data Storage 1,2,3,4,5,
6
Technologies with respect to Scalability issues and Security issues 8,9,10,11
Prerequisites : Basic concepts/functionality of Primary / Secondary Memory Hardware and Software
MODULE 1: STORAGE MEDIA AND TECHNOLOGIES (9)
Magnetic, Optical and Semiconductor Media, Techniques for read/write Operations, Issues and Limitations.
Suggested Activities: Assignments, MCQ
Suggested sources: NPTEL materials, other websites
MODULE 2:USAGE AND ACCESS (9)

Positioning in the Memory Hierarchy, Hardware and Software Design for Access, Performance issues
MODULE 3: LARGE STORAGES (9)

Hard Disks, Networked Attached Storage, Scalability issues
MODULE 4: STORAGE ARCHITECTURE (9)

Storage Partitioning, Storage System Design, Caching, Legacy Systems.
MODULE 5: STORAGE AREA NETWORKS (9)

Hardware and Software Components, Storage Clusters/Grids. Storage QoS–Performance, Reliability, and Security
issues
REFERENCE BOOKS
1 The Complete Guide to Data Storage Technologies for Network-centric ComputingPaperback– Import,
Mar 1998 by Computer Technology Research Corporation
2 Data Storage Networking: Real World Skills for the CompTIA Storage by Nigel Poulton,2014
E BOOKS
https://eu.dlink.com/es/es/-/media/resource-centre/b2b-briefs/es/
1 dlinkstoragetechnologiesandterminology.pdf
https://the-eye.eu/public/Books/qt.vidyagam.es/library/humble-Network-Security-Certification-
bundle/Data%20Storage%20Networking_%20Real%20World%20IA%20Storage_%20Certification%20and
%20Beyond/Data%20Storage%20Networking_%20Real%20World%20Skills_%20Certification%20and
2
%20Beyond%20-%20Nigel%20Poulton.pdf
MOOC
1 https://nptel.ac.in/downloads/106108058/
COURSE TITLE RECOMMENDER SYSTEM CREDITS 3

COURSE
COURSE CODE CSB3722 PE L-T-P-S 3- 0- 0- 0
CATEGORY
CIA 50% ESE 50%
LEARNING LEVEL BTL-6(CREATE)
CO OUTCOMES PO
1 Explain the recommendation system for a particular application domain. 1,2,3,4
Apply the techniques for pre-processing, feature extraction and similarity
2 1,2,3,4,5
based retrieval and also analyzing classification algorithms.
Analyze the User-based recommendation, Item-based recommendation and build the
3 Model based approaches and also illustrate the Attacks on 1,2,3,4,5
collaborative recommender systems.
Design and develop the Hybrid Approaches such as Monolithic hybridization
4 1,2,3,4,5
design, Parallelized hybridization design
Evaluate the recommender systems on the basis of metrics such as accuracy,
5 1,2,3,4,5
rank accuracy, diversity, product coverage, and serendipity
Design and develop the model for any real world application using 1,2,3,4,5
6
recommendation system concepts 6,7,8,9,10,11
Prerequisites : Data Structures with a C or higher
MODULE 1:INTRODUCTION (9)

Overview of Information Retrieval, Retrieval Models, Search and Filtering Techniques: Relevance Feedback, User
Profiles, Recommender system functions, Matrix operations, covariance matrices, Understanding ratings,
Applications of recommendation systems, Issues with recommender system.
Suggested Activities: Assignments, MCQ, Reading reports & research projects
Suggested sources:NPTEL materials, other websites
MODULE 2:CONTENT-BASED FILTERING(9)

High level architecture of content-based systems, Advantages and drawbacks of content based filtering, Item
profiles, Discovering features of documents, pre-processing and feature extraction, Obtaining item features
from tags, Methods for learning user profiles, Similarity based retrieval, Classification algorithms.
MODULE 3: COLLABORATIVE FILTERING(9)

User-based recommendation, Item-based recommendation, Model based approaches, Matrix factorization,
Attacks on collaborative recommender systems.
MODULE 4: HYBRID APPROACHES(9)

Opportunities for hybridization, Monolithic hybridization design: Feature combination, Feature augmentation,
Parallelized hybridization design: Weighted, Switching, Mixed, Pipelined hybridization design: Cascade Meta-
level, Limitations of hybridization strategies.
MODULE 5: EVALUATING RECOMMENDER SYSTEM(9)

Introduction, General properties of evaluation research, Evaluation designs: Accuracy, Coverage, confidence,
novelty, diversity, scalability, serendipity, Evaluation on historical datasets, Offline evaluations.
REFERENCE BOOKS
1 Jannach D., Zanker M. and FelFering A., Recommender Systems: An Introduction, Cambridge
University Press (2011), 1st edition.
2 Charu C. Aggarwal, Recommender Systems: The Textbook, Springer (2016), 1st editon.
3 Ricci F., Rokach L., Shapira D., Kantor B.P., Recommender Systems Handbook, Springer(2011),
1st ed.
4 Manouselis N., Drachsler H., Verbert K., Duval E., Recommender Systems For Learning, Springer
(2013), 1st ed.
E BOOKS
1 http://rd.springer.com/book/10.1007%2F978-3-319-29659-3
2 https://pdfrog.com/download/recommender_systems.pdf
MOOC
2 https://www.coursera.org/specializations/recommender-systems
COURSE TITLE AGENT BASED INTELLIGENT SYSTEM CREDITS 3

CIA 50% ESE 50%
LEARNING LEVEL BTL3(APPLY)
CO OUTCOMES PO
1 Explain the structure of agents 1
2 Implement a computational agent with various searching techniques 2,3
3 Apply the learning agents in planning 2,3,4
4 Apply the reasoning mechanisms of proposition and predicate logic to agents. 3,4,5,9
5 Use the learning mechanisms for an artificial agent. 3,4,5,9
Execute different communication and co-operation methodologies in a multi-
6 3,4,5,9
agent setup.
Prerequisites :Artificial Intelligence
Agents as a paradigm for software engineering - Agents as a tool for understanding human societies-
Intelligent Agent: Agents and Objects - Agents and Expert Systems - Agents as Intentional Systems - Abstract
Architectures for Intelligent Agents - How to Tell an Agent What to Do.
MODULE 2: LEARNING IN AGENTS (9)

Proportional case - Handling variables and qualifiers - Dealing with intractability - Reasoning with horn clauses
- Procedural control of reasoning - Rules in production – Reasoning with Higher order Logics
MODULE 3: COMMUNICATION AND COOPERATION IN AGENTS (9)

Software tools for ontology - OWL - XML - KIF - Speech acts - Cooperative Distributed Problem Solving -
Task Sharing and Result Sharing - Result Sharing - Combining Task and Result Sharing - Handling
Inconsistency - Coordination - Multi agent Planning and Synchronization
MODULE 4: DEVELOPING INTELLIGENT AGENT SYSTEMS (9)

Situated Agents: Actions and Percepts - Proactive and Reactive Agents: Goals and Events -
Challenging Agent Environments: Plans and Beliefs - Social Agents - Agent Execution Cycle - Deciding on the
Agent Types - Grouping functionalities - Review Agent Coupling - Acquaintance Diagrams - Develop Agent
Descriptors
MODULE 5: APPLICATIONS (9)

Agent for workflow and business process management- Mobile agents - Agents for distributed systems -
agents for information retrieval and management - agents for electronic commerce - agent for human-
computer interface - agents for virtual environments - agents for social simulation.
TEXT BOOKS
Michael Wooldridge, An Introduction to Multi Agent Systems, Second Edition, John Wiley and
1 Sons, 2009.
Stuart Russell, Peter Norvig, ―Artificial Intelligence: A Modern Approach‖, Third Edition,
2 Pearson Education, 2009.
Lin Padgham, Michael Winikoff, Developing Intelligent Agent Systems: A Practical Guide, Wiley
3 publications, 2005
REFERENCE BOOKS
1 Ronald Brachman, Hector Levesque ―Knowledge Representation and Reasoning, The Morgan
Kaufmann Series in Artificial Intelligence 2004
2 Arthur B. Markman, ―Knowledge Representation, Lawrence Erlbaum Associates,1998
MOOC
1 https://www.coursera.org/lecture/modeling-simulation-natural-processes/multi-agent-
systems-kAKyC
ELECTIVE II – SPECIALIZATION IN DATA SCIENCE AND ENGINEERING

COURSE TITLE DATA WAREHOUSING AND DATA MINING CREDITS 3
CIA 50% ESE 50%
LEARNING LEVEL BTL4 (ANALYZE)
CO OUTCOMES PO
To understand data warehouse concepts, architecture, business analysis and
1 1
tools
2 To apply the functionality of the various data warehousing components 3
3 To understand data pre-processing and data visualization techniques 1
To understand and apply various classification and prediction techniques using
4 3
tools.
To study and apply algorithms Cluster analysis for finding hidden and interesting
5 5
patterns in data
6 To understand Mining of Object, Spatial, Multimedia, Text and Web Data 4
Prerequisites : Data Storage Technologies
MODULE 1:DATA WAREHOUSING AND BUSINESS ANALYSIS (9)
Data warehousing Components –Building a Data warehouse –Data Warehouse Architecture – DBMS Schemas
for Decision Support – Data Extraction, Cleanup, and Transformation Tools –Metadata – reporting – Query
tools and Applications – Online Analytical Processing (OLAP) – OLAP and Multidimensional Data
Analysis.
Suggested Activities: Create a use case on OLAP

Suggested sources:
https://www.researchgate.net/publication/220672995_Using_OLAP_Tools_for_e-
HRM_A_case_study
MODULE 2:DATA MINING (9)

Data Mining Functionalities – Data Preprocessing – Data Cleaning – Data Integration and
Transformation – Data Reduction – Data Discretization and Concept Hierarchy Generation- Architecture
of A Typical Data Mining Systems- Classification Of Data Mining Systems. Association Rule Mining: - Efficient
and Scalable Frequent Item set Mining Methods – Mining Various Kinds of Association Rules – Association
Mining to Correlation Analysis – Constraint-Based Association Mining.
Suggested Activities: Application of Data Mining any one domain – Eg : Education

Suggested sources: Bakhshinategh, Behdad, et al. "Educational data mining applications and tasks: A survey
of the last 10 years." Education and Information Technologies 23.1 (2018): 537-553.
MODULE 3: CLASSIFICATION AND PREDICTION (9)

Issues Regarding Classification and Prediction – Classification by Decision Tree Introduction – Bayesian
Classification – Rule Based Classification – Classification by Back propagation – Support Vector Machines –
Associative Classification – Lazy Learners – Other Classification Methods – Prediction – Accuracy and
Error Measures – Evaluating the Accuracy of a Classifier or Predictor – Ensemble Methods – Model
Section.
Suggested Activities: Create Prediction and Classification models for any use case
Suggested sources: Eg: https://blog.revolutionanalytics.com/2012/08/cheat-sheet-for-prediction- and-
classification-models-in-r.html
MODULE 4: CLUSTER ANALYSIS (9)

Types of Data in Cluster Analysis – A Categorization of Major Clustering Methods – Partitioning Methods –
Hierarchical methods – Density-Based Methods – Grid-Based Methods – Model-Based Clustering Methods –
Clustering High-Dimensional Data – Constraint-Based Cluster Analysis – Outlier Analysis.
Suggested Activities: Fun way cluster analysis using the source given
Suggested sources:http://www.greatideasforteachingmarketing.com/fun-approach-to-cluster- analysis/
MODULE 5: MINING OBJECT, SPATIAL, MULTIMEDIA, TEXT AND WEB DATA (9)
Multidimensional Analysis and Descriptive Mining of Complex Data Objects – Spatial Data Mining –
Multimedia Data Mining – Text Mining – Mining the World Wide Web- Case Studies.
Suggested Activities: Mini Project on mining any one Text/Oject/Multimedia/Spatial

Suggested sources:
https://www.slideshare.net/Tommy96/chap-10-mining-object-spatial-multimedia-text-and-web- data
TEXT BOOKS
1 Jiawei Han and Micheline Kamber, “Data Mining: Concepts and Techniques”, 3rd Edition,
Morgan Kaufmann Publishers, 2011.
Alex Berson and Stephen J. Smith, “Data Warehousing, Data Mining & OLAP”, 10th Edition, TataMc
2 Graw Hill Edition, 2007.
REFERENCE BOOKS
1 Adelchi Azzalini, Bruno Scapa, “Data Analysis and Data mining”, 2nd Edition, Oxford University
Press Inc., 2012.
2 G. K. Gupta, “Introduction to Data Mining with Case Studies”, 1st Edition, Easter Economy
Edition, PHI, 2006.
E BOOKS
1 http://guidetodatamining.com/
2 https://www.cs.waikato.ac.nz/ml/weka/book.html
COURSE TITLE BIG DATA ANALYTICS CREDITS 3

CIA 50% ESE 50%
LEARNING LEVEL BTL3 (APPLY)
CO OUTCOMES PO
Work with big data platform and explore the big data analytics techniques
1 1
business applications.
2 Design efficient algorithms for mining the data from large volumes. 3
Analyze the HADOOP and Map Reduce technologies associated with big data
3 1
analytics.
4 Explore on Big Data applications Using Pig and Hive. 3
5 Build a complete business data analytics solution 5
Prerequisites : Datamining
Introduction to big data : Introduction to Big Data Platform – Challenges of Conventional Systems - Intelligent
data analysis – Nature of Data - Analytic Processes and Tools - Analysis vs Reporting.
MODULE 2:DATA STREAMS (9)

Mining data streams : Introduction To Streams Concepts – Stream Data Model and Architecture - Stream
Computing - Sampling Data in a Stream – Filtering Streams – Counting Distinct Elements in a Stream –
Estimating Moments – Counting Oneness in a Window – Decaying Window - Real time Analytics
Platform(RTAP) Applications - Case Studies - Real Time Sentiment Analysis- Stock Market Predictions.
MODULE 3: HADOOP ADMINISTRATION (9)

Hadoop: History of Hadoop- the Hadoop Distributed File System – Components of Hadoop Analysing the Data
with Hadoop- Scaling Out- Hadoop Streaming- Design of HDFS-Java interfaces to HDFS Basics- Developing
a Map Reduce Application-How Map Reduce Works-Anatomy of a Map Reduce Job run Failures-Job
Scheduling-Shuffle and Sort – Task execution - Map Reduce Types and Formats- Map Reduce
MODULE 4: HADOOP FRAMEWORK (9)

Predictive Analytics- Simple linear regression- Multiple linear regression- Interpretation 5 of regression
coefficients. Visualizations - Visual data analysis techniques- interaction techniques - Systems and
applications.
MODULE 5: REGRESSION MODELS (9)

Multidimensional Analysis and Descriptive Mining of Complex Data Objects – Spatial Data Mining –
Multimedia Data Mining – Text Mining – Mining the World Wide Web- Case Studies.
REFERENCE BOOKS
1 Tom White “Hadoop: The Definitive Guide” Third Edition, O’reilly Media, 2012.
2 Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis, Paul Zikopoulos, “Understanding Big
Data: Analytics for Enterprise Class Hadoop and Streaming Data”, McGrawHill Publishing, 2012.
3 Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, CUP, 2012.
4 Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with
Advanced Analytics”, John Wiley& sons, 2012.
5 Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons, 2007.
6 Pete Warden, “Big Data Glossary”, O’Reilly, 2011.
7 Jiawei Han, Micheline Kamber “Data Mining Concepts and Techniques”, 2 nd Edition, Elsevier,
Reprinted 2008.
8 Da Ruan, Guoquing Chen, Etienne E.Kerre, Geert Wets, “Intelligent Data Mining”, Springer,
2007.
9 Paul Zikopoulos, Dirkde Roos, Krishnan Parasuraman, Thomas Deutsch, James Giles , David
Corrigan, “Harness the Power of Big Data The IBM Big Data Platform”, Tata McGraw Hill
Publications, 2012.
10 Arshdeep Bahga, Vijay Madisetti, “Big Data Science & Analytics: A HandsOn Approach “,VPT,
2016 12. Bart Baesens “Analytics in a Big Data World: The Essential Guide to Data Science and its
Applications (WILEY Big Data Series)”, John Wiley & Sons,2014
11 Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, 2007.
COURSE TITLE DATA CLASSIFICATION METHODS AND EVALUATION CREDITS 3

CIA 50% ESE 50%
LEARNING LEVEL BLT5 (EVALUATE)
CO OUTCOMES PO
Analyze the clustering applications like Market segmentation and Social network
1 1
analysis
2 Discriminate between clustering and classification problems. 3
3 Apply data reduction and data preprocessing techniques for clustering 1
Appraise feature extraction methods and identify the suitable method for a
4 3
given problem
5 Compare and contrast between pattern recognition techniques. 5
6 Apply the optimization techniques and algorithm for system analysis 4
Prerequisites : NIL
Reasons for classification - Defining a cluster -Examples of use of clusters: Market research -
Astronomy - Psychiatry - Weather classification - Archaeology - Bioinformatics and genetics.
MODULE 2: FEATURE EXTRACTION (9)

Feature Extraction - Distance Measure - Euclidean distance - Mahalonobis distance - Manhattan
distance.
MODULE 3: CLASSIFICATION (9)
Classification: Classification – Decision Tree Induction – Bayesian Classification – Prediction –Back
Propagation.
MODULE 4: OPTIMIZATION CLUSTERING TECHNIQUES (9)
Clustering criteria derived from the dissimilarity matrix - Clustering criteria derived from continuous data -
Optimization algorithms - Choosing the number of clusters - Applications of optimization
methods.
MODULE 5: CLUSTER ANALYSIS (9)
Cluster analysis: Types of data – Clustering Methods – K-Means clustering-KMedoid clustering- Hierarchical
clustering-agglomerative clustering- Partitioning methods – Model based clustering methods – Outlier
analysis.
REFERENCE BOOKS
1 Sugato Basu, Ian Davidson, Kiri L.wagsstaff, “Constrained Clustering: Advances in Algorithms,
Theory, and Applications”, 1st Edition, Chapman and Hall/CRC press, 2009.
2 Paulraj Ponnaiah,” Data Warehousing Fundamentals”, 1st Edition, Wiley Publishers, 2008.
3 Brian S. Everitt, Sabine Landau, Morven Leese, and Daniel Stah, “Cluster Analysis”, 5th Edition,
Wiley, 2011..
4 Mark Nixon, Alberto S Aguado, “Feature Extraction & Image Processing”,2nd Edition, Academic
Press, 2008
E BOOKS
1 https://epdf.tips/constrained-clustering-advances-in-algorithms-theory-and-applications.html
2 http://haralick.org/ML/data_clustering.pdf
3 https://onlinelibrary.wiley.com/doi/pdf/10.1002/9780470977811
MOOC
1 https://www.coursera.org/specializations/data-mining
2 https://towardsdatascience.com/machine-learning/home
COURSE TITLE DATA VISUALISATION TECHNIQUES CREDITS 3

CIA 50% ESE 50%
LEARNING LEVEL BLT6 (CREATE)
CO OUTCOMES PO
1 Critically evaluate visualizations and suggest improvements and refinements 1,2,4
2 Use standalone visualization applications to quickly explore data 1, 4,
3 Apply a structured design process to create effective visualizations 2,3,5
4 Conceptualize ideas and interaction techniques using sketching 2,3, 5
5 Create web-based interactive visualizations using JavaScript and D3. 2,3, 5
6 Use storytelling principles to design coherent and clear visualizations 3,4,6
Prerequisites : Programming
Introduction – Data- Visualization-Design, Data & Tasks- Data Types- Dataset Types- Spatial Data- Scivis and
Infovis, Graphic Design, Graphical Integrity, Data-Ink Ratio, Aspect Ratios & Scales
Suggested sources: http://www.cis.umassd.edu/~dkoop/cis467/lectures/lecture03.pdf

http://www.cis.umassd.edu/~dkoop/cis467/lectures/lecture04.pdf
MODULE 2: DATA-DRIVEN DOCUMENTS (D3) (9)

Introduction to D3- Relative vs. Absolute Judgments- Luminance Perception- D3 Key Features- Concepts
Visualization Process. Design Iterations. Sketching. Data Types. Statistical Graphs. Interaction
Design. Overview & Detail. Dynamic Queries. Brushing & Linking. Animation. Trees & Networks. Radial
Layouts.
Tree maps. Linear Layouts.
Maps. Choropleth Maps. Cartograms. Symbol Maps. Flow Maps. Real-Time Maps.
Suggested sources: http://www.cis.umassd.edu/~dkoop/cis467/lectures/lecture06.pdf https://d3js.org/
MODULE 3: DESIGN STUDIO & TEXT VISUALIZATION (9)

Design Studio
High-Dimensional Data. Filtering. Parallel Coordinates. Glyphs. Aggregation.
Text Visualization. Document Visualization. Images & Video.
Maps. Choropleth Maps. Cartograms. Symbol Maps. Flow Maps. Real-Time Maps. Perception. Visual
Channels. Weber's Law. Pre-attentive Processing. Visual Channel Rankings. Suggested sources:
http://www.cis.umassd.edu/~dkoop/cis467/lectures/lecture08.pdf
MODULE 4: COLOR PROCESSING (9)
Color. Color Processing. Color Spaces. Color Aesthetics. Colors for Visualization
Cognition. Looking vs. Seeing. Image Gist. Gestalt Principles. Visual Attention. Visual Working & Long-Term
Memory.
MODULE 5: DATA VISUALISATION SYSTEM (9)
Visual Story Telling. Messaging. Effective Presentations. Design for Information
Visualization and Arts, Visualization Systems- Database Visualization
REFERENCE BOOKS
1 Ben Fry "Visualizing Data: Exploring and Explaining Data with the Processing
Environment"O'Reilly Media, 2007.
2 Scott Murray "Interactive Data Visualization for the Web" O'Reilly Media, 2013.
3 Edward Tufte "The Visual Display of Quantitative Information" 2001.
4 Colin Ware, “Visual Thinking for Design”, Morgan Kaufman Series, 2008.
5 Alberto Cairo, “The Functional Art: An introduction to information graphics and visualization” ,
New Riders ,2012.
E BOOKS
1 https://github.com/d3/d3
2 http://alignedleft.com/tutorials/d3/
MOOC
1 https://www.coursera.org/learn/datavisualization

COURSE TITLE HADOOP ADMINISTRATION CREDITS 3
CIA 50% ESE 50%
CO OUTCOMES PO
1 Apply the Hadoop File System and design Hadoop basics 1 ,2
Gain conceptual understanding of Hadoop Distributed File System and use the
2 1,2,3
features of MapReduce. Creating an map reduce program
3 Understand the concepts of map reduce and its functional programming 3,4
4 Explain basic techniques in managing and monitoring Hadoop Cluster. 1,2
5 Identify appropriate techniques and tools to solve actual Big Data problems. 3,4,5
6 Demonstrate various challenges in processing Big Data and hadoop 3,4,5
Prerequisites : NIL
MODULE 1:MAP REDUCE (9)
Data Storage and Analysis – Apache Hadoop and the Hadoop Ecosystem – Analyzing the data with Hadoop –
Scaling Out – Hadoop Streaming – Hadoop Pipes.
Suggested sources: https://data-flair.training/blogs/hadoop-mapreduce-tutorial/

MODULE 2:HADOOP (9)
The Hadoop Distributed Filesystem – Hadoop I/O –Developing a MapReduce Application.
Suggested sources: https://data-flair.training/blogs/hadoop-tutorial/

MODULE 3: MAPREDUCE FORMATS AND FEATURES (9)
MapReduce Types – Input Formats – Output Formats – Counters – Sorting – Joins – Side Data Distribution –
MapReduce Library Classes.
Suggested sources: https://data-flair.training/blogs/hadoop-tutorial/
MODULE 4: HADOOP ADMINISTRATION (9)

Setting Up a Hadoop Cluster – Administrating Hadoop.
Suggested sources:https://data-flair.training/blogs/hadoop-tutorial/
MODULE 5: TOOL (9)

Hive- Installing Hive, An Example, Running Hive. HBase – Hbasics, Concepts, Installation, Clients, Example. –
ZooKeeper – Sqoop.
Suggested sources:http://apache.bytenet.in/hive/
TEXT BOOKS
1 Vijay Srinivas Agneeswaran - Big Data Analytics Beyond Hadoop Pearson Education, Inc.
2. VigneshPrajapati, “Big Data Analytics with R and Hadoop”, Packet Publishing
3. Robert D. Schneider, “Hadoop for Dummies”, Wiley.
REFERENCE BOOKS
1 Tom White, “Hadoop: The Definitive Guide”, 3rd Ed., O'Reilly Media, 2012
2 Shumin Guo, Hadoop Operations and Cluster Management Cookbook, Safari, 2013
3 Chuck Lam, “Hadoop in action”, Dreamtech Press, 2011.
4 Dirk Deroos, Paul C. Zikopoulos, Roman B. Melnyk, Bruce Brown, “Hadoop for dummies”, Wiley
publication, 2015.
E BOOKS
https://www.isical.ac.in/~acmsc/WBDA2015/slides/hg/Oreilly.Hadoop.The.Definitive.Guide.3rd.Edition. Jan.2012.pdf
1
MOOC
COURSE TITLE PRINCIPLES OF DEEP LEARNING CREDITS 3

CIA 50% ESE 50%
LEARNING LEVEL BTL5(EVALUATE)
CO OUTCOMES PO
1 Develop algorithms simulating human brain. 1,2
2 Analyze ANN learning and memory based learning 1,2
3 Explore the essentials of Deep Learning and Deep Network architectures. 3,4
4 Implement Neural Networks in Tensor Flow for solving problems. 3,4,5
Define, train and use a Deep Neural Network for solving real world problems
5 5
that require artificial Intelligence based solutions.
6 Use deep learning methodology in real world application 5,6,7
Prerequisites : Neural Networks
Basics of Deep leaning- Deep learning architectures: Convolutional Neural Networks : Neurons in
Human Vision-The Shortcomings of Feature Selection-Vanilla Deep Neural Networks Don’t Scale-
Filters and Feature Maps-Full Description of the Convolutional Layer-Max Pooling-Full Architectural Description
of Convolution Networks-Closing the Loop on MNIST with Convolutional Networks- Image Preprocessing
Pipelines Enable More Robust Models-Accelerating Training with Batch Normalization-Building a
Convolutional Network for CIFAR-10-Visualizing Learning in Convolutional NetworksLeveraging Convolutional
Filters to Replicate Artistic Styles-Learning Convolutional Filters for Other Problem Domains-Training
algorithms.
MODULE 2:MEMEORY AUGUMENTED NEURAL NETWORKS(9)

Memory Augmented Neural Networks : Neural Turing Machines-Attention-Based Memory Access- NTM
Memory Addressing Mechanisms-Differentiable Neural Computers-Interference-Free Writing in DNCs-DNC
Memory Reuse-Temporal Linking of DNC Writes-Understanding the DNC Read Head- The DNC Controller
Network Visualizing the DNC in Action-Implementing the DNC in Tensor Flow- Teaching a DNC to Read and
Comprehend. Deep Reinforcement Learning:
MODULE 3: DEEP REINFORCEMENT LEARNING (9)

Deep Reinforcement Learning Masters Atari Games What Is Reinforcement Learning?-Markov Decision
Processes (MDP)-Explore Versus Exploit-Policy versus Value Learning-Pole-Cart with Policy Gradients-Q-
Learning and Deep Q-Networks-Improving and Moving Beyond DQN.
MODULE 4: TENSOR FLOW (9)

Implementing Neural Networks in tensor Flow : What Is tensor Flow?-How Does Tensor Flow Compare
to Alternatives?-Installing tensor Flow-Creating and Manipulating tensor Flow Variables- tensor Flow
Operations-Placeholder Tensors-Sessions in tensor Flow-Navigating Variable Scopes and Sharing Variables-
Managing Models over the CPU and GPU-Specifying the Logistic Regression Model in tensor Flow-Logging and
Training the Logistic Regression Model-Leveraging Tensor Board to Visualize 24 Computation Graphs and
Learning-Building a Multilayer Model for MNIST in Tensor Flow. Applications: Deep learning for computer
vision, Deep Learning
MODULE 5: APPLICATIONS (9)

Applications at the Enterprise Scale, Deep Learning Models for Healthcare Applications.
TEXT BOOKS
1 Simon Haykins, “Neural Network- A Comprehensive Foundation”, Pearson Prentice Hall, 2nd
Edition, 1999. ISBN-13: 978-0-13-147139-9/ISBN-10: 0-13-147139-2
2 Zurada and Jacek M, “Introduction to Artificial Neural Systems”, West Publishing Company,
1992, ISBN: 9780534954604
3 Nikhil Buduma, Nicholas Locascio, “Fundamentals of Deep Learning: Designing Next-
Generation Machine Intelligence Algorithms”, O'Reilly Media, 2017.
REFERENCE BOOKS
1 Ian Goodfellow, Yoshua Bengio, Aaron Courville, ”Deep Learning (Adaptive Computation and
Machine Learning series”, MIT Press, 2017.

2 M T Hagan, H B Demoth, M Beale, “Neural Networks Design”, Thomson Learning, 2002. ISBN-
10: 0-9717321-1-6/ ISBN-13: 978-0-9717321-1-7
E BOOKS
1 http://www.deeplearningbook.org/
MOOC
1 https://onlinecourses.nptel.ac.in/noc18_cs26/
2 https://www.upgrad.com/machine-learning-and-artificial-intelligence
ELECTIVE IV – SPECIALIZATION IN DATA SCIENCE AND ENGINEERING

COURSE TITLE WEB ANALYTICS AND DEVELOPMENT CREDITS 3

CIA 50% ESE 50%
CO OUTCOMES PO
1 Become familiar with core research communities, publications, focused on web
2 Analyze the Social Media using web analytics tools
3 Do web crawling, indexing, ranking and model the web traffic
4 Perform brain computer interface

Prerequisites : Web Development/Technology
Introduction – Social network and Web data and methods, Graph and Matrices, Basic
measures for individuals and networks, Information Visualization.
MODULE 2:DESIGN PROCESS – SCREEN DESIGN (9)

Web Analytics tools: Click Stream Analysis, A/B testing, Online Survey
MODULE 3: WINDOWS AND MULTIMEDIA (9)

Web Search and Retrieval: Search Engine Optimization, Web Crawling and
indexing, Ranking Algorithms, Web traffic models
MODULE 4: SOFTWARE TOOLS AND DEVICES (9)

Making Connection: Link Analysis, Random Graphs and Network evolution, Social
Connects: Affiliation and identity
MODULE 5: BRAIN COMPUTER INTERFACE (9)

Connection: Connection Search, Collapse, Robustness Social involvements and diffusion of innovation
TEXT BOOKS
Hansen, Derek, Ben Sheiderman, Marc Smith. 2011. Analyzing Social Media Networks with NodeXL:
1 Insights from a Connected World. Morgan Kaufmann, 304.
REFERENCE BOOKS
1 Wasserman, S. & Faust, K. (1994). Social network analysis: Methods and applications. New York:
Cambridge University Press. Monge, P. R. & Contractor, N. S. (2003). Theories of
communication networks. New York: Oxford University Press.
2 Avinash Kaushik. 2009. Web Analytics 2.0: The Art of Online Accountability.
3 Alan Dix, Janet Finlay, Gre Goryd, Abowd, Russell Beale,”Human – Computer Interaction”, 3rd
edition, Pearson Education, 2004
E BOOKS
http://www.cs.cornell.edu/home/kleinber/networks-book/
1
MOOC
1 https://www.mooc-list.com/tags/web-analytics
COURSE TITLE VIRTUAL REALITY CREDITS 3

CSB373 COURSE
COURSE CODE PE L-T-P-S 3- 0- 0- 0
1 CATEGORY
CIA 50% ESE 50%
CO OUTCOMES PO
1 Understanding the concepts of Virtual Modeling and Environment 1
Knowledge facts about the Geometric modeling and its Virtual
2 2,3
Environment
3 Explain basic techniques in designing transmission systems 1,2,4,5
4 Apply the software and hardware 4,5
Explain the technologies related to virtual reality and application of
5 6,7,8,11
virtual reality system.
6 Use virtual reality in real-world applications. Do VRML programming. 8,9,11
Prerequisites :NIL
Virtual Reality & Virtual Environment : Introduction – Computer graphics – Real time computer
graphics – Flight Simulation – Virtual environments –Requirement for virtuality – benefits of virtual reality-
Historical development of VR : Introduction – Scientific Landmark -3D Computer Graphics : Introduction – The
Virtual world space – positioning the virtual of server – the perspective projection
– human vision – stereo perspective projection – 3D clipping – Colour theory – Simple 3D modeling –
Illumination models – Reflection models – Shading algorithms – Radiosity – Hidden-Surface removal
– Realism – Stereographic usages.
Suggested sources: https://www.schellgames.com/assets/images/microsites/hololab-
homepage/HoloLABChampions_TeacherGuide_ip.pdf
MODULE 2: GEOMETRIC MODELING (9)
Geometric Modeling : Introduction – From 2D to 3D – 3D space curves – 3D boundary representation
– Other modeling strategies-Geometrical Transformations: Introduction – Frames of reference – Modeling
transformations – Instances – Picking – Flying – Scaling the VE – Collision detection - A Generic VR system
: Introduction – The virtual environment – the Computer environment – VR Technology – Model of
interaction – VR System.
Suggested sources: http://msl.cs.uiuc.edu/vr/vrbook.pdf
MODULE 3: VIRTUAL ENVIRONMENT (9)
Animating the Virtual Environment: Introduction – The dynamics of numbers – the animation of objects –
shape & object in between – free-form deformation – particle system Physical Simulation : Introduction – Objects
falling in a graphical field – Rotating wheels – Elastic collisions – projectiles – simple pendulum – springs –
Flight dynamics of an aircraft.
Suggested sources: https://www.mdpi.com/2414-4088/1/2/11/pdf
MODULE 4: VR HARDWARES & SOFTWARES (9)
Human Factors : Introduction – the age- the ear- the semantic senses – equilibrium – conclusions - VR
Hardware : Introduction – sensor hardware – Head-coupled displays – Aquatic hardware – Integrated VR
systems-VR Software: Introduction – Modeling virtual world –Physical simulation- VR
tool kits.
MODULE 5: VR APPLICATION (9)
Introduction – Engineering – Entertainment – Science – Training – The Future : Introduction –
Virtual Equipments – modes of interaction – conclusion.
TEXT BOOKS
1 John Vince, “Virtual Reality Systems “, Pearson Education Asia, 2001
REFERENCE BOOKS
1 Adams, “Visualizations of Virtual Reality”,Tata McGraw Hill, 2000.
2 Grigore C. Burdea, Philippe Coiffet , “Virtual Reality Technology” , Wiley-Interscience,1
Edition,1994.
3 William R. Sherman, Alan B. Craig, “Understanding Virtual Reality: Interface, Application, and
Design”,Morgan Kaufmann, 1st Edition,2002.
4 Fei GAO. Design and Development of Virtual Reality Application System, Tsinghua Press, March
2012
E BOOKS
1 http://msl.cs.uiuc.edu/vr/
2 www.vrac.iastate.edu.
3 www.w3.org/MarkUp/VRML.
MOOC
1 https://www.mooc-list.com/course/making-your-first-virtual-reality-game-coursera
2 https://www.mooc-list.com/course/vr-360-video-production-coursera
3 https://nptel.ac.in/syllabus/syllabus_pdf/106106138.pdf
COURSE TITLE RISK ANALYSIS AND MANAGEMENT CREDITS 3

CSB373 COURSE
COURSE CODE PE L-T-P-S 3- 0- 0- 0
2 CATEGORY
CIA 50% ESE 50%
CO OUTCOMES PO
Identify, formulate, and solve engineering problems in risk
1 1,2
management.
Apply knowledge of mathematics, science, and engineering to the
2 1,2,3
assessment of risk.
Understand the environmental assessments and perception of risk
3 1,4,5,6
assessment
Suggest risk reduction and risk management measures, also where
4 1,7,8,11
there is a lack of information
Reflect upon ethical, subjective and societal dimensions of risk
5 1,6,7,8,
assessments.
6 Implement tools and techniques to evaluate risk in projects 1,5,6,7
Prerequisites : NIL
MODULE 1: INTRODUCTION TO RISK ANALYSIS (9)
Introduction - Risk analysis –Variability and uncertainty of risk analysis-Risk analysis modeling- Probabilistic
risk analysis for complex engineering system Ecological risk analysis-Economics of risk
Privacy.
MODULE 2: APPLICATION OF RISK ANALYSIS (9)
Role of risk assessment in human health – Role of risk analysis in pollution prevention-Integrated risk analysis and
global climate change-Computer software programs-databases –www- Other online
systems- Use of internet.
MODULE 3: RISK PERCEPTION AND COMMUNICATION (9)
Risk perception and trust- Insurability of risk – Setting environmental priorities based on risk—
Comparative risk analysis – Law and risk assessment –Science and toxic risk assessment.
MODULE 4: RISK MANAGEMENT (9)
Risk management process-Identify-assess-plan responses-Manage process –PRAM Process – Three
cycles of strategic level risk management.
MODULE 5: RISK ORGANISATION & CONTROL (9)
Organizational structure- Responsibilities – Functional roles – Risk response actions - Control risk
documentation – Risk reporting – Risk governance – Risk reviews –Behavioral influences.– Risk
identification techniques –SWOT analysis.
TEXT BOOKS
1 Vlasta Molak, “Fundamentals of Risk Analysis and Risk Management”, 2nd Edition, CRC Press, Lewish
Publishers, 2000.
2 John Bartlet, “Project Risk Analysis and Management Guide”, 2nd Edition, ARM Publishing Ltd,
2010
REFERENCE BOOKS
1 Naagarazan. R.S., "A textbook on Professional Ethics and Human values", New Age
International, New Delhi, 2006.
2 Ranganatham and Madhumathi, "Derivatives and Risk Management", Pearson, 2011
3 Rajiv Srivastav, "Derivatives and Risk Management", Oxford University Press, 2010
E BOOKS
1 https://the-eye.eu/.../Fundamentals%20of%20Risk%20Analysis%20and%20Risk%20Man.
2 penka.kroser.com.uy/fundamentals_of_risk_and_insurance.pdf
MOOC
1 https://www.mooc-list.com/tags/risk-management
2 https://www.edx.org/learn/risk-management

MTechData Science&Engineering

Uploaded by

Copyright:

Available Formats

MTechData Science&Engineering

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MTechData Science&Engineering

Uploaded by

Copyright:

Available Formats

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CURRICULUM AND SYLLABUS

(Applicable for Students admitted from Academic Year 2018-19)

MTech (COMPUTER SCIENCE AND ENGINEERING)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

SCHOOL OF COMPUTING SCIENCES

HINDUSTAN INSTITUTE OF TECHNOLOGY & SCIENCE

VISION AND MISSION

To create an ecosystem that promotes learning and world class research.

Integrity, Innovation, Internationalization

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

M.Tech (COMPUTER SCIENCE AND ENGINEERING)

PROGRAMME EDUCATIONAL OBJECTIVES (PEO)

The program is expected to enable the students to

PROGRAM OUTCOMES (ALIGNED WITH GRADUATE ATTRIBUTES) (PO)

At the end of this program, graduates will be able to

PO1 Scholarship of knowledge: Acquire in-depth knowledge of specific discipline or professional

M.Tech - COMPUTER SCIENCE AND ENGINEERING

(65 CREDITS STRUCTURE)

1 BS MAA3706 Statistics for Computer Science + 3 0 2 4 1 5

Advanced Data Structures and

*Research Methodology & IPR is a compulsory Course.

M.Tech - COMPUTER SCIENCE AND ENGINEERING

M.Tech - COMPUTER SCIENCE AND ENGINEERING

ELECTIVE I – SPECIALIZATION IN DATA SCIENCE AND ENGINEERING

2 PE CSB3725 Big Data Analytics 3 0 0 3 0 3

2 PE CSB3728 Hadoop Administration 3 0 0 3 0 3

3 PE CSB3729 Principles of Deep Learning 3 0 0 3 0 3

2 PE CSB3731 Virtual Reality 3 0 0 3 0 3

3 PE CSB3732 Risk Analysis and Management 3 0 0 3 0 3

COURSE TITLE STATISTICS FOR COMPUTER SCIENCE CREDITS 4

MODULE 2: TWO DIMENSIONAL RANDOM VARIABLES (12)

MODULE 3: THEORY OF SAMPLING AND TEST OF HYPOTHESIS (12)

MODULE 4: TIME SERIES ANALYSIS (12)

Suggested sources: Time series-Maurice George kendall,j.k.Ord

MODULE 5: DESIGN OF EXPERIMENTS (12)

COURSE TITLE ADVANCED DATA STRUCTURES AND ALGORITHMS CREDITS 3

Prerequisites : 1. Fundamentals of Data Structures 2. Design and Analysis of Algorithm

MODULE 2: HEAP STRUCTURES (9)

Suggested sources: https://nptel.ac.in/courses/106102064/20, 21

MODULE 3: SEARCH STRUCTURES (9)

MODULE 4: ALGORITHM DESIGN TECHIQUES (9)

Suggested Sources: https://nptel.ac.in/courses/106106131/15,

MODULE 5: ADVANCED ALGORITHMS (9)

Suggested sources: https://nptel.ac.in/courses/106104120/4, 5

COURSE TITLE MACHINE LEARNING CREDITS 3

5 Use the Python programming for machine learning. 1,2,3,5

of using MLP - Back propagation of error.

Suggested Activities: Design a Multilayer Perceptron for Rain Forecasting system

Suggested Activities: Explore the Regression Examples in Machine Learning

Suggested Activities: Simulated annealing / Modelling on any data science application.

MODULE 4: Optimization Techniques (6+6)

Suggested Activities: Design an Encryption algorithm using Genetic algorithm

Suggested Activities: Design a simple application using NumPy and MatPolitB.

COURSE TITLE ADVANCED OPERATING SYSTEMS CREDITS 3

MODULE 2: DISTRIBUTED DEADLOCK DETECTION (9)

MODULE 3: DISTRIBUTED SHARED MEMORY (9)

MODULE 4: MULTIPROCESSOR OPERATING SYSTEM (9)

COURSE TITLE SOFT COMPUTING CREDITS 4