VISVESVARAYA TECHNOLOGICAL UNIVERSITY

BELAGAVI

Scheme of Teaching and Examinations and Syllabus

M.Tech Computer Science and Engineering (SCS)
(Effective from Academic year 2020 - 21)
 2

VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELAGAVI

Scheme of Teaching and Examinations – 2020 - 21
M.Tech Computer Science and Engineering (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
I SEMESTER

Credits
Sl.
Course Course Code Teaching Hours /Week Examination
No
Course Title

Total Marks
SEE Marks
Duration in

CIE Marks
Assignment
Field work/
Theory

Practical/

hours
Title Of The Course
1 PCC 20SCS11 04 -- 03 40 60 100 4
(Mathematics course)
2 PCC 20SCS12 Artificial Intelligence 04 -- 03 40 60 100 4
3 PCC 20SCS13 Blockchain Technology 04 -- 03 40 60 100 4
4 PCC 20SCS14 Advanced Algorithms 04 -- 03 40 60 100 4
5 PCC 20SCS15 Internet of Things 04 -- 03 40 60 100 4
6 PCC 20SCSL16 Algorithms Laboratory - 04 03 40 60 100 2
7 PCC 20RMI17 Research Methodology and IPR 02 -- 03 40 60 100 2
TOTAL 22 04 21 280 420 700 24
Note: PCC: Professional core.
Internship: All the students have to undergo mandatory internship of 6 weeks during the vacation of I and II
semesters and /or II and III semesters. A University examination shall be conducted during III semester and the
prescribed credit shall be counted for the same semester. Internship shall be considered as a head of passing and
shall be considered for the award of degree. Those, who do not take-up/complete the internship shall be declared
as fail in internship course and have to complete the same during the subsequent University examination after
satisfying the internship requirements.
Note: (i) Four credit courses are designed for 50 hours Teaching – Learning process.
(ii) Three credit courses are designed for 40 hours Teaching – Learning process.
 3

VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELAGAVI

Scheme of Teaching and Examinations – 2020 - 21
M.Tech Computer Science and Engineering (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
II SEMESTER
Teaching Hours /Week Examination

Total Marks
SEE Marks
Duration in
Assignment/

CIE Marks

Credits
Field work/
Theory
Sl.

Practical/

hours
Course Course Code Course Title
No

Project
1 PCC 20SCS21 Data Science 04 -- 03 40 60 100 4
Semantic Web and Social
2 PCC 20SCS22 04 -- 03 40 60 100 4
Networks
3 PCC 20SCS23 Soft Computing 04 -- 03 40 60 100 4
4 PEC 20SCS24X Professional elective 1 04 -- 03 40 60 100 4
5 PEC 20SCS25X Professional elective 2 04 -- 03 40 60 100 4
6 PCC 20SCSL26 Data Science Laboratory -- 04 03 40 60 100 2
7 PCC 20SCS27 Technical Seminar -- 02 -- 100 -- 100 2
TOTAL 20 06 20 340 360 700 24
Note: PCC: Professional core, PEC: Professional Elective.
Professional Elective 1 Professional Elective 2
Course Code Course title Course Code under Course title
under 20SCS24X 20SCS25X
20SCS241 Advanced Cryptography 20SCS251 Image Processing and Machine Vision
20SCS242 Natural Language Processing 20SCS252 Object Oriented Design
20SCS243 Cloud Computing 20SCS253 Software Defined Networks
20SCS244 Pattern recognition 20SCS254 Modern Computer Architecture

Note:
1. Technical Seminar: CIE marks shall be awarded by a committee comprising of HoD as Chairman, Guide/co-guide, if
any, and a senior faculty of the department. Participation in the seminar by all postgraduate students of the same and other
semesters of the programme shall be mandatory.
The CIE marks awarded for Technical Seminar, shall be based on the evaluation of Seminar Report, Presentation skill and
Question and Answer session in the ratio 50:25:25.
2. Internship: All the students shall have to undergo mandatory internship of 6 weeks during the vacation of I and II
semesters and /or II and III semesters. A University examination shall be conducted during III semester and the prescribed
credit shall be counted in the same semester. Internship shall be considered as a head of passing and shall be considered for
the award of degree. Those, who do not take-up/complete the internship shall be declared as fail in internship course and
have to complete the same during the subsequent University examination after satisfying the internship requirements.
 4

VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELAGAVI

Scheme of Teaching and Examinations – 2020 - 21
M.Tech Computer Science and Engineering (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
III SEMESTER
Teaching Hours /Week Examination

Total Marks
SEE Marks
Duration in

CIE Marks

Credits
Assignment
Field work/
Theory
Sl.

Practical/

hours
Course Course Code Course Title
No

1 PCC 20SCS31 Deep Learning 04 -- 03 40 60 100 4

2 PEC 20SCS32X Professional elective 3 04 -- 03 40 60 100 3
3 PEC 20SCS33X Professional elective 4 04 -- 03 40 60 100 3
4 Project 20SCS34 Project Work phase -1 -- 02 -- 100 -- 100 2
5 PCC 20SCS35 Mini-Project -- 02 -- 100 -- 100 2
(Completed during the
intervening vacation of I
6 Internship 20SCSI36 Internship and II semesters and /or
03 40 60 100 6
II and III semesters.)
TOTAL 12 02 12 260 240 500 20
Note: PCC: Professional core, PEC: Professional Elective.
Professional elective 3 Professional elective 4
Course Code Course title Course Code Course title
under 20SCS32X under 20SCS33X
20SCS321 Engineering Economics 20SCS331 Business Intelligence and its
Applications
20SCS322 Virtual Reality 20SCS332 Robotics and Automation
20SCS323 Video Processing 20SCS333 Speech Processing
20SCS324 Multi Core Architecture and 20SCS334 Wireless Sensor Networks
Programming

Note:
1. Project Phase-1:Students in consultation with the guide/co-guide if any, shall pursue literature survey and
complete the preliminary requirements of selected Project work. Each student shall prepare relevant introductory
project document, and present a seminar.
CIE marks shall be awarded by a committee comprising of HoD as Chairman, Guide/co-guide if any, and a
senior faculty of the department. The CIE marks awarded for project work phase -1, shall be based on the
evaluation of Project Report, Project Presentation skill and Question and Answer session in the ratio 50:25:25.
SEE (University examination) shall be as per the University norms.
2. Internship: Those, who have not pursued /completed the internship shall be declared as fail in internship
course and have to complete the same during subsequent University examinations after satisfying the internship
requirements. Internship SEE (University examination) shall be as per the University norms.
 5

VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELAGAVI

Scheme of Teaching and Examinations – 2020 - 21
M.Tech Computer Science and Engineering (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
IV SEMESTER
Teaching Hours /Week Examination

Total Marks
Duration in

CIE Marks

Credits
Assignment

SEE Marks
Field work/
Theory
Sl.

Viva voce
Practical/

hours
Course Course Code Course Title
No

1 Project 20SCS41 Project work phase -2 -- 04 03 40 60 100 20

TOTAL -- 04 03 40 60 100 20

Note:
1. Project Phase-2:
CIE marks shall be awarded by a committee comprising of HoD as Chairman, Guide/co-guide, if any, and a Senior faculty of the
department. The CIE marks awarded for project work phase -2, shall be based on the evaluation of Project Report subjected to plagiarism
check, Project Presentation skill and Question and Answer session in the ratio 50:25:25.
SEE shall be at the end of IV semester. Project work evaluation and Viva-Voce examination (SEE), after satisfying the plagiarism check,
shall be as per the University norms.
 M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER – I
ARTIFICIAL INTELLIGENCE
Course Code 20SCS12, 20SSE254 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction, Intelligent Agents, Problem Solving: Solving problem by searching, Beyind classical search
Module-2
Adversarial search, Constraint satisfication problem, Knowledge, reasoning and planning: Logical
Agents, First order logic, Inference in First order logic. Classical Planning, planning and acting in the real
world, Knowledge representation.
Module-3
Uncertain Knowledge and reasoning: Quantifying uncertinity, Probabilistic reasoning, Hidden Markov
Models, Dynamic Bayesian Networks.
Module-4
Learning: Learning from examples, Knowledge in learning, Learning probabilistic models.
Module-5
Reinforcement learning, Natural Language Processing, Natural Language for Communication.

Course outcomes: At the end of the course the student will be able to:
• Define Artificial intelligence and identify problems for AI. Charcterize the search techniques to
solve problems and recognize the scope of classical search techniques
• Define knowledge and its role in AI. Demonstrate the use of Logic in solving AI problems.
• Demonstrate handling of uncertiain knowledge and reasnong in probability theory.
• Explain Learning methods in AI
• Demonstrate Natrual Language Processing and its application in Natural Langauge
Communication
Question paper pattern: The SEE question paper will be set for 100 marks and the marks scored will be
proportionately reduced to 60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Artificial Intelligence: A Modern Stuart Russell and Prentice Hall 3rd, 2009
Approach Peter Norvig
Reference Books
1 Artificial Intelligence: Structures George F Luger Pearson Addison 6th Ed, 2008
and Stategies for Complex Wesley
Problem Solving
2 Artificial Intelligence E Rich, K Knight, Tata Mc-GRaw Hill 3rd Ed, 2009
and S B Nair
 M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - I
BLOCKCHAIN TECHNOLOGY
Course Code 20SCS13, 20SCN15 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction: Basic Cryptographic primitives used in Blockchain – Secure, Collison-resistant
hash functions, digital signature, public key cryptosystems, zero-knowledge proof systems. Need
for Distributed Record Keeping, Modelling faults and adversaries, Byzantine Generals problem,
Consensus algorithms and their scalability problems, Why Nakamoto Came up with Blockchain
based cryptocurrency?
Module-2
Technologies Borrowed in Blockchain – hash pointers, Consensus, Byzantine Models of fault
tolerance, digital cash etc.Bitcoin blockchain - Wallet - Blocks - Merkley Tree - hardness of
mining - transaction verifiability - anonymity - forks - double spending - mathematical analysis
of properties of Bitcoin. Bitcoin, the challenges, and solutions
Module-3
Abstract Models for BLOCKCHAIN - GARAY model - RLA Model - Proof of Work (PoW) as
random oracle - formal treatment of consistency, liveness and fairness - Proof of Stake (PoS)
based Chains - Hybrid models ( PoW + PoS).Bitcoin scripting language and their use
Module-4
Ethereum - Ethereum Virtual Machine (EVM) - Wallets for Ethereum - Solidity - 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. Some attacks on smart contracts
Module-5
Hyperledger fabric, the plug and play platform and mechanisms in permissioned
blockchain.Beyond Cryptocurrency – applications of blockchain in cyber security, integrity of
information, E-Governance and other contract enforcement mechanisms. Limitations of
blockchain as a technology, and myths vs. reality of blockchain technology

Course outcomes:
At the end of the course the student will be able to:
• Define and Explain the fundamentals of Blockchain
• Illustrate the technologies of blockchain
• Decribe the models of blockchain
• Analyze and demonstrate the Ethereum
• Analyze and demonstrate Hyperledger fabric
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
 • The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Blockchain Technology: S. Shukla, M. Oxford University 2019
Cryptocurrency and Applications Dhawan, S. Sharma, Press
S. Venkatesan
2 Bitcoin and cryptocurrency Arvind Narayanan Princeton University 2016
technologies: a comprehensive et. Al. Press
introduction
Reference Books
1 Research perspectives and Joseph Bonneau et IEEE Symposium 2015
challenges for Bitcoin and al, SoK on security and
cryptocurrency Privacy
2 The bitcoin backbone protocol - J.A.Garay et al, EUROCRYPT 2015
analysis and applications LNCS VOl 9057, (
VOLII ), pp 281-310
3 Analysis of Blockchain protocol in R.Pass et al EUROCRYPT 2017
Asynchronous networks
4 Fruitchain, a fair blockchain R.Pass et al , PODC 2017
5 Blockchain: The Blockchain for Josh Thompson Create Space 2017
Beginnings, Guild to Blockchain Independent
Technology and Blockchain Publishing Platform
Programming’

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - I
ADVANCED ALGORITHMS
Course Code 20SCS14, 20SSE244 CIE Marks 40
TeachingHours/Week (L:T:P) 4:0:0 SEE Marks 60
Credits 04 Exam Hours 03
Module-1
Review of Analysis Techniques: Growth of Functions: Asymptotic notations; Standard
notations and common functions; Recurrences and Solution of Recurrence equations- The
substitution method, The recurrence – tree method, The master method; Amortized Analysis:
Aggregate, Accounting and Potential Methods.
Module-2
Graph Algorithms: Bellman - Ford Algorithm; Single source shortest paths in a DAG; Johnson’s
Algorithm for sparse graphs; Flow networks and Ford-Fulkerson method; Maximum bipartite
matching. Polynomials and the FFT: Representation of polynomials; The DFT and FFT;
Efficient implementation of FFT.
Module-3
Number -Theoretic Algorithms: Elementary notions; GCD; Modular Arithmetic; Solving
modular linear equations; The Chinese remainder theorem; Powers of an element; RSA
cryptosystem; Primality testing; Integer factorization
Module-4
String-Matching Algorithms: Naïve string Matching; Rabin - Karp algorithm; String matching
with finite automata; Knuth-Morris-Pratt algorithm; Boyer – Moore algorithms.
Module-5
Probabilistic and Randomized Algorithms: Probabilistic algorithms; Randomizing
deterministic algorithms, Monte Carlo and Las Vegas algorithms; Probabilistic numeric
algorithms

Course outcomes:
At the end of the course the student will be able to:
• Design and apply iterative and recursive algorithms.
• Design and implement optimization algorithms in specific applications.
• Design appropriate shared objects and concurrent objects for applications.
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Author/s Publisher Edition and year
Name
1 Introduction to Algorithms T. H Cormen, C E Leiserson, PHI 3rd Edition, 2010
R L Rivest and C Stein
2 Algorithms Kenneth A. Berman Cengage 2002.
Learning
Reference Books
1 Fundamentals of Computer Ellis Horowitz, Universities press 2nd Edition, 2007
Algorithms Sartaj Sahni,
S.Rajasekharan

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - I
INTERNET OF THINGS
Course Code 20SCS15, 20LNI22, 20SCE23, 20SCN14 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
What is The Internet of Things? Overview and Motivations, Examples of Apllications, IPV6
Role, Areas of Development and Standardization, Scope of the Present Investigation.Internet of
Things Definitions and frameworks-IoT Definitions, IoT Frameworks, Basic Nodal Capabilities.
Internet of Things Apjplication Examples-Overview, Smart Metering/Advanced Metering
Infrastructure-Health/Body Area Networks, City Automation, Automotive Applications, Home
Automation, Smart Cards, Tracking, Over-The-Air-Passive Surveillance/Ring of Steel, Control
Application Examples, Myriad Other Applications.
Module -2
Fundamental IoT Mechanism and Key Technologies-Identification of IoT Object and Services,
Structural Aspects of the IoT, Key IoT Technologies. Evolving IoT Standards-Overview and
Approaches, IETF IPV6 Routing Protocol for RPL Roll, Constrained Application Protocol,
Representational State Transfer, ETSI M2M,Third Generation Partnership Project Service
Requirements for Machine-Type Communications, CENELEC, IETF IPv6 Over Low power
WPAN, Zigbee IP(ZIP),IPSO
Module – 3
Layer ½ Connectivity: Wireless Technologies for the IoT-WPAN Technologies for IoT/M2M,
Cellular and Mobile Network Technologies for IoT/M2M,Layer 3 Connectivity :IPv6
Technologies for the IoT: Overview and Motivations. Address Capabilities,IPv6 Protocol
Overview, IPv6 Tunneling, IPsec in IPv6,Header Compression Schemes, Quality of Service in
IPv6, Migration Strategies to IPv6.
Module-4
Case Studies illustrating IoT Design-Introduction, Home Automation, Cities, Environment,
Agriculture, Productivity Applications.
Module-5
Data Analytics for IoT – Introduction, Apache Hadoop, Using Hadoop MapReduce for Batch
Data Analysis, Apache Oozie, Apache Spark, Apache Storm, Using Apache Storm for Real-time
Data Analysis, Structural Health Monitoring Case Study.

Course outcomes:
At the end of the course the student will be able to:
• Develop schemes for the applications of IOT in real time scenarios
• Manage the Internet resources
• Model the Internet of things to business
• Understand the practical knowledge through different case studies
Understand data sets received through IoT devices and tools used for analysis
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Building the Internet of Things Daniel Minoli Wiley 2013
with IPv6 and MIPv6:The
Evolving World of M2M
Communications
2 Internet of Things: A Hands on Arshdeep Bahga, Universities Press 2015
 Approach Vijay Madisetti
Reference Books
1 The Internet of Things Michael Miller Pearson 2015 First Edition
2 Designing Connected Products Claire O’Reilly First Edition, 2015
Rowland,Elizabeth
Goodman et.al

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - II
DATA SCIENCE
Course Code 20SCS21
CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction: What is Data Science? Big Data and Data Science hype – and getting past the hype,
Why now? – Datafication, Current landscape of perspectives, Skill sets. NeededStatistical
Inference: Populations and samples, Statistical modeling, probability distributions, fitting a
model, - Introduction to R
Module-2
Exploratory Data Analysis and the Data Science Process: Basic tools (plots, graphs and summary
statistics) of EDA, Philosophy of EDA,The Data Science Process, Case Study: RealDirect
(online real estate firm). Three Basic Machine Learning Algorithms: Linear Regression, k-
Nearest Neighbors (k-NN), k-means
Module-3
One More Machine Learning Algorithm and Usage in Applications: Motivating application:
Filtering Spam, Why Linear Regression and k-NN are poor choices for Filtering Spam, Naive
Bayes and why it works for Filtering Spam, Data Wrangling: APIs and other tools for scrapping
the Web
Module-4
Feature Generation and Feature Selection (Extracting Meaning From Data): Motivating
application: user (customer) retention. Feature Generation (brainstorming, role of domain
expertise, and place for imagination), Feature Selection algorithms. Filters; Wrappers; Decision
Trees; Random Forests. Recommendation Systems: Building a User-Facing Data Product,
Algorithmic ingredients of a Recommendation Engine, Dimensionality Reduction, Singular
Value Decomposition, Principal Component Analysis, Exercise: build your own
recommendation system
Module-5
Mining Social-Network Graphs: Social networks as graphs, Clustering of graphs, Direct
discovery of communities in graphs, Partitioning of graphs, Neighborhood properties in graphs,
Data Visualization: Basic principles, ideas and tools for data visualization. Data Science and
Ethical Issues, Discussions on privacy, security, ethics, Next-generation data scientists
Course outcomes:
At the end of the course the student will be able to:
• Define data science and its fundamentals
• Demonstrate the process in data science
• Explain machine learning algorithms necessary for data sciences
• Illustrate the process of feature selection and analysisi of data analysis algorithms
• Visualize the data and follow of ethics
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Doing Data Science Cathy O’Neil and Straight Talk From 2014
Rachel Schutt The
Frontline.O’Reilly
2 Mining of Massive Datasets. v2.1 Jure Leskovek, Cambridge 2014
Anand Rajaraman University Press
and Jeffrey Ullman
3 Machine Learning: A Probabilistic Kevin P. Murphy 2013
Perspective
4 Data Mining: Concepts and Jiawei Han, ThirdEdition 2012.
Techniques Micheline Kamber
and Jian Pei
Reference Books

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - II
SEMANTIC WEB AND SOCIAL NETWORKS
Course Code 20SCS22, 20LNI12 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Web Intelligence Thinking and Intelligent Web Applications, The Information Age ,The World
Wide Web, Limitations of Today’s Web, The Next Generation Web, Machine Intelligence,
Artificial Intelligence, Ontology, Inference engines, Software Agents, Berners-Lee www,
Semantic Road Map, Logic on the semantic Web.
Module 2
Knowledge Representation for the Semantic Web Ontologies and their role in the semantic web,
Ontologies Languages for the Semantic Web – Resource Description Framework(RDF) / RDF
Schema, Ontology Web Language(OWL), UML, XML/XML Schema.
Module 3
Ontology Engineering, Ontology Engineering, Constructing Ontology, Ontology Development
Tools, Ontology Methods, Ontology Sharing and Merging, Ontology Libraries and Ontology
Mapping, Logic, Rule and Inference Engines.
Module 4
Semantic Web Applications, Services and Technology Semantic Web applications and services,
Semantic Search, e-learning, Semantic Bioinformatics, Knowledge Base, XML Based Web
Services, Creating an OWL-S Ontology for Web Services, Semantic Search Technology, Web
Search Agents and Semantic Methods.
Module 5
Social Network Analysis and semantic web What is social Networks analysis, development of
the social networks analysis, Electronic Sources for Network Analysis – Electronic Discussion
networks, Blogs and Online Communities, Web Based Networks. Building Semantic Web
Applications with social network features.

Course outcomes:
At the end of the course the student will be able to:
• Demonstrate the semantic web technologies like RDF Ontology and others
• Learn the various semantic web applications
• Identify the architectures and challenges in building social networks
Analyze the performance of social networks using electronic sources
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Thinking on the Web Berners Lee, Godel Wiley inter science 2008
and Turing
2 Social Networks and the Semantic Peter Mika Springer 2007
Web
Reference Books
1 Semantic Web and Semantic Web Liyang Lu Chapman CRC Publishers
Services and Hall
2 Semantic Web Technologies,
Trends and Research in Ontology
Based Systems.
3 Programming the Semantic Web T.Segaran, C.Evans, O’Reilly.
J.Taylor
 M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - II
SOFT COMPUTING
Course Code 20SCS23
CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction to Soft computing: Neural networks, Fuzzy logic, Genetic algorithms, Hybrid
systems and its applications. Fundamental concept of ANN, Evolution, basic Model of ANN,
Terminologies used in ANN, MP model, Hebb model.
Module 2
Perceptron Network: Adaptive linear neuron, Multiple adaptive linear neurons, Back
propagation Network (Theory, Architecture, Algorithm for training, learning factors, testing and
applications of all the above NN models).
Module 3
Introduction to classical sets and fuzzy sets: Classical relations and fuzzy relations,
Membership functions.
Module 4
Defuzzification: Fuzzy decision making, and applications.
Module 5
Genetic algorithms: Introduction, Basic operations, Traditional algorithms, Simple GA General
genetic algorithms, The schema theorem, Genetic programming, applications.

Course outcomes:
At the end of the course the student will be able to:
• Implement machine learning through neural networks.
• Design Genetic Algorithm to solve the optimization problem.
• Develop a Fuzzy expert system.
Model Neuro Fuzzy system for clustering and classification
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Principles of Soft computing Shivanandam, Wiley India 2011
Deepa S. N
Reference Books
1 Neuro-fuzzy and soft computing .S.R. Jang, C.T. Sun, Phi (EEE edition), 2012
E. Mizutani
 M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - II
ADVANCED CRYPTOGRAPHY
Course Code 20SCS241,
CIE Marks 40
20LNI254
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Number Theory: Introduction to number theory, Overview of modular arithmetic, discrete
logarithms, and primality/factoring, Euclid’s algorithm, Finite fields, Prime numbers, Fermat’s
and Euler’s theorem-Testing for primality.
Module-2
Symmetric & Asymmetric Cryptography: Classical encryption techniques, Block cipher design
principles and modes of operation, Data encryption standard, Evaluation criteria for AES, AES
cipher, Principles of public key cryptosystems, The RSA algorithm, Key management – Diffie
Hellman Key exchange, Elliptic curve arithmetic-Elliptic curve cryptography.
Module-3
Authentication functions :MAC ,Hash function, Security of hash function and MAC,MD5 ,SHA
,HMAC, CMAC , Digital signature and authentication protocols , DSS ,EI Gamal – Schnorr.
Module-4
Authentication applications: Kerberos & X.509 Authentication services Internet Firewalls for
Trusted System: Roles of Firewalls , Firewall related terminology-,Types of Firewalls ,Firewall
designs, Intrusion detection system , Virus and related threats, Countermeasures , Firewalls
design principles ,Trusted systems, Practical implementation of cryptography and security.
Module-5
Quantum Cryptography and Quantum Teleportation: Heisenberg uncertainty principle,
polarization states of photons, quantum cryptography using polarized photons, local vs. non local
interactions, entanglements, EPR paradox, Bell’s theorem, Bell basis, teleportation of a single
qubit theory and experiments.

Course outcomes:
At the end of the course the student will be able to:
• Understand OSI security architecture and classical encryption techniques.
• Acquire fundamental knowledge on the concepts of finite fields and number theory.
• Understand various block cipher and stream cipher models.
• Describe the principles of public key cryptosystems, hash functions and digital signature.
• Compare various Cryptographic Techniques
• Design Secure applications
• Inject secure coding in the developed applications
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
 module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Cryptography And Network William Stallings Pearson Education Fourth Edition
Security Principles And Practice
2 A Course in Number Theory and Neal Koblitz Springer 1987
Cryptology
Reference Books
1 Cryptography and Network Behrouz A Mc-GrawHill 3rd Edition, 2015
Security Forouzan, Debdeep
Mukhopadhyay
2 Applied Cryptography and Damien Vergnaud 7th International June 2-5, 2009,
Network Security and Michel Abdalla Conference, ACNS Proceedings
2009, Paris-
Rocquencourt,
France

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - II
NATURAL LANGUAGE PROCESSING
Course Code 20SCS242,
CIE Marks 40
20SCE243
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
OVERVIEW AND LANGUAGE MODELING: Overview: Origins and challenges of NLP-
Language and Grammar-Processing Indian Languages- NLP Applications-Information Retrieval.
Language Modeling: Various Grammar- based Language Models-Statistical Language Model.
Module -2
WORD LEVEL AND SYNTACTIC ANALYSIS: Word Level Analysis: Regular Expressions-
Finite-State Automata-Morphological Parsing-Spelling Error Detection and correction-Words
and Word classes-Part-of Speech Tagging. Syntactic Analysis: Context-free Grammar-
Constituency- Parsing-Probabilistic Parsing.
Module - 3
Extracting Relations from Text: From Word Sequences to Dependency Paths: Introduction,
Subsequence Kernels for Relation Extraction, A Dependency-Path Kernel for Relation
Extraction and Experimental Evaluation. Mining Diagnostic Text Reports by Learning to
Annotate Knowledge Roles: Introduction, Domain Knowledge and Knowledge Roles, Frame
Semantics and Semantic Role Labeling, Learning to Annotate Cases with Knowledge Roles and
Evaluations. A Case Study in Natural Language Based Web Search: InFact System Overview,
The GlobalSecurity.org Experience.
Module-4
Evaluating Self-Explanations in iSTART: Word Matching, Latent Semantic Analysis, and Topic
Models: Introduction, iSTART: Feedback Systems, iSTART: Evaluation of Feedback Systems,
Textual Signatures: Identifying Text-Types Using Latent Semantic Analysis to Measure the
Cohesion of Text Structures: Introduction, Cohesion, Coh-Metrix, Approaches to Analyzing
Texts, Latent Semantic Analysis, Predictions, Results of Experiments. Automatic Document
Separation: A Combination of Probabilistic Classification and Finite-State Sequence Modeling:
Introduction, Related Work, Data Preparation, Document Separation as a Sequence Mapping
Problem, Results. Evolving Explanatory Novel Patterns for Semantically-Based Text Mining:
Related Work, A Semantically Guided Model for Effective TextMining.
Module-5
INFORMATION RETRIEVAL AND LEXICAL RESOURCES: Information Retrieval: Design
features of Information Retrieval Systems-Classical, Non classical, Alternative Models of
Information Retrieval – valuation Lexical Resources: World Net-Frame Net- Stemmers-POS
Tagger- Research Corpora.

Course outcomes:
At the end of the course the student will be able to:
• Analyze the natural language text.
• Generate the natural language.
• Demonstrate Text mining.
• Apply information retrieval techniques.
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Natural Language Processing and Tanveer Siddiqui, Oxford University 2008
Information Retrieval U.S. Tiwary Press
2 Anne Kao and Stephen R. Potee Natural Springer-Verlag 2007
LanguageProcessing London Limited
andText Mining
Reference Books
1 Speech and Language Processing: Daniel Jurafsky and Prentice Hall 2008 2nd Edition
Anintroduction to Natural James H Martin
Language Processing,
Computational Linguistics and
SpeechRecognition
2 Natural Language Understanding James Allen Benjamin/Cummingsp 2nd edition, 1995
ublishing company
3 Information Storage and Retrieval Gerald J. Kowalski Kluwer academic 2000.
systems and Mark.T. Publishers
Maybury
4 Natural Language Processing with Steven Bird, Ewan O'Reilly Media 2009
Python Klein, Edward
Loper
5 Foundations of Statistical Natural Christopher MIT Press 1999
Language Processing D.Manning and
Hinrich Schutze
 M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - II
CLOUD COMPUTING
Course Code 20SCS243, 20LNI15, 20SCE14, 20SIT22,
CIE Marks 40
20SSE251, 20SCN31
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction, Cloud Infrastructure: Cloud computing, Cloud computing delivery models and
services, Ethical issues, Cloud vulnerabilities, Cloud computing at Amazon, Cloud computing
the Google perspective, Microsoft Windows Azure and online services, Open-source software
platforms for private clouds, Cloud storage diversity and vendor lock-in, Energy use and
ecological impact, Service level agreements, User experience and software licensing. Exercises
and problems.
Module 2
Cloud Computing: Application Paradigms.: Challenges of cloud computing, Architectural
styles of cloud computing, Workflows: Coordination of multiple activities, Coordination based
on a state machine model: The Zookeeper, The Map Reduce programming model, A case study:
The Gre The Web application, Cloud for science and engineering, High-performance computing
on a cloud, Cloud computing for Biology research, Social computing, digital content and cloud
computing.
Module 3
Cloud Resource Virtualization: Virtualization, Layering and virtualization, Virtual machine
monitors, Virtual Machines, Performance and Security Isolation, Full virtualization and
paravirtualization, Hardware support for virtualization, Case Study: Xen a VMM based
paravirtualization, Optimization of network virtualization, vBlades, Performance comparison of
virtual machines, The dark side of virtualization, Exercises and problems
Module 4
Cloud Resource Management and Scheduling: Policies and mechanisms for resource
management, Application of control theory to task scheduling on a cloud, Stability of a two-level
resource allocation architecture, Feedback control based on dynamic thresholds, Coordination of
specialized autonomic performance managers, A utility-based model for cloud-based Web
services, Resourcing bundling: Combinatorial auctions for cloud resources, Scheduling
algorithms for computing clouds, Fair queuing, Start-time fair queuing, Borrowed virtual time,
Cloud scheduling subject to deadlines, Scheduling MapReduce applications subject to deadlines,
Resource management and dynamic scaling, Exercises and problems.
Module 5
Cloud Security, Cloud Application Development: Cloud security risks, Security: The top
concern for cloud users, Privacy and privacy impact assessment, Trust, Operating system
security, Virtual machine Security, Security of virtualization, Security risks posed by shared
images, Security risks posed by a management OS, A trusted virtual machine monitor, Amazon
web services: EC2 instances, Connecting clients to cloud instances through firewalls, Security
rules for application and transport layer protocols in EC2, How to launch an EC2 Linux instance
and connect to it, How to use S3 in java, Cloud-based simulation of a distributed trust algorithm,
A trust management service, A cloud service for adaptive data streaming, Cloud based optimal
FPGA synthesis .Exercises and problems.

Course outcomes:
At the end of the course the student will be able to:
• Compare the strengths and limitations of cloud computing
• Identify the architecture, infrastructure and delivery models of cloud computing
• Apply suitable virtualization concept.
• Choose the appropriate cloud player
• Address the core issues of cloud computing such as security, privacy and interoperability
• Design Cloud Services
• Set a private cloud
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Cloud Computing Theory and Dan C Marinescu Elsevier(MK) 2013.
Practice
Reference Books
1 Rajkumar Buyya , James Broberg, Computing Willey 2014
Andrzej Goscinski Principles and
Paradigms
2 Cloud Computing Implementation, John W CRC Press 2013
Management and Security Rittinghouse, James
F Ransome

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - II
PATTERN RECOGNITION
Course Code 20SCS244, 20SCE242 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction: Definition of PR, Applications, Datasets for PR, Different paradigms for PR,
Introduction to probability, events, random variables, Joint distributions and densities, moments.
Estimation minimum risk estimators, problems
Module -2
Representation: Data structures for PR, Representation of clusters, proximity measures, size of
patterns, Abstraction of Data set, Feature extraction, Feature selection, Evaluation
Module – 3
Nearest Neighbor based classifiers & Bayes classifier: Nearest neighbor algorithm, variants of
NN algorithms, use of NN for transaction databases, efficient algorithms, Data reduction,
prototype selection, Bayes theorem, minimum error rate classifier, estimation of probabilities,
estimation of probabilities, comparison with NNC, Naive Bayes classifier, Bayessian belief
network
Module-4
Naive Bayes classifier, Bayessian belief network, Decision Trees: Introduction, DT for PR,
Construction of DT, Splitting at the nodes, Over fitting & Pruning, Examples , Hidden
Markov models: Markov models for classification, Hidden Markov models and classification
using HMM
Module-5
Clustering: Hierarchical (Agglomerative, single/complete/average linkage, wards, Partitional
(Forgy’s, k-means, Isodata), clustering large data sets, examples, An application: Handwritten
Digit recognition

Course outcomes:
At the end of the course the student will be able to:
• Explain pattern recognition principals
• Develop algorithms for Pattern Recognition.
• Develop and analyze decision tress.
• Design the nearest neighbor classifier.
• Apply Decision tree and clustering techniques to various applications
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Pattern Recognition ( An V Susheela Devi, M Universities Press 2011
Introduction) Narsimha Murthy
2 Pattern Recognition & Image Earl Gose, Richard PH 1996.
Analysis Johnsonbaugh,
Steve Jost
Reference Books
1 Pattern Classification Duda R. O., P.E. John Wiley and sons 2000.
Hart, D.G. Stork
 M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - II
IMAGE PROCESING AND MACHINE VISION
Course Code 20SCS251 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction and Digital Image Fundamentals
Motivation & Perspective, Applications, Components of Image Processing System,
Fundamentals Steps in Image 20% Processing, Image Sampling and Quantization, Some basic
relationships like Neighbors, Connectivity, Distance Measures between pixels
Module-2
Image Enhancement in the Spatial and Frequency Domain
Image enhancement by point processing, Image enhancement by neighbourhood processing,
Basic Gray Level 20% Transformations, Histogram Processing, Enhancement Using Arithmetic
and Logic operations, Zooming, Basics of Spatial Filters, Smoothening and Sharpening Spatial
Filters, Combining Spatial Enhancement Methods. Introduction to Fourier Transform and the
frequency Domain, Smoothing and Sharpening Frequency Domain Filters, Homomorphic
Filtering
Module-3
Image Restoration and Image Compression
Model of The Image Degradation / Restoration Process, Noise Models, Restoration in the
presence of Noise Only Spatial Filtering, Periodic Noise Reduction by Frequency Domain
Filtering, Linear Position-Invariant Degradations, Estimation of Degradation Function, Inverse
filtering, Wiener filtering, Constrained Least Square Filtering, Geometric Mean Filter, Geometric
Transformations. Data Redundancies, Image Compression models, Elements of Information
Theory, Lossless and Lossy compression, Huffman Coding, Shanon-Fano Coding, Arithmetic
Coding, Golomb Coding, LZW Coding, Run Length Coding, Loss less predictive Coding, Bit
Plane Coding, Image compression standards.
Module-4
Image Segmentation and Morphological Image Processing
Discontinuity based segmentation, similarity based segmentation, Edge linking and boundary
detection, 20% Threshold, Region based Segmentation Introduction to Morphology, Dilation,
Erosion, Some basic Morphological Algorithms
Module-5
Object Representation and description and Computer Vision Techniques
Introduction to Morphology, Some basic Morphological Algorithms, Representation, Boundary
Descriptors, Regional Descriptors, Chain Code, Structural Methods. Review of Computer Vision
applications; Fuzzy-Neural algorithms for computer vision applications

Course outcomes:
At the end of the course the student will be able to:
• Explain the fundamentals of image processing and computer vision
• Illustrate the image enhancement techniques
• Illustarte Image restoration and image compression technique
• Tell about image segmentationa dn morphological image processing
 • Summarize computer vision techniques and its uses
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Digital Image Processing Rafael C. Gonzalez Pearson Education 3rd edition
& Richard E. Woods
2 Computer Vision: A Modern David A. Forsyth, Prentice Hall
Approach Jean Ponce
3 Fundamental of Digital Image A.K. Jain PHI
Processing
Reference Books
1 Digital Image Processing W.K. Pratt

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - II
OBJECT ORIENTED DESIGN
Course Code 20SCS252 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
The Motivation for Object-Oriented Programming, Classes and Objects: The Building Blocks of
the Object-Oriented ParadigmTopologies of Action-Oriented Versus Object-Oriented
Applications,
Module-2
The Relationships Between Classes and ObjectsThe Inheritance Relationship
Module-3
Multiple Inheritance, The Association Relationship,
Module-4
Class-Specific Data and Behavior, Physical Object-Oriented Design,
Module-5
The Relationship Between Heuristics and PatternsThe Use of Heuristics in Object-Oriented
Design

Course outcomes:
At the end of the course the student will be able to:
• Identify the heuristics of the object oriented programming
• Explain the fundamentals of OOP
 • Examine fine object oriented relations
• Explain the role of Physical Object-Oriented Design,
• Make use of Heuristics in The Use of Heuristics in Object-Oriented Design
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Object Oriented Desing Heuristics Arthur J Riel Addison-Wesley 1996
Reference Books

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - II
SOFTWARE DEFINED NETWORKS
Course Code 20SCS253, 20LNI31, 20SCE333
CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction, Centralized and Distributed Control and Data Planes, OpenFlow
Module-2
SDN Controllers, Network Programmability,
Module-3
Data Center Concepts and Constructs, Network Function Virtualization
Module-4
Network Topology and Topological Information Abstraction, Building an SDN Framework
Module-5
Use Cases for Bandwidth Scheduling, Manipulation, and Calendaring, Use Cases for Input
Traffic Monitoring, Classification, and Triggered Actions

Course outcomes:
At the end of the course the student will be able to:
• Explain the fundamentals of SDN and make use of open flow tool
• Illustrate the concepts of controllers and network programmability
• Explain data center and NFV
• Build an SDN framework
 • Report use case
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Author/s Publisher Edition and year
Name
1 SDN: Software Defined Networks Ken Gray, Thomas D. O’Reilly 2013
Nadeau
Reference Books
2 Software Defined Networks Paul Goransson Chuck Elsevier 2nd Edition 2016
Black Timothy Culver

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - II
MODERN COMPUTER ARCHITECTURE
Course Code 20SCS254 CIE Marks 40
TeachingHours/Week (L:T:P) 4:0:0 SEE Marks 60
Credits 04 Exam Hours 03
Module-1
Fundamentals Of Computer Design, Pipelining, ILP Introduction; Classes of computers;
Defining computer architecture; Trends in Technology, power in Integrated Circuits and cost;
Dependability; Measuring, reporting and summarizing Performance; Quantitative Principles of
computer design. Introduction; Pipeline hazards; Implementation of pipeline; What makes
pipelining hard to implement? Instruction –Level Parallelism – 1 ILP: Concepts and challenges;
Basic Compiler Techniques for exposing ILP; Reducing Branch costs with prediction;
Overcoming Data hazards with Dynamic scheduling; Hardware-based speculation. Instruction –
Level Parallelism – 2 Exploiting ILP using multiple issue and static scheduling; Exploiting ILP
using dynamic scheduling, multiple issue and speculation; Advanced Techniques for instruction
delivery and Speculation; The Intel Pentium 4 as example.
Module-2
Review of Memory Hierarchy, Memory Hierarchy design Introduction; Cache performance;
Cache Optimizations, Virtual memory, Introduction; Advanced optimizations of Cache
performance; Memory technology and optimizations; Protection: Virtual memory and virtual
machines.
Module-3
Theory of Parallelism Parallel Computer Models, The State of Computing, Multiprocessors and
Multicomputer, Multivector and SIMD Computers, PRAM and VLSI Models, Program and
Network Properties, Conditions of Parallelism, Program Partitioning and Scheduling, Program
Flow Mechanisms, System Interconnect Architectures, Principles of Scalable Performance,
Performance Metrics and Measures, Parallel Processing Applications, Speedup Performance
Laws. For all Algorithm or mechanism any one example is sufficient.
Module-4
Hardware Technologies Processors and Memory Hierarchy, Advanced Processor Technology,
Superscalar and Vector Processors, Memory Hierarchy Technology, Virtual Memory
Technology. For all Algorithms or mechanisms any one example is sufficient. Bus Systems,
Cache Memory Organizations, Shared Memory Organizations, Sequential and Weak
Consistency Models, Pipelining and Superscalar Techniques, Linear Pipeline Processors,
Nonlinear Pipeline Processors. For all Algorithms or mechanisms any one example is sufficient
Module-5
Parallel and Scalable Architectures Multiprocessors and Multicomputers, Multiprocessor
System Interconnects, Cache Coherence and Synchronization Mechanisms, MessagePassing
Mechanisms, Multivector and SIMD Computers, Vector Processing Principles, Multivector
Multiprocessors, Compound Vector Processing, Scalable, Multithreaded, and Dataflow
Architectures, Latency-Hiding Techniques, Principles of Multithreading,
FineGrainMulticomputers. For all Algorithms or mechanisms any one example is sufficient.

Course outcomes:
At the end of the course the student will be able to:
• Explain the fundamentals of Fundamentals Of Computer Design, Pipelining, ILP
• Summarize the concept of memory
• Abstracting the concept of parallelism
• Summarize the hardware technologies
• Oulineparallel and scalable architectures
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Advanced Computer Architecture Kai Hwang and McGraw Hill 3/e. 2015
(SIE): Parallelism, Scalability, Naresh Jotwani Education
Programmability
2 Computer Architecture: A John L. Hennessy Morgan Kaufmann 5th edition 2013
quantitative approach and David A. Elseveir
Patterson
Reference Books
1 Computer Systems and Design and Vincent Heuring, et Pearson Education 2ndedition, 2009
Architecture al
 M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - III
DEEP LEARNING
Course Code 20SCS31 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Machine Learning Basics: Learning Algorithms, Capacity, Overfitting and Underfitting,
Hyperparameters and Validation Sets, Estimator, Bias and Variance, Maximum Likelihood
Estimation, BayesianStatistics, Supervised Learning Algorithms, Unsupervised Learning
Algorithms, Stochastic Gradient Decent, building a Machine Learning Algorithm, Challenges
Motivating Deep Learning.
Module-2
Deep Feedforward Networks: Gradient-Based Learning, HiddenUnits, ArchitectureDesign,
Back-Propagation. Regularization: Parameter Norm Penalties, Norm Penalties as Constrained
Optimization, Regularization and Under-Constrained Problems, Dataset Augmentation, Noise
Robustness, Semi-Supervised Learning, Multi-Task Learning, Early Stopping, Parameter Tying
and Parameter Sharing, SparseRepresentations, Bagging, Dropout.
Module-3
Optimization for Training Deep Models: How Learning Differs from Pure Optimization,
Challenges in Neural Network Optimization, Basic Algorithms.Parameter Initialization
Strategies, Algorithms with Adaptive Learning Rates. Convolutional Networks: The
Convolution Operation,Motivation,Pooling, Convolution and Pooling as an Infinitely Strong
Prior, Variants of the Basic Convolution Function, StructuredOutputs, DataTypes, Efficient
Convolution Algorithms, Random or Unsupervised Features.
Module-4
Sequence Modelling: Recurrent and Recursive Nets: Unfolding Computational Graphs,
Recurrent Neural Networks, Bidirectional RNNs, Encoder-Decoder Sequence-to-Sequence
Architectures, Deep Recurrent Networks, Recursive Neural Networks. Long short-term memory
Module-5
Practical Methodology: PerformanceMetrics, Default Baseline Models, Determining Whether
to Gather More Data, Selecting Hyperparameters, Debugging Strategies, Example: Multi-Digit
Number Recognition. Applications: Vision, NLP, Speech.

Course outcomes:
At the end of the course the student will be able to:
• Identify the deep learning algorithms which are more appropriate for various types of learning
tasks in various domains.
• Implement deep learning algorithms and solve real-world problems.
• Execute performance metrics of Deep Learning Techniques.
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
 • Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Deep Learning Lan Good fellow MIT Press 2016.
and Yoshua Bengio
and Aaron Courville
Reference Books
1 Neural Networks:Asystematic Raúl Rojas 1996.
Introduction
2 Pattern Recognition and machine Chirstopher Bishop 2007.
Learning

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - III
ENGINEERING ECONOMICS
Course Code 20SCS321 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Economic Decisions Making, Economic Decisions Making – Overview, Problems, Role,
Decision making process. Engineering Costs & Estimation – Fixed, Variable, Marginal &
Average Costs, Sunk Costs, Opportunity Costs, Recurring And Nonrecurring Costs, Incremental
Costs, Cash Costs vs Book Costs, Life-Cycle Costs; Types Of Estimate, Estimating Models -
Per-Unit Model, Segmenting Model, Cost Indexes, Power-Sizing Model, Improvement &
Learning Curve, Benefits. Case Study - Price and Income Elasticity of Demand in the real world
Module-2
Cash Flow, Interest and Equivalence: Cash Flow – Diagrams, Categories & Computation, Time
Value of Money, Debt repayment, Nominal & Effective Interest.
Module-3
Cash Flow & Rate Of Return Analysis Calculations, Treatment of Salvage Value, Annual Cash
Flow Analysis, Analysis Periods; Internal Rate Of Return, Calculating Rate of Return,
Incremental Analysis; Best Alternative Choosing An Analysis Method, Future Worth Analysis,
Benefit-Cost Ratio Analysis, Sensitivity And Breakeven Analysis. Economic Analysis In The
Public Sector - Quantifying And Valuing Benefits & drawbacks. Case Study – Tata Motors
Module-4
Inflation And Price Change Definition, Effects, Causes, Price Change with Indexes, Types of
Index, Composite vs Commodity Indexes, Use of Price Indexes In Engineering Economic
Analysis, Cash Flows that inflate at different Rates.
Case Study – Competition in the Advertise Segment in India
Module-5
Present Worth Analysis: End-Of-Year Convention, Viewpoint Of Economic Analysis Studies,
Borrowed Money Viewpoint, Effect Of Inflation & Deflation, Taxes, Economic Criteria,
Applying Present Worth Techniques, Multiple Alternatives.
Course outcomes:
At the end of the course the student will be able to:
• Describe the principles of economics that govern the operation of any organization under diverse
market conditions
• Comprehend macroeconomic principles and decision making in diverse business set up
• Explain the Inflation & Price Change as well as Present Worth Analysis
• Apply the principles of economics through various case studies
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Economics for Engineers James Tata McGraw-Hill
L.Riggs,David D.
Bedworth, Sabah U.
Randhawa
2 Engineering Economics Analysis Donald Newnan, OUP
Ted Eschembach,
Jerome Lavelle
3 Principle of Engineering Economic John A. White, John Wiley
Analysis Kenneth
E.Case,David
B.Pratt
4 Engineering Economy Sullivan and Wicks Pearson
Reference Books

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - III
VIRTUAL REALITY
Course Code 20SCS322 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Definition of VR, modern experiences, historical perspective.

Hardware, sensors, displays, software, virtual world generator, game engines, human senses,
perceptual psychology, psychophysics.
Geometric modeling, transforming rigid bodies, yaw, pitch, roll, axis-angle representation,
quaternions, 3D rotation inverses and conversions, homogeneous transforms, transforms to
displays, look-at and eye transforms, canonical view and perspective transforms, viewport
transforms.
Module-2
Light propagation, lenses and images, diopters, spherical aberrations, optical distortion; more
lens aberrations; spectral properties; the eye as an optical system; cameras; visual displays. Parts
of the human eye, photoreceptors and densities, scotopic and photopic vision, display resolution
requiments, eye movements, neural vision structures, sufficient display resolution, other
implications of physiology on VR.

Depth perception, motion perception, vection, stroboscopic apparent motion, color perception,
combining information from multiple cues and senses, implications of perception on VR.
Module-3
Graphical rendering, ray tracing, shading, BRDFs, rasterization, barycentric coordinates, VR
rendering problems, anti-aliasing, distortion shading, image warping (time warp), panoramic
rendering.

Velocities, acceleration, vestibular system, virtual world physics, simulation, collision detection,
avatar motion, vection
Module-4
Tracking systems, estimating rotation, IMU integration, drift errors, tilt and yaw correction,
estimating position, camera-feature detection model, perspective n-point problem, sensor fusion,
lighthouse approach, attached bodies, eye tracking, inverse kinematics, map building, SLAM.

Remapping, locomotion, manipulation, social interaction, specialized interaction mechanisms.

Module-5
Sound propagation, ear physiology, auditory perception, auditory localization; Fourier analysis;
acoustic modeling, HRTFs, rendering, auralization.

Perceptual training, recommendations for developers, best practices, VR sickness, experimental

methods that involve human subjects

Touch, haptics, taste, smell, robotic interfaces, telepresence, brain-machine interfaces.

Course outcomes:
At the end of the course the student will be able to:
• Explain fundamentals of virtual reality systems
• Summarie the hardware and software of the VR
• Analyze the applications of VR
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
 • Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 VIRTUAL REALITY Steven M. LaValle. Cambridge 2016
http://vr.cs.uiuc.edu/book.html University Press

Reference Books
1 HANDBOOK OF VIRTUAL Kelly S. Hale Kay CRC Press 2nd Edition, 2015
ENVIRONMENTS: Design, M. Stanney
Implementation, and Applications

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER – III
VIDEO PROCESSING
Course Code 20SCS323 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction to digital video processing, Video sampling and interpolation
Module-2
Motion detection and estimation, Video enhancement and restoration
Module-3
Video stabilization and mosaicing
Module-4
Video segmentation motion tracking in video
Module-5
Basic transform video coding, MPEG4 and H.264/AVC

Course outcomes:
At the end of the course the student will be able to:
• Outline the concepts of video processing and explain sampling
• Demonstrate video processing algrothms for detection, estimation, enhancement, restoratios,
stabilization, masaicing
• Illustrate segmentation and motion tracking algorithms
• Outline MPEG4 and H-254 coding techniques
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
 • Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 The Essential Guide to Video Al Bovik Elsevier 2001
Processing
Reference Books

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - III
MULTICORE ARCHITECTURE AND PROGRAMMING
Course Code 20SCS324, 20SCE22 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Classes of Computers, Trends in Technology, Power, Energy and Cost – Dependability –
Measuring, Reporting and Summarizing Performance.
Single core to Multi-core architectures: Limitations of Single Core Processors - The Multi core
era – Case Studies of Multi core Architectures.
System Overview of Threading : Defining Threads, System View of Threads, Threading above
the Operating System, Threads inside the OS, Threads inside the Hardware, What Happens
When a Thread Is Created, Application Programming Models and Threading,
Module-2
Fundamental Concepts of Parallel Programming: Designing for Threads, Task Decomposition,
Data Decomposition, Data Flow Decomposition, Implications of Different Decompositions,
Parallel Programming Patterns, A Motivating Problem: Error Diffusion, Analysis of the Error
Diffusion Algorithm, An Alternate Approach: Parallel Error Diffusion.
Threading and Parallel Programming Constructs: Performance – Scalability – Synchronization
and data sharing – Data races – Synchronization primitives (mutexes, locks, semaphores,
barriers) – deadlocks and livelocks – communication between threads (condition variables,
signals, message queues and pipes).
Module-3
TLP AND MULTIPROCESSORS : Symmetric and Distributed Shared Memory Architectures –
Cache Coherence Issues -Performance Issues – Synchronization Issues – Models of Memory
Consistency -Interconnection Networks – Buses, Crossbar and Multi-stage Interconnection
Networks.
Module-4
A Portable Solution for Threading : Challenges in Threading a Loop, Loop-carried Dependence,
Data-race Conditions, Managing Shared and Private Data, Loop Scheduling and Portioning,
Effective Use of Reductions, Minimizing Threading Overhead, Work-sharing Sections,
Performance-oriented Programming, Using Barrier and No wait, Interleaving Single-thread and
Multi-thread Execution.
OpenMP: OpenMP Execution Model – Memory Model – OpenMP Directives – Work-sharing
Constructs - Library functions – Handling Data and Functional Parallelism – Handling Loops –
Performance Considerations.
Module-5
Solutions to Common Parallel Programming Problems : Too Many Threads, Data Races,
Deadlocks, and Live Locks, Deadlock, Heavily Contended Locks, Priority Inversion, Solutions
for Heavily Contended Locks, Non-blocking Algorithms, ABA Problem, Cache Line Ping-
ponging, Memory Reclamation Problem, Recommendations, Thread-safe Functions and
Libraries, Memory Issues, Bandwidth, Working in the Cache, Memory Contention, Cache-
related Issues, False Sharing, Memory Consistency, Current IA-32 Architecture, Itanium
Architecture.

Course outcomes:
At the end of the course the student will be able to:
• Identify the limitations of single core architecture and the need for multicore architectures
• Define fundamental concepts of parallel programming and its design issues
• Solve the issues related to multiprocessing and suggest solutions
• Demonstrate the role of OpenMP and programming concept
• Make out the salient features of different multicore architectures and how they exploit parallelism
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Multicore Programming, Increased Shameem Akhter Intel Press 2006
Performance through Software and Jason Roberts
Multi-threading

2 An Introduction to Parallel Peter S Pacheco Morgan/Kuffman, 2011

Programming Elsevier

3 Multicore Apllication Darryl Gove Pearson 2011

Programming for Windows, Linux,
Oracle, Solaris
Reference Books
1 Parallel Programming in C with Michael J Quinn Tata McGraw Hill 2003
MPI and OpenMP
 M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - III
BUSINESS INTELLIGENCE AND ITS APPLICATIONS
Course Code 20SCS331, 20SIT252 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Development Steps, BI Definitions, BI Decision Support Initiatives, Development Approaches,
Parallel Development Tracks, BI Project Team Structure, Business Justification, Business
Divers, Business Analysis Issues, Cost – Benefit Analysis, Risk Assessment, Business Case
Assessment Activities, Roles Involved In These Activities, Risks Of Not Performing Step,
Hardware, Middleware, DBMS Platform, Non Technical Infrastructure Evaluation
Module -2
Managing The BI Project, Defining And Planning The BI Project, Project Planning Activities,
Roles And Risks Involved In These Activities, General Business Requirement, Project Specific
Requirements, Interviewing Process
Module – 3
Differences in Database Design Philosophies, Logical Database Design, Physical Database
Design, Activities, Roles And Risks Involved In These Activities, Incremental Rollout, Security
Management, Database Backup And Recovery
Module-4
Growth Management, Application Release Concept, Post Implementation Reviews, Release
Evaluation Activities, The Information Asset and Data Valuation, Actionable Knowledge – ROI,
BI Applications, The Intelligence Dashboard
Module-5
Business View of Information technology Applications: Business Enterprise excellence, Key
purpose of using IT, Type of digital data, basics f enterprise reporting, BI road ahead.

Course outcomes:
At the end of the course the student will be able to:
• Explain the complete life cycle of BI/Analytical development
• Illustrate technology and processes associated with Business Intelligence framework
• Demonstrate a business scenario, identify the metrics, indicators and make recommendations to
achieve the business goal.
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Business Intelligence Roadmap : Larissa T Moss and Addison Wesley 2003.
The Complete Project Lifecycle ShakuAtre Information
for Decision Support Applications Technology Series
2 Fundamentals of Business R N Prasad, Wiley India 2011.
Analytics SeemaAcharya
Reference Books
1 Business Intelligence: The Savvy David Loshin Morgan Kaufmann
Manager's Guide
2 Delivering Business Intelligence Brian Larson McGraw Hill 2006
with Microsoft SQL Server 2005
3 Foundations of SQL Server 2008 Lynn Langit Apress 2011
Business Intelligence

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - III
ROBOTICS AND AUTOMATION
Course Code 20SCS332 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
History of Automation, Reasons for automation, Disadvantages of automation, Automation systems,
Types of automation – Fixed, Programmable and Flexible automation, Automation strategies Automated
Manufacturing Systems: Components, classification and overview of manufacturing Systems, Flexible
Manufacturing Systems (FMS), Types of FMS, Applications and benefits of FMS.
Module-2
Definition of Robot, History of robotics, Robotics market and the future prospects, Robot Anatomy,
Robot configurations: Polar, Cartesian, cylindrical and Jointed-arm configuration. Robot motions, Joints,
Work volume, Robot drive systems, Precision of movement – Spatial resolution, Accuracy, Repeatability,
End effectors – Tools and gripper
Module-3
Basic Control System concepts and Models, Transfer functions, Block diagrams, characteristic equation,
Types of Controllers: on-off, Proportional, Integral, Differential, P-I, P-D, P-I-D controllers. Control
system and analysis.
Robot actuation and feedback components Position sensors – Potentiometers, resolvers, encoders,
velocity sensors. Actuators - Pneumatic and Hydraulic Actuators, Electric Motors, Stepper motors,
Servomotors, Power Transmission systems
Module-4
Robot Sensors and Machine vision system Sensors in Robotics - Tactile sensors, Proximity and Range
sensors, use of sensors in robotics. Machine Vision System: Introduction to Machine vision, the sensing
and digitizing function in Machine vision, Image processing and analysis, Training and Vision systems.
Module-5
Robots Technology of the future: Robot Intelligence, Advanced Sensor capabilities, Telepresence and
related technologies, Mechanical design features, Mobility, locomotion and navigation, the universal
hand, system integration and networking. Artificial Intelligence: Goals of AI research, AI techniques –
Knowledge representation, Problem representation and problem solving, LISP programming, AI and
Robotics, LISP in the factory.
Course outcomes:
At the end of the course the student will be able to:
• Classify various types of automation & manufacturing systems
• Discuss different robot configurations, motions, drive systems and its performance parameters.
• Describe the basic concepts of control systems, feedback components, actuators and power
transmission systems used in robots.
• Explain the working of transducers, sensors and machine vision systems
• Discuss the future capabilities of sensors, mobility systems and Artificial Intelligence in the field
of robotics.
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Automation, Production Systems M.P. Groover Pearson Education 2nd Edition, 2007
and Computer Integrated
Manufacturing
Reference Books
1 Robotics, control vision and Fu, Lee and McGraw Hill 2nd Edition, 2007.
Intelligence Gonzalez International
2 Robotic Engineering - An Klafter, Prentice Hall of 1st Edition, 2009.
Integrated approach Chmielewski and India
Negin

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - III
SPEECH PROCESSING
Course Code 20SCS333 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Intriduction, Fundamentals of Digital Speech Procesing
Module-2
Digital models for the speech signals, Time domain models for speech processing
Module-3
Digital representation of the speech waveform, short term fourier analysis
Module-4
Homomorphic speech processing, Linear predictive coding of speech: Introduction, Basic
principles of LP analys, Comutation of gain for the model, solution of LPC equation,
Comparision between the methods of solution of the LPC analysis equation, the prediction error
signal.
Module-5
Linear predictive coding of speech: Frequency domain interpretation of LP analysis, Relation of
LP analysis, Relations between various speech parameters, applications

Digital speech for man machine communication by voice

Course outcomes:
At the end of the course the student will be able to:
• Explain the fundamentals of speech processing
• Summaize the models of speech processing
• Infer the linear predicitive coding
• Illustrate the application of speech processing
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Digital Processing of Speech Lawrence R. Pearson
Signals Rabiner , Ronald W.
Schafer

Reference Books

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - III
WIRELESS SENSOR NETWORKS
Course Code 20SCS334, 20LNI324, 20SCE251, 20SCN251, CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
CHARACTERISTICS OF WSN
Characteristic requirements for WSN - Challenges for WSNs – WSN vs Adhoc Networks -
Sensor node architecture – Commercially available sensor nodes –Imote, IRIS, Mica Mote,
EYES nodes, BTnodes, TelosB, Sunspot -Physical layer and transceiver design considerations in
WSNs, Energy usage profile, Choice of modulation scheme, Dynamic modulation scaling,
Antenna considerations.
Module-2
MEDIUM ACCESS CONTROL PROTOCOLS
Fundamentals of MAC protocols - Low duty cycle protocols and wakeup concepts – Contention
based protocols - Schedule-based protocols - SMAC - BMAC - Traffic-adaptive medium access
protocol (TRAMA) - The IEEE 802.15.4 MAC protocol.
Module-3
ROUTING AND DATA GATHERING PROTOCOLS
Routing Challenges and Design Issues in Wireless Sensor Networks, Flooding and gossiping –
Data centric Routing – SPIN – Directed Diffusion – Energy aware routing - Gradient-based
routing - Rumor Routing – COUGAR – ACQUIRE – Hierarchical Routing - LEACH, PEGASIS
– Location Based Routing – GF, GAF, GEAR, GPSR – Real Time routing Protocols – TEEN,
APTEEN, SPEED, RAP - Data aggregation - data aggregation operations - Aggregate Queries in
Sensor Networks - Aggregation Techniques – TAG, Tiny DB.
Module-4
EMBEDDED OPERATING SYSTEMS
Operating Systems for Wireless Sensor Networks – Introduction - Operating System Design
Issues - Examples of Operating Systems – TinyOS – Mate – MagnetOS – MANTIS - OSPM -
EYES OS – SenOS – EMERALDS – PicOS – Introduction to Tiny OS – NesC – Interfaces and
Modules- Configurations and Wiring - Generic Components -Programming in Tiny OS using
NesC, Emulator TOSSIM.
Module-5
APPLICATIONS OF WSN
WSN Applications - Home Control - Building Automation - Industrial Automation - Medical
Applications - Reconfigurable Sensor Networks - Highway Monitoring - Military Applications -
Civil and Environmental Engineering Applications - Wildfire Instrumentation - Habitat
Monitoring - Nanoscopic Sensor Applications – Case Study: IEEE 802.15.4 LR-WPANs
Standard - Target detection and tracking - Contour/edge detection - Field sampling.

Course outcomes:
At the end of the course the student will be able to:
• Know the basics , characteristics and challenges of Wireless Sensor Network
• Apply the knowledge to identify appropriate physical and MAC layer protocol
• Apply the knowledge to identify the suitable routing algorithm based on the network and user
requirement
• Be familiar with the OS used in Wireless Sensor Networks and build basic modules
• Understand the applications of WSN in various fields
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Wireless Sensor Networks Kazem Sohraby, John Wiley & Sons 2007
Technology, Protocols, and Daniel Minoli and
Applications Taieb Znati
2 Protocols and Architectures for Holger Karl and John Wiley & Sons, 2005
Wireless Sensor Network Andreas Willig Ltd.
Reference Books
1 A survey of routing protocols in K. Akkaya and M. Elsevier Ad Hoc Vol. 3, no. 3, pp.
wireless sensor networks Younis Network Journal 325--349
2 TinyOS Programming Philip Levis
3 Wireless Sensor Network Designs Anna Ha´c John Wiley & Sons
Ltd.