R22-M.tech Curriculum and Syllabus

PSN College of Engineering
and Technology
Department of Computer Science and Engineering
M.Tech I.T - R 2022- Curriculum and Syllabus (I to IV Semester)

PSN COLLEGE OF ENGINEERING AND TECHNOLOGY (AUTONOMOUS)
Department of Computer Science and Engineering Distribution of Courses -
M.Tech IT (R22)
Sl.
Course code Course Name Classification L T P C
No
SEMESTER I
1 CS624001 Applied Mathematics PC 3 1 0 4
2 IT626001 Advanced Operating Systems PC 3 0 0 3
Advanced Data Structures
3 CS624003 and Algorithms PC 3 0 0 3
4 CS624004 Cryptography and Hashing PC 3 0 0 3
5 Programme Elective -I PE 3 0 0 3
6 AP620004 Research Methodology IC 3 0 0 3
7 CS624501 Technical Seminar-I EEC 2 0 0 1
8 CS624101 Data Structures Laboratory PC 0 0 4 2
9 English for Manuscript Writing IM 2 0 0 0
SEMESTER II
10 IT626002 Big Data Analytics PC 3 0 0 3
Digital Image Processing Tools
11 CS624005 and Techniques PC 3 0 0 3
12 CS624007 Cloud Computing Technologies PC 3 0 0 3
13 CS624008 Internet Security PC 3 0 0 3
14 Programme Elective -II PE 3 0 0 3
15 Programme Elective -III PE 3 0 0 3
16 CS624102 Image Processing Laboratory PC 0 0 4 2
17 Literature reading skills IM 2 0 0 0
SEMESTER III
18 Programme Elective-IV PE 3 0 0 3
19 Programme Elective-V PE 3 0 0 3
20 Institute Elective IE 3 0 0 3
21 CS624301 Project Phase - I EEC 0 0 8 8
SEMESTER IV
Project Phase - II & Journal
22 CS624302 Publication EEC 0 0 12 12
23 CS624502 Technical Seminar-II EEC 2 0 0 1
Subject Total
Sl. No Code Subject Name L T P C Periods
Programme Elective -I [Sem-I]
1 CS624201 Advanced Database Technologies 3 0 0 3 45
2 IT626201 Web Technology 3 0 0 3 45
3 IT626202 Unix Internals 3 0 0 3 45
4 IT626203 Wireless Sensor Networks 3 0 0 3 45
5 CS624203 Artificial Intelligence 3 0 0 3 45
Programme Elective -II [Sem-II]

1 CS624206 Internet of Things 3 0 0 3 45
2 IT626204 Deep Learning 3 0 0 3 45
3 IT626205 Network Security 3 0 0 3 45
4 CS624209 Software Reliability and Metrics 3 0 0 3 45
Human Computer Interaction 3 0 0 3 45
5 IT626205 Techniques
Programme Elective -III [Sem-II]

Advanced Computer Graphics and 3 0 0 3 45
1 IT626207 Animations
Software Quality Assurance and 3 0 0 3 45
2 CS624211 Testing
3 CS624212 Cognitive Computing 3 0 0 3 45
4 CS624213 Social Network Analysis 3 0 0 3 45
5 CS624215 Blockchain Technologies 3 0 0 3 45
Programme Elective -IV [Sem-III]

1 IT626208 Pattern Recognition 3 0 0 3 45
2 IT626209 Parallel Computing 3 0 0 3 45
3 IT626210 Mobile Application Development 3 0 0 3 45
4 IT626211 Virtual and Augment Reality 3 0 0 3 45
5 IT626212 Multimedia Databases 3 0 0 3 45
Programme Elective -V [Sem-III]

Multimedia and Compression 3 0 0 3 45
1 CS624221 Techniques
2 IT626213 Remote Sensing 3 0 0 3 45
3 IT626214 Grid Computing 3 0 0 3 45
4 IT626215 Web Mining 3 0 0 3 45
5 IT626216 Software Quality Assurance 3 0 0 3 45
Institute Elective
Subject Total
Sl. No Code Subject Name L T P C Periods
1 IT626901 Modern Sensor Technology 3 0 0 3 45
Decision Support and Intelligent 3 0 0 3 45
2 IT626902 Systems
PSN COLLEGE OF ENGINEERING AND TECHNOLOGY (Autonomous)
Tirunelveli – 627152
CS624001/ Applied mathematics
(Under Regulation 2022)
(Applicable from the academic year 2022-23 onwards)
L T P C
3 1 0 4
Unit I – PROBABILITY AND RANDOM VARIABLES

Probability - Baye’s Theorem and Applications - Discrete and Continuous Random Variables
- Discrete Probability Distributions - Binomial, Poisson and Geometric - Continuous
Probability Distributions - Uniform, Exponential and Normal
Unit II – QUEUING MODELS

Poisson Process - Markovian Queues - Single and Multi-Server Models - Little’s Formula -
Machine Interference Model - Self Service Queue -Non- Markovian Queues -
PollaczekKhintchine Formula
Unit III – SIMULATION

Discrete Even Simulation - Monte - Carlo Simulation - Stochastic Simulation – Applications
to Queuing systems
Unit IV – LINEAR PROGRAMMING

Formulation - Graphical Solution - Simplex Method - Two Phase Method - Transportation
and Assignment Problems
Unit V- NON-LINEAR PROGRAMMING

Lagrange Multipliers - Equality Constraints - Inequality Constraints - Kuhn - Tucker
conditions - Quadratic Programming.
IT626001: Advanced Operating Systems
L T P C
3 0 0 3
Course Objective:
1. To learn the fundamentals of Operating Systems..
2. To gain knowledge on Distributed operating system concepts.
3. To gain insight on to the distributed resource management components.
4. To know the components and management aspects of Real time,
Mobile operating systems
5. To learn about the Linux system and Management.
Pre-requisites, if any: Basic Knowledge of about computer operating system
Unit 1 FUNDAMENTALS OF OPERATING SYSTEMS
Overview – Synchronization Mechanisms – Processes and Threads - Process Scheduling –
Deadlocks: Detection, Prevention and Recovery – Models of Resources – Memory
Management Techniques.
Unit 2 DISTRIBUTED OPERATING SYSTEMS
Issues in Distributed Operating System – Architecture – Communication Primitives –
Lamport’s Logical clocks – Causal Ordering of Messages – Distributed Mutual Exclusion
Algorithms – Centralized and Distributed Deadlock Detection Algorithms – Agreement
Protocols.
Unit 3 DISTRIBUTED RESOURCE MANAGEMENT
Distributed File Systems – Design Issues - Distributed Shared Memory – Algorithms for
Implementing Distributed Shared memory–Issues in Load Distributing – Scheduling
Algorithms – Synchronous and Asynchronous Check Pointing and Recovery – Fault
Tolerance – Two-Phase Commit Protocol – Nonblocking Commit Protocol – Security and
Protection.
Unit 4 REAL TIME AND MOBILE OPERATING SYSTEMS
Basic Model of Real Time Systems - Characteristics- Applications of Real Time Systems –
Real Time Task Scheduling - Handling Resource Sharing - Mobile Operating Systems –
Micro Kernel Design - Client Server Resource Access – Processes and Threads - Memory
Management - File system.
Unit 5 LINUX SYSTEM AND MANAGEMENT
Linux System: Design Principles - Kernel Modules - Process Management Scheduling -
Memory Management - Input-Output Management - File System - Interprocess
Communication. iOS and Android: Architecture and SDK Framework - Media Layer -
Services Layer - Core OS Layer - File System.
COURSE OUTCOMES VS PROGRAM OUTCOMES MAPPING
Course Program Outcomes Program

Outcomes Specific
Outcomes
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 2
CO2 3 2 2
CO3 2 2 2
CO4 2 2 1
CO5 2 2 2
Entercorrelationlevels1,2&3defineas:1-low,2- medium,&3-high
Course Outcomes
At the end of the Course the students will be able to,
CO Outcomes Bloom’s Level
CO1 know the basics of operating systems. B2
CO2 know the concepts of Distributed operating Systems. B1
CO3 Understand the Concept of Distributed Resource B2
management.
CO4 Learn about the Concept of Real time and mobile B3
operating systems.
CO5 Understand the concept of Linux and management. B2
Text Books
1. Mukesh Singhal and Niranjan G. Shivaratri, “Advanced Concepts in Operating

Systems – Distributed, Database, and Multiprocessor Operating Systems”, Tata
McGraw-Hill, 2001.
Reference Books
1. Abraham Silberschatz; Peter Baer Galvin; Greg Gagne, “Operating System

Concepts”, Seventh Edition, John Wiley & Sons, 2004.
2. Daniel P Bovet and Marco Cesati, “Understanding the Linux kernel”, 3rd
edition, O’Reilly, 2005.
Department of COMPUTER SCIENCE AND ENGINEERING
CS624003: Advanced Data structures and
Algorithms (Under Regulation 2022)
L T P C
3 0 0 3
Course Objective:
1. To understand the usage of algorithms in computing

2. To learn and use hierarchical data structures and its operations
3. To learn the usage of graphs and its applications
4. To select and design data structures and algorithms that is appropriate for
problems
5. To study about NP Completeness of problems.
Pre-requisites, if any: Fundamentals of data structures and algorithms
Unit 1 Algorithm and Analysis of Algorithm

Algorithms – Algorithms as a problem solving technique – Time and Space complexity of
algorithms- Asymptotic analysis-Average and worst-case analysis-Asymptotic notation-
Importance of efficient algorithms- Recurrences: The Substitution Method – The Recursion-
Tree Method- Data structures and algorithms.
Unit 2 Hierarchical Datastructures
Binary Search Trees: Basics – Querying a Binary search tree – Insertion and Deletion- Red
Black trees: Properties of Red-Black Trees – Rotations – Insertion – Deletion -B-Trees:
Definition of B -trees – Basic operations on B-Trees – Deleting a key from a B-Tree- Heap –
Heap Implementation – Fibonacci Heaps: structure – Mergeable-heap operations- Decreasing
a key and deleting a node-Bounding the maximum degree.
Unit 3 Graphs
Elementary Graph Algorithms: Representations of Graphs – Breadth-First Search – Depth-
First Search –Strongly Connected Components- Minimum Spanning Trees: Kruskal and
Prim- Single-Source Shortest Paths: The Bellman-Ford algorithm – Single-Source Shortest
paths in Directed Acyclic Graphs – Dijkstra‘s Algorithm; All-Pairs Shortest Paths: The
Floyd-Warshall Algorithm
Unit 4 Algorithm Design Techniques
Dynamic Programming: Multi-stage graphs – Flow Shop Scheduling; Greedy Algorithm:
Tree vertex Splitting – Job sequencing with deadlines; Backtracking: Graph Coloring –
Knapsack Problem
Unit 5 NP – Complete and NP - Hard
NP-Completeness: Polynomial Time – Polynomial-Time Verification – NP- Completeness
and Reducibility – NP-Completeness Proofs – NP-Complete Problems: Clique Decision
Problem – Traveling Salesman Problem.
Course Outcomes
CO1 Design algorithms for various computing problems and Apply
analyze the time and space complexity of algorithms.
CO2 Identify and implement tree data structures and apply Apply
them to solve problems.
CO3 Identify and implement graph data structures and apply Apply
them to solve problems.
CO4 Ability to understand and design algorithms using Apply
appropriate algorithm design techniques for the given
problem.
CO5 Ability to understand role the NP – Complete and NP – Remember
Hard Problems in solving real world problems.
Co-po Mapping
Program
Specific
Program Outcomes
Course Outcome
Outcom s
es P PS PS
PO PO PO PO PO PO PO PO PO PO1 PO1
O O O
1 2 3 4 5 6 7 8 9 0 1
12 1 2
CO 1 3 3 2 2 1 - - - - - - - 3 -
CO 2 3 3 3 3 - - - - - - - - 2 -
CO 3 3 3 3 3 - - - - - - - - - 2
CO 4 3 3 3 3 - - - - - - - - - 1
CO 5 3 2 2 2 - - - - - - - - - 2
Enter correlation levels 1, 2 & 3 define as: 1-low, 2- medium, & 3-high
Text Books
1. S.Sridhar, “Design and Analysis of Algorithms”, Oxford University Press, 1st
Edition, 2014.
2. Adam Drozdex, “Data Structures and algorithms in C++”, Cengage Learning, 4th
Edition, 2013.
3. Ellis Horowitz, SartajShani, SanguthevarRajasekaran, “Fundamentals Of Computer
Algorithms”. India, Misc, 2010.
Reference Books
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to
algorithms", Second Edition, Prentice Hall of India Ltd
2. Mark Allen Weiss, “Data Structures and Algorithms in C++”, Pearson Education, 3rd
Edition, 2009
3. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and
Algorithms”, Pearson Education, Reprint, 2006.
CS624004: Cryptography and Hashing
L T P C
3 0 0 3
Course Objective:
1. To introduce the fundamental concepts and techniques in cryptography and
network security
2. To illustrate the working principles of various Symmetric Ciphers.
3. To explore knowledge on Asymmetric Ciphers.
4. To study system boot and the Init process.
5. To learn the various Hash function.
6. To realize the Construction.
Pre-requisites, if any: Probability and Number Theory

Unit 1 INTRODUCTION
Computer Security Concepts- OSI Security Architecture- Security Attacks- Security
Services- Security Mechanisms-Model for Network Security-Classical Encryption
Techniques- Symmetric Cipher Model-Substitution Techniques-Transposition Techniques-
Rotor Machines- Stegnography- Basic Concepts in Number Theory and Finite Fields-
Divisibility and the Division Algorithm- Euclidean Algorithm- Modular Arithmetic-Groups,
Rings, and Fields- Finite Fields of the Form GF(p)
Unit 2 MODERN SYMMETRIC CIPHERS
Block Ciphers and the Data Encryption Standard-Block Cipher Principles-The Data
Encryption Standard (DES)- Strength of DES-Differential and Linear Cryptanalysis-Block
Cipher Design Principles-Advanced Encryption StandardBlock Cipher Modes of Operation-
Stream Ciphers-RC4
Unit 3 ASYMMETRIC CIPHERS
Prime Numbers- Fermat's and Euler's Theorems- Testing for Primality- Chinese Remainder
Theorem-Discrete Logarithms- Principles of Public-Key Cryptosystems- RSA Algorithm-
Diffie-Hellman Key Exchange- ElGamal Cryptosystem- Elliptic Curve Arithmetic- Elliptic
Curve Cryptography
Unit 4 HASH FUNCTION
Block cipher Based hash function - Non-Block cipher Based hash function - Design
principles - Methods of Attack on Hash function
Unit 5 CONSTRUCTION
Theoretic Construction - Hard bit and Pseudo random bit generation - strong one-way
permutation - UOWHF Construction and PBG -Strong one-way permutation

Outcomes Specific
Outcomes
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 3 3
CO2 3 3 3 2 3 3 3
CO3 3 3 2 2 3 3 3
CO4 3 2 3 2 2 2 2
CO5 3 3 3 2 3 2 2 2
Course Outcomes
Apply essential mathematical concepts to Cryptography
CO1 and identify the vulnerabilities in Classical B3
cryptosystems
CO2 Experiment Symmetric-Key cipher algorithms B5
CO3 Apply Asymmetric-Key Cryptographic techniques B3
CO4 Manipulate the Hash function B3
Demonstrate cryptographic Hash function to real-time
CO5 B3
applications
Text Books
1. William Stallings, “Cryptography and network Security”, Pearson, Sixth edition, 2013.
2. Alan G. Konheim, “Computer security & cryptography”, John Wiley & Sons, 2007.
3. Josef Pieprzyk Babak Sadeghiyan ,”Design of hashing Algoritms “,Springer-Verlag 1993
Reference Books
1. Charles P. Pfleeger, Shari Lawrence Pfleeger, “Security in computing”, Prentice Hall of
India, Third Edition, 2006.
2. Wade Trappe, Lawrence C Washington, “Introduction to Cryptography with
coding theory”, Pearson, Second edition, 2007.
3. Behrouz A.Forouzan, “Cryptography and Network Security”, Tata McGraw Hill, 2010.
4. W. Mao, “Modern Cryptography – Theory and Practice”, Pearson Education,
Second Edition, 2007
Course Code L T P C
AP620004 RESEARCH METHODOLOGY 3 0 0 3
Course Category: Institutive core Course Type: Theory
Course Objective(s): The students should be made:
Impart knowledge on basics of research methodology
Explore knowledge in technical writing in an efficient manner
Understand research problem formulation and analyses the research related information
Understand the importance of IPR
Apply the knowledge of IPR in various research projects
Course Outcomes: (COs):
At the end of the course, the student will be able to,
Understand that today’s world is controlled by Computer, Information Technology, but tomorrow
CO 1 world will be ruled by ideas, concept, and creativity.
Correlate the results of any research article with other published results. Write are viewarticle in
CO 2
the field of engineering
Understand research problem formulation & Analyze research related information and
CO 3
Follow research ethics
CO 4 Appreciate the importance of IPR and protect their intellectual property.
Understand that PR protection provides an incentive to inventors for further research work and
CO 5 investment in R & D, which leads to creation of new and better products, and in turn brings about,
economic growth and social benefits
UNIT I RESEARCH PROCESS 9
Research ethics - Research process: characteristics and requirements, Types of research, Research process: eight
step model - formulating research problem, conceptualizing research design, constructing instrument for data
collection, Selecting a sample, writing a research proposal, collecting data, processing data, writing research
report.
UNIT II RESEARCH WRITING 9
Effective literature studies approaches - technical document structuring - how to write report and research paper -
format of research proposal - developing research proposal - presentation and assessment by a review committee.
UNIT III DESIGN OF EXPERIMENTS 9
Strategy of Experimentation - Typical applications of experimental design - Guidelines for designing
experiments - Basic statistical concepts - Statistical concepts in experimentation - Regression approach to
analysis of variance.
UNIT IV INTELLECTUAL PROPERTY 9
Patents, Industrial designs and IC layout Designs, Trade Marks and Copyright, Geographical Indications, IPR
management: 5Cs model of managing IP, Emerging issues in IPR.
UNIT V ROADMAP FOR PATENT CREATION 9
Types of patent - Parts of a patent document - Terminologies and codes used in patent document - Patent
searching and analysis – Indicators for patentability - IP identification tool – public patent data base – Transfer
and infringement of patent rights – Patent commercialization.
TEXT BOOKS:
1. Ranjit Kumar, Research Methodology- A step by step guide for beginners, Pearson
Education, Australia, 2005.
2. Ann M. Korner, Guide to Publishing a Scientific paper, Bioscript Press 2004.
3. T. Ramappa, “Intellectual Property Rights Under WTO”, S. Chand, 2008
REFERENCE(S)
1. Kothari, C. R. Research Methodology - Methods and Techniques, New Age Internationalpublishers, New
Delhi, 2004.
2. Robert P. Merges, Peter S. Menell and Mark A. Lemley, “Intellectual Property in NewTechnological Age”,
Aspen Publishers, 2016
WEB REFERENCES
https://www.youtube.com/watch?v=tBXznU_TPJo
https://www.youtube.com/watch?v=y-r6ICNqZt4
https://www.youtube.com/watch?v=k3lUo0XYG3E
https://www.youtube.com/watch?v=n6jk_r5Qc14
https://www.youtube.com/watch?v=8NDpujstgNE
CO PO MAPPING :
PROGRAM
COURSE
PROGRAMS OUTCOMES SPECIFIC
OUTCOMES
OUTCOMES
PO PO PO PSO PSO
CO’s PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12 1 2
CO-1 1 2 1 2 3 1 2 2 1 2
CO-2 2 3 1 3 2 2 2 1 2 2
CO-3 2 2 2 3 3 1 2 1 2
CO-4 3 3 1 1 3 3 2 1 2 2
CO-5 1 1 1 3 3 2 1 1 3 2
Department of COMPUTER SCIENCE AND ENGINEERING
CS624101: DATA STRUCTURES LABORATORY
L T P C
0 0 4 2
Course Objective:
1. To acquire the knowledge of using advanced tree structures.
2. To learn the usage of heap structures.
3. To understand the usage of graph structures and spanning trees.
4. To learn about Huffman Coding
Pre-requisites, if any: Basic Knowledge about Data Structures

LIST OF EXPERIMENTS:
1. Implementation of Merge Sort and Quick Sort-Analysis
2. Implementation of a Binary Search Tree
3. Red-Black Tree Implementation
4. Heap Implementation
5. Fibonacci Heap Implementation
6. Graph Traversals
7. Spanning Tree Implementation
8. Shortest Path Algorithms (Dijkstra's algorithm, Bellman Ford Algorithm)
9. Implementation of Matrix Chain Multiplication
10. Activity Selection and Huffman Coding Implementation
Course Outcomes

CO1 Design and implement basic data structures. Apply
CO2 Implement advanced data structures extensively Apply
CO3 Design algorithms using graph structures. Apply
CO4 Design and develop efficient algorithms with minimum Apply
complexity using design techniques.
CO5 Understand and develop Dynamic programming Understand
algorithms.
Co-po Mapping
Program
Specific
Program Outcomes
Course Outcome
Outcom s
es P PS PS
PO PO PO PO PO PO PO PO PO PO1 PO1
O O O
1 2 3 4 5 6 7 8 9 0 1
12 1 2
CO 1 3 3 3 - - - - - - - - - 3 -
CO 2 3 - 3 - 2 - - - - - - - 3 -
CO 3 3 2 3 - - - - - - - - - 3 -
CO 4 3 3 2 - - - - - - - - - - 2
CO 5 2 3 3 - - - - - - - - - - 2
Enter correlation levels 1, 2 & 3 define as: 1-low, 2- medium, & 3-high
LAB REQUIREMENT FOR A BATCH OF 30 STUDENTS

Hardware Requirements:
 l Desktop Systems - Pentium IV with 2 GB RAM
 160 GB HARD Disk
 Monitor 1024 x 768 color
Software Requirements:
 Windows Operating System.
 Dev C++/C/Equivalent Compiler.
 JDK 1.8
Text Books
1. S.Sridhar, “Design and Analysis of Algorithms”, Oxford University Press, 1st
Edition, 2014.
2. Adam Drozdex, “Data Structures and algorithms in C++”, Cengage Learning, 4th
Edition, 2013.
3. Ellis Horowitz, SartajShani, SanguthevarRajasekaran, “Fundamentals Of Computer
Algorithms”. India, Misc, 2010.
Reference Books
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to
algorithms", Second Edition, Prentice Hall of India Ltd
2. Mark Allen Weiss, “Data Structures and Algorithms in C++”, Pearson Education, 3rd
Edition, 2009
3. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures
and Algorithms”, Pearson Education, Reprint, 2006
II SEMESTER
IT626002: Big Data Analytics
L T P C
3 0 0 3
Course Objective:
1. To gain knowledge about the competitive advantages of big data analytics.
2. To understand about the big data frameworks.
3. To understand about the features of Data Analysis.
4. To learn about the Stream Computing.
5. To gain knowledge on Hadoop related tools such as HBase, Cassandra, Pig,
and Hive for big data analytics.
Pre-requisites, if any: Basic knowledge in Data Analysis

Unit I Introduction to Big Data
Big Data – Definition, Characteristic Features – Big Data Applications - Big Data vs
Traditional Data - Risks of Big Data - Structure of Big Data - Challenges of Conventional
Systems - Web Data – Evolution of Analytic Scalability - Evolution of Analytic Processes,
Tools and methods - Analysis vs Reporting - Modern Data Analytic Tools.
Unit 2 Hadoop Frame Work
Distributed File Systems - Large-Scale File System Organization – HDFS concepts -
MapReduce Execution, Algorithms using MapReduce, Matrix-Vector Multiplication –
Hadoop YARN.
Unit 3 Data Analysis
Safety and Risk – Assessment of Safety and Risk – Risk Benefit Analysis and Reducing Risk
- Respect for Authority – Collective Bargaining – Confidentiality – Conflicts of Interest –
Occupational Crime – Professional Rights – Employee Rights – Intellectual Property Rights
(IPR) – Discrimination
Unit 4 Mining Data Streams
Statistical Methods: Regression modelling, Multivariate Analysis - Classification: SVM &
Kernel Methods - Rule Mining - Cluster Analysis, Types of Data in Cluster Analysis,
Partitioning Methods, Hierarchical Methods, Density Based Methods, Grid Based Methods,
Model Based Clustering Methods, Clustering High Dimensional Data - Predictive Analytics –
Data analysis using R.
Unit 5 Big Data Frameworks
Introduction to NoSQL – Aggregate Data Models – Hbase: Data Model and Implementations
– Hbase Clients – Examples – .Cassandra: Data Model – Examples – Cassandra Clients –
Hadoop Integration. Pig – Grunt – Pig Data Model – Pig Latin – developing and testing Pig
Latin scripts. Hive – Data Types and File Formats – HiveQL Data Definition – HiveQL Data
Manipulation – HiveQL Queries

Outcomes Specific
Outcomes
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 2 2
CO2 2 2 2 2
CO3 3 2 2
CO4 3 2 2 2
CO5 2 1
Course Outcomes
CO1 To know, how to leverage the insights from big data B1
analytics
CO2 Know the concepts of Hadoop frame work. B1
CO3 Know the concepts of Data Analysis. B2
CO4 Analyze data by utilizing various statistical and data B4
mining approaches.
CO5 Understand the various NoSql alternative database B3
models
Text Books
1. David Loshin, "Big Data Analytics: From Strategic Planning to Enterprise
Integration with Tools, Techniques, NoSQL, and Graph", 2013.
Reference Books
1. Michael Berthold, David J. Hand, ―Intelligent Data Analysis‖, Springer, Second
Edition, 2007.
2. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today's Businesses", Wiley,
2013.
3. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging
World of Polyglot Persistence", Addison-Wesley Professional, 2012.
CS624005: Digital Image Processing Tools and
Techniques (Under Regulation 2022)
L T P C
3 0 0 3
Course Objective:
1. To provide the basic knowledge of Digital Image Processing.
2. To Know the various image enhancement techniques.
3. To understand the various concepts of image segmentation.
4. To Learn about compression techniques.
5. To extract features for image analysis and also illustrate 3D image
visualization
Pre-requisites, if any: Basic Knowledge of Image Processing
Unit 1 INTRODUCTION TO DIGITAL IMAGE PROCESSING

Image Representation and Image Processing Paradigm - Elements of digital image
processing. Sampling and quantization-Relationships between pixels- Connectivity, Distance
Measures between pixels - Color image (overview, various color models)-Various image
formats bmp, jpeg, tiff, png, gif.
Unit 2 IMAGE ENHANCEMENT
Enhancement by point processing, Sample intensity transformation, Histogram processing,
Image subtraction, Image averaging, Spatial filtering- Smoothing Spatial filters, Sharpening
Spatial filters, Frequency domain- Fourier Transform, Low-Pass, HighPass, Laplacian,
Homomorphic filtering.
Unit 3 IMAGE SEGMENTATION
Edge detection, Thresholding, Region growing, Fuzzy clustering, Water shed algorithm,
Active contour models, Texture feature based segmentation, Graph based segmentation,
Wavelet based Segmentation-Applications of image segmentation. Region oriented
segmentation- Histogram based segmentation.
Unit 4 IMAGE COMPRESSION
Lossless compression versus lossy compression-Measures of the compression efficiency-
Huf- mann coding-Bitplane coding-Shift codes-Block Truncation coding-Arithmetic coding-
Predictive coding techniques-Lossy compression algorithm using the 2-D. DCT transform-
The JPEG 2000 standard Baseline lossy JPEG, based on DWT.
Unit 5 FEATURE EXTRACTION AND 3D IMAGE VISUALIZATION
Feature extraction: Histogram based features - Intensity features-Color, Shape features-
Contour extraction and representation-Homogenous region extraction and representation.
Sources of 3D Data sets, Slicing the Data set, Arbitrary section planes, The use of color,
Volumetric display, Stereo Viewing, Ray tracing, Reflection, Surfaces, Multiple connected
surfaces, Image processing in 3D, Measurements on 3D images.

Outcomes Specific
Outcomes
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 2 1 1
CO2 3 2 2 2 2 1 2
CO3 2 2 2 3 1 1 2
CO4 2 2 2 2 2 1 2
CO5 2 2 2 2 2 1
Course Outcomes
CO1 Understand the basic Concepts of Digital Image B2
Processing and its equivalent open source tools
CO2 Apply different Algorithm by utilizing Enhancement B3
Techniques
CO3 Learn and apply different Segmentation Techniques in B2
an Image Processing
CO4 Explore the possibility of applying various B3
Compression Techniques in an Image processing
applications
CO5 Analyze different Feature extraction approaches to B4
image processing applications
Text Books
1. Rafael C. Gonzalez and Richard E. Woods, Digital Image Processing, Third Ed.,
PrenticeHall, 2008.
Reference Books
1. William K. Pratt, Digital Image Processing, John Wiley, 4th Edition, 2007
2. Anil K. Jain, Fundamentals of Digital Image Processing, Prentice Hall of India, 1997
3. Sonka, Fitzpatrick, Medical Image Processing and Analysis, 1st Edition, SPIE,2000.
CS624007: Cloud Computing Technologies
L T P C
3 0 0 3
Course Objective:
1. To understand the concept of cloud and utility computing.
2. To understand the various issues in cloud computing.
3. To familiarize themselves with the lead players in cloud.
4. To appreciate the emergence of cloud as the next generation computing paradigm.
5. To be able to set up a private cloud.
Pre-requisites, if any: Computer Networks
Unit 1 INTRODUCTION
Introduction - Historical Development - Cloud Computing Architecture – The Cloud
Reference Model – Cloud Characteristics – Cloud Deployment Models: Public, Private,
Community, and Hybrid Clouds - Cloud Delivery Models: IaaS, PaaS, SaaS – Open Source
Private Cloud Software: Eucalyptus, Open Nebula, Open Stack.
Unit 2 VIRTUALIZATION
Data Center Technology - Virtualization - Characteristics of Virtualized Environments -
Taxonomy of Virtualization Techniques – Virtualization and Cloud Computing – Pros and
Cons of Virtualization - Implementation Levels of Virtualization - Tools and Mechanisms:
Xen, VMWare, Microsoft Hyper-V.
Unit 3 CLOUD COMPUTING MECHANISM
Cloud Infrastructure Mechanism: Cloud Storage, Cloud Usage Monitor, Resource
Replication – Specialized Cloud Mechanism: Load Balancer, SLA Monitor, Pay-per-use
Monitor, Audit Monitor, Failover System, Hypervisor, Resource Cluster, Multi Device
Broker, State Management Database – Cloud Management Mechanism: Remote
Administration System, Resource Management System, SLA Management System, Billing
Management System.
Unit 4 HADOOP AND MAP REDUCE
Apache Hadoop – Hadoop Map Reduce – Hadoop Distributed File System- Hadoop
I/ODeveloping a Map Reduce Application - Map Reduce Types and Formats - Map Reduce
Features– Hadoop Cluster Setup – Administering Hadoop.
Unit 5 SECURITY IN THE CLOUD
Basic Terms and Concepts – Threat Agents – Cloud Security Threats – Cloud Security
Mechanism: Encryption, Hashing, Digital Signature, Public Key Infrastructure, Identity and
Access Management, Single Sign-on, Cloud Based Security Groups, Hardened Virtual Server
Images
Course Outcomes

CO1 Articulate the main concepts, key technologies, strengths Apply
and limitations of cloud computing.
CO2 Identify the architecture, infrastructure and delivery models Analyze
of cloud computing.
CO3 Explain the core issues of cloud computing such as Analyze
security, privacy and interoperability
CO4 Choose the appropriate technologies, algorithms and Understand
approaches for the related issues.
CO5 Understanding the concepts of Big data tool and its analysis Understand
techniques
CO-PO Mapping
Program
CO’s
Program Outcomes Specific
No
Objectives
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 - - - - - - - - - - - 2 -
CO2 - - - 2 - - - - - 2 - - - 2
CO3 - - 3 - - - - - - 2 - - - 2
CO4 - - - 2 - - - - - - - - - 2
CO5 - - - - 2 - - - - - - 2 - 2
Text Books
1. Thomas Erl, Zaigham Mahood, Ricardo Puttini, “Cloud Computing, Concept, Technology
and Architecture”, Prentice Hall, 2013.
Reference Books
1. Toby Velte, Anthony Velte, Robert C. Elsenpeter, “Cloud Computing, A Practical
Approach”, Tata McGraw-Hill Edition, 2010.
2. Rajkumar Buyya, Christian Vecchiola, S. Thamarai Selvi, “Mastering Cloud Computing”,
Tata McGraw-Hill, 2013.
CS624008: Internet Security
L T P C
3 0 0 3
Course Objective:
1. To study the fundamental concepts of classical encryption techniques and
Crypt Analysis.
2. To understand the principles of secret keys management.
3. To acquire the concepts of IP Security and its applications
4. To study the concepts of Transport layer security and its applications
5. To learn the working principle of Email and public key distribution
Pre-requisites, if any: Basics of Cryptography
Unit 1 INTRODUCTION AND BASIC ENCRYPTION

Introduction – Essentials of Cryptography, Essentials of Networking and Internet, Security
Objectives, Communication Security, Legal restrictions, Basics of Encryption – Building
Blocks of Encryption, Cryptanalysis and Modern Codes, Brute Force cracking of Secret
Keys, Choosing Cryptography Algorithms
Unit 2 LINK ENCRYPTION AND SECURE KEY MANAGEMENT
Link Encryption – In-line Encryptor, Point to Point Encryption, IP Routed Configuration,
Managing Secret Keys – Issues in Secret Key Management, Technology - Random Key
Generation, Random Seeding, Pseudorandom Number Generators, Manual Key Distribution,
Automatic Rekeying, Key Distribution Centres, Maintaining Keys and System Security
Unit 3 IP LAYER SECURITY AND APPLICATIONS
Basic Issues in IP Security (IPSEC), Cryptographic Checksums, IP Security Protocol, IPSEC
key management, TCP/IP Network Security Protocols, Virtual Private Network (VPN) –
Issues in VPN, IPSEC proxy cryptography, IPSEC encrypting Router, Site to Site
Encryption, Remote Access with IPSEC – problems in IPSEC clients, IPSEC Client, Client
to Server site access
Unit 4 TRANSPORT LAYER SECURITY AND APPLICATIONS
Public Key Cryptography, RSA Encryption, Key Exchange with RSA, Secure Socket Layer
(SSL), World Wide Web Transaction Security – Issues in Internet Transaction Security,
Transactions on World Wide Web, Security Alternatives for Web Forms, Web Browser with
SSL, Web Server with SSL
Unit 5 SECURE E-MAIL AND PUBLIC KEY CERTIFICATES
Secure Email - Email Security Issues, Basics of Internet E-Mail, Offline Message Keying,
Digital Signature, Secure Email Client, Public Key Certificates – Distributing Public Keys,
Public Key Certificates, Certificate Distribution, Centralized Certification Authority,
Hierarchical Certification Authority, Pretty Good Privacy (PGP)

Outcomes Specific
Outcomes
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 3 3
CO2 3 3 3 2 3 3 3
CO3 3 3 2 2 3 3 3
CO4 3 2 3 2 2 2 2
CO5 3 3 2 2 2
Course Outcomes
Interpret basic building blocks of encryption for
CO1 B2
cryptanalysis
Identify suitable key generation technique for secret key
CO2 B2
management
CO3 Apply IP security in VPN and Remote Access B3
CO4 Apply SSL in World wide web transactions B3
Discover various public key and certificate distribution
CO5 B2
strategies and its use in PGP
Text Books
1. Richard E.Smith, Internet Cryptography, 6th Edition, Pearson, 2011
Reference Books
1. Tim Speed, Juanita Ellis, “Internet Security”, Elsevier, 2006.
2. Uyless Black, “Internet Security Protocols – Protecting IP Traffic”, Pearson Education,
2001
3. Wade Trappe, Lawrence C Washington, “Introduction to Cryptography with coding
theory”, 2nd edition, Pearson, 2007.
4. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education,
March 2013.
5. Bruce Schneier and Neils Ferguson, ―Practical Cryptography‖, First Edition,
WileyDreamtech India Pvt Ltd, 2003
6. W. Mao, “Modern Cryptography – Theory and Practice”, Pearson Education, Second
Edition, 2007.
7. Douglas R Simson ―Cryptography –Theory and practice‖, First Edition, CRC Press,1995
CS624102: IMAGE PROCESSING LABORATORY
L T P C
0 0 4 2
Course Objective:
1. To learn Image Processing Techniques
2. To display various Images in Image Processing
3. To implement Various Segmentation Techniques in Image Processing
4. To implement Image restoring techniques .
5. To implement slicing technique for image enhancement
Pre-requisites, if any: Knowledge in Image Processing
LIST OF EXPERIMENTS
1. Display of Grayscale Images Image, Negative of an Image (Binary & Gray Scale)
2. Implementation of Relationships between Pixels.
3. Implementation of Transformations of an Image .
4. Implementation of image restoring techniques
5. Implementation of Image Intensity slicing technique for image enhancement
6. Implementation of Canny edge detection Algorithm
7. Implement the Algorithm for Edge detection using Operators
8. Implementation of Segmentation using watershed transform.
9. Implementation of Histogram Equalization Algorithm.
10. Implementation of Non-linear Filtering Techniques.
11. Implement the Algorithm for Edge detection using Operators.
12. Implementation of Filtering in frequency domain

Outcomes Specific
Outcomes
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 2 2 2 1
CO2 3 2 2 2
CO3 2 2 1 1 2
Enter correlation levels 1, 2 & 3 define as : 1-low, 2- medium & 3-high

PROGRAMME
ELECTIVE -I [SEM-I]
CS624201: Advanced Database Technologies
L T P C
3 0 0 3
Course Objective:
1. To know the fundamental Concepts of Database Management.
2. To define a good database design
3. To define query processing using views
4. To explain the importance of security in statistical databases
5. To state the principle of design of distributed database management system
Pre-requisites, if any: Basic Knowledge in Database Technology
Unit 1 Overview
Overview of a Database Management Systems – Evolution of Database Management
Systems – Basics of the Relational Model – Design of Relational Database Schemas – High
level Database Models: Design principles – Algebraic and Logical Query Languages –
Database Language SQL – SQL in a Server Environment – Semi-structured Data Model –
Data Mining – Information Integration.
Unit 2 Query Processing and Evaluation
Query Processing: An Introduction: optimization – measure of query cost – select operation –
sorting – Join operation: Nested loop – Block nested loop – Indexed nested loop – merge join
– hash join – complex join – other operations – Representation and Evaluation of Query
Expression – Creation of Query Evaluation Plans – View and Query Processing.
Unit 3 Relational Database Design
Overview – Basics of the Relational Model – Features of Good Database Design – Enhanced
ER Tools – Functional Dependency: Theory and Normalization –Multivalued Dependency –
Fourth Normal Forms – Join Dependency – Fifth Normal Form – Inclusion Dependency –
Template Dependency - Domain Key Normal Form – Modeling Temporal Data
Unit 4 Transaction Management and Recovery
Introduction – Transaction Processing – Enhanced Lock Based Protocol – Timestamp Based
Protocol: Multiple Granularity – Multi Version Schemas: Multi Version Timestamp Ordering
– Multi Version Two Phase Locking – Weak Levels of Consistency – Concurrency in Index
Structures – Failure Classification – Recovery Algorithms – Buffer Management – Advanced
Recovery Techniques – Remote Backup Systems.
Unit 5 Database Security and Authorization
Introduction – Database Security: Scenario – Levels of Database Security: Server Security –
Database Connections – Table Access Control – Restricting Database Access – Access
Control: Granting permissions – Removing permissions – Statistical Database Security –
Multilevel Security – Audit trails in Database – Vendor Specific E-security.
COURSE OUTCOMES VS PROGRAM OUT COMES MAPPING

Outcomes Specific
Outcomes
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 2
CO2 2 3 2 2 1
CO3 3 2 2 3 1 2
CO4 2 2 1
CO5 1 2 3 3 2
Course Outcomes
CO1 Understand the fundamental Concepts of Database B2
CO2 Learn about Query Processing and Evaluation B5
CO3 Know & Discuss Relational Database Design B2
CO4 Understand the concept of Transaction and Analyze the B3
Algorithms to give Recovery Techniques
CO5 Understand the High Levels of Data Security & Access B3
Control
Text Books
1. Hector-Garcia Molina,Jeffery D.Ullman,Jenifer Wisdom,”Database System –
The Complete Book” StandfordUniveristy,Pearson Prentice Hill,2nd Edition.
2.Dr.Radyanbi Tibor “Advanced Database Management Systems” Tartalom Publication.
Reference Books
1. Silberschatz, Korth and Sudarshan “Database System Concepts”7th Edition.
2. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA
McGraw Hill 3rd Edition.
3. Jef Van Loon “Database Security Concepts and Challenges” Pearson,5th Edition.
IT626201: WEB TECHNOLOGY
L T P C
3 0 0 3
Course Objective:
1. Understand the fundamentals of object-oriented programming in Java
2. Understand the appropriate roles of subtyping and inheritance, and use them effectively.
3. Implement polymorphic code and handle runtime errors using exception handling
4. Implement polymorphic code and handle runtime errors using exception handling
5. Create user interface applications using GUI components and to understand the event
handling principles.
Pre-requisites, if any: Knowledge on basics of Java
UNIT I INTRODUCTION TO INTERNET

Overview: Evolution of the Internet, How Internet Works- Services offered on the Internet:
E-mail, Network News, Telnet, FTP, IRC. Internet Access Method: Dial-up connection,
Leased line, ISDN. Internet Services Providers (ISP): Architecture, Connection through an
ISP Server, World Wide Web Browsing: URL, Homepage, document management, cookies,
plug-in, online & offline Browsing. WWW: History of WWW, different web generations,
W3C. Search Engines: Technology Overview. Popular search engines, how to register a
website on search engines
UNIT II MARK-UP LANGUAGES
HTML& XHTML: Basic layout of HTML, Head Section: title, base, link, meta. Body Section:
Text formatting and alignment, fonts, colors, ordered and unordered lists, links, images, sounds,
video, background, tables, forms, frames. Introduction to XHTML, DHTML: Cascading style
sheet, inline styles, embedded style, linking external style sheets, positioning elements, user style
sheets, document object model. XML: Structuring data, XML namespaces, DTD and schemas,
XML variables, DOM methods, simple API for XML, web services, application of XML
UNIT III SCRIPTING LANGUAGES
Java Scripts: Introduction to scripting, user input/output, memory concepts, arithmetic,
decision making, control statement, functions, arrays, objects. VBScripts: Operators, data
types and control statements, functions, arrays, string manipulation, classes & objects. Active
Server Pages(ASP): How ASP works, ASP objects, file system, objects, Active Xcomponents
.NET overview, XML: Case study.
UNIT IV WEB DEVELOPMENT USING JAVA
Overview of Java, Use of Java for web development. Java Applets: Applet architecture,
applet class, life-cycle of applets, display methods requesting repainting, using the status
window, HTML applet tag, passing parameter to applets. Servlets: Servlet architecture and
life-cycle, handling HTTP post &get request, multi-tier application using JDBC from servlet.
UNIT V JSP AND WEB SERVERS
JSP: Architecture, standard actions, JSP with JDBC. J2EE & EJB: Component architecture,
introducing enterprise Java Beans, J2EE Technologies, foundation for EJB, EJB objects and
Bean Instances. Web Servers (IIS/ PWS &Apache): HTTP request types, system architecture,
client-side scripting, accessing web servers requesting documents
CO1 Understand the fundamentals of object-oriented programming inJava Understand
CO2 Understand the appropriate roles of subtyping and inheritance, and use understand
them effectively.
CO3 Implement polymorphic code and handle runtime errors using exception Apply
handling
CO4 To identify the generic classes and methods to implement an application Analyze and
Use streams to store and retrieve data from database/files Apply
CO5 Create user-interface applications using GUI components and to Apply

understand the event handling principles.
CO-PO Mapping
Program
Course ProgramOutcomes Specific
Outcomes Outcomes
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 2 1 2 2 2
CO2 3 2 2 1 2 2 2
CO3 3 2 2 2 2 2 2
CO4 3 2 2 1 2 2 2
CO5 3 2 2 2 2 2 2
Text Books
1. ATimothy Budd, “An Introduction to Object-Oriented Programming”,
Third Edition, PearsonEducation,2008.
2. Paul Deitel and Harvey Deitel, “Java How to Program (Early Objects)”,
Tenth Edition,PearsonPrenticeHall2014.
3. Jesse Feiler, Managing the Web Based Enterprise[Morgan Kaufmann]
4. Chuck Musciano & Bill Kennedy, HTML & XHTML [SPD]
Reference Books
1. D. Hunter, et. Al. Beginning XML [WROX]

2. R. Kalakota, A.B. Whinston, Frontier of Electronic Commerce [Addition-
Weslay]
IT626202: Unix Internals
L T P C
3 0 0 3
Course Objective:
1. To introduce the architecture of the Unix Operating System
2. To understand the buffer structure, the inodes representation and super block.
3. To cover various system calls and its usage.
4. To study system boot and the Init process.
5. To introduce process states, signals and process scheduling.
6. To understand memory management and I/O sub system.
Pre-requisites, if any: Operating Systems
Unit 1 GENERAL OVERVIEW OF THE SYSTEM

History − System structure − User perspective − Operating system services − Assumptions
about hardware − Introduction to the kernel − Architecture of the UNIX operating system −
Introduction to system concepts − Kernel data structures – System administration.
Unit 2 BUFFER CACHE AND FILE SUBSYSTEM
Buffer Headers − Structure of the Buffer Pool –Scenarios for Retrieval of Buffer-Advantages
and Disadvantages of the Buffer Cache − Internal Representation of Files − Inodes −
Structure of a Regular File − Directories − Conversion of a Path Name to an Inode − Super
Block –inode assignment to a New File-Allocation of Disk Blocks
Unit 3 SYSTEM CALLS FOR THE FILE SYSTEM
Open – Read – Write – File and record locking - Adjusting the position of file I/O –Lseek –
Close – File creation - Creation of special files -Changing directory - root – owner - mode –
stat and fstat – Pipes – Dup – Mounting and unmounting file systems – link – unlink
Unit 4 PROCESSES
Process states and transitions - Layout of system memory - The context of a process - Saving
the context of a process - Manipulation of the process address space – sleep - Process Control
- Process creation – Signals - Process termination – Awaiting Process termination – Invoking
other programs – user id of a process –Changing the size of a process
Unit 5 PROCESS SCHEDULING AND MEMORY MANAGEMENT POLICIES
Process scheduling − Memory management policies − Swapping –Demand Paging-A hybrid
system with swapping and demand paging − The I/O subsystem − Driver interfaces − Disk
Drivers − Terminal drivers.

Outcomes Specific
Outcomes
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO 1 3 2 3
CO 2 3 2 3 2
CO 3 3 2 2 2 2 3
CO 4 3 2 2 2 2 2
CO 5 3 3 2 2
Enter correlation levels 1, 2 & 3 define as: 1-low, 2- medium, & 3-
high Course Outcomes

Apply the operating system services for UNIX
CO1 B3
architecture
Identify the appropriate inode, buffer and super block
CO2 B2
for UNIX file system
CO3 Implement various system calls for file system B6
CO4 Implement various system calls for process management B6
Apply scheduling and memory management strategies
CO5 B3
for processes
Reference Books
1. Maurice J. Bach, “The Design of the Unix Operating System”, Fourth Edition, Pearson
Education, 2015.
2. Uresh Vahalia, “Unix Internals: The New Frontiers”, Pearson Education, 2008.
3. S. J. Leffler, M. K. Mckusick, M. J. .Karels and J. S. Quarterman., “The Design
AndImplementation of the 4.3 BSD Unix Operating System”, Addison Wesley,
1998.
4. Prabhat K. Andleigh, “ Unix System Architecture” Prentice Hall, 1990.
IT626203: Wireless Sensor Networks
L T P C
3 0 0 3
Course Objective:
1. To be aware of the Challenges and architecture of Wireless Sensor Networks.

2. To get familiarized with different communication protocols and
network components in WSN
3. To provide up-to-date knowledge of wideband wireless communication
techniques.
Pre-requisites, if any: Computer Networks
Unit 1 OVERVIEW OF WIRELESS SENSOR NETWORKS

Definition, advantages, Applications with examples – Types of applications – Challenges for
Wireless sensor networks – Characteristic requirements – required mechanisms –
Comparison of Mobile ad hoc networks and wireless sensor networks.
Unit 2 WIRELESS SENSOR NETWORK ARCHITECTURES
Single–Node Architecture – Hardware Components – Energy Consumption of Sensor Nodes
– Operating Systems and Execution Environments – Network Architecture – Sensor Network
Scenarios – Optimization Goals and Figures of Merit – Design Principles and service
interfaces – Gateway Concepts.
Unit 3 COMMUNICATION PROTOCOLS
Physical Layer and Transceiver Design Considerations – MAC Protocols – Low Duty Cycle
Protocols and Wakeup Concepts – Schedule – based protocols – Address and Name
Management – Assignment of MAC Addresses – Time synchronization, Routing Protocols –
Energy Efficient Unicast, Broadcast and multicast, Geographic routing – Data– centric
Routing.
Unit 4 LOCALIZATION AND POSITIONING
Properties of localization and positioning – Proximity – Trilateration and Triangulation –
Single–hop localization – Positioning in multi–hop environments, Topology Control –
Controlling topology in flat networks – Hierarchical networks by dominating sets and
clustering – Combining hierarchical topologies and power control – Adaptive node activity
Unit 5 TRANSPORT LAYER AND QUALITY OF SERVICE
Coverage and deployment – Reliable data transport – Single packet delivery – Block delivery
– Congestion control and rate control – Advanced application support – Security and
Application specific support
Course Outcomes
CO1 Explain the significance of sensor network mechanisms. Understand
CO2 Explain the various architectures of sensor network Understand
CO3 Describe the roles of supporting communication protocols Remember
as how they assist Wireless Sensor Networks
CO4 Compare the performance of different techniques applied Analyze
for node positioning and localization in wireless sensor
network.
CO5 Explain how transport layer mechanisms applied to achieve Understand
the required QoS.
CO-PO Mapping
Program
CO’s Objectives
NO
CO1 - 2 - - - - - - - - - - 1 -
CO2 - - - 2 - - - - - 2 - - - 0
CO3 2 - - - - - 2 - - - - - - 0
CO4 - - - 2 - - - - - - - - - 0
CO5 - - - - 2 - - - - - - 2 - 0
Text Books
1. Holger Karl & Andreas Willig, “Protocols and Architectures for Wireless Sensor
Networks”, John Wiley, 2014.
Reference Books
1. KazemSohraby, Daniel Minoli, &TaiebZnati, “Wireless Sensor Networks
Technology, Protocols and Applications”, John Wiley, 2011.
2. Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003
CS624203: Artificial Intelligence
L T P C
3 0 0 3
Course Objective:
1. To gain knowledge about the basics of artificial intelligence.
2. To understand the basics of Problem solving problems.
3. To understand about the knowledge representation
4. To learn about the features of intelligent agents.
5. To learn about the details of applications of AI.
Pre-requisites, if any: Basic knowledge in Artificial Intelligence
Unit 1 Introduction
Introduction–Definition - Future of Artificial Intelligence – Characteristics of Intelligent
Agents– Typical Intelligent Agents – Problem Solving Approach to Typical AI problems.
Unit 2 Problem Solving methods
Problem solving Methods - Search Strategies- Uninformed - Informed - Heuristics - Local
Search Algorithms and Optimization Problems - Searching with Partial Observations -
Constraint Satisfaction Problems – Constraint Propagation - Backtracking Search - Game
Playing - Optimal Decisions in Games – Alpha - Beta Pruning - Stochastic Games.
Unit 3 Knowledge Representation
First Order Predicate Logic – Prolog Programming – Unification – Forward Chaining-
Backward Chaining – Resolution – Knowledge Representation - Ontological Engineering-
Categories and Objects – Events - Mental Events and Mental Objects - Reasoning Systems
for Categories - Reasoning with Default Information.
Unit 4 Software Agents
Architecture for Intelligent Agents – Agent communication – Negotiation and Bargaining –
Argumentation among Agents – Trust and Reputation in Multi-agent systems.
Unit 5 Applications
AI applications – Language Models – Information Retrieval- Information Extraction –
Natural Language Processing - Machine Translation – Speech Recognition – Robot –
Hardware – Perception – Planning – Moving.

Outcomes Specific
Outcomes
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 1
CO2 3 2 2
CO3 2 1
CO4 2 1
CO5 2 2
Course Outcomes
CO1 Know the basics of Artificial intelligence. B1
CO2 Know the concepts of problem Solving methods. B1
CO3 To learn the concept of Knowledge Representation in B2
AI.
CO4 Understand the characteristics of Software agents. B3
CO5 To analyze about the applications of AI. B4
Text Books
1. S. Russell and P. Norvig, "Artificial Intelligence: A Modern Approach‖, Prentice

Hall, Third Edition, 2009.
2. I. Bratko, ―Prolog: Programming for Artificial Intelligence‖, Fourth edition,
Addison- Wesley Educational Publishers Inc., 2011.
Reference Books
1. M. Tim Jones, ―Artificial Intelligence: A Systems Approach(Computer Science),

Jones and Bartlett Publishers, Inc.; First Edition, 2008
2. Nils J. Nilsson, ―The Quest for Artificial Intelligence‖, Cambridge University Press, 2009.
PROGRAMME
ELECTIVE -II [SEM-II]
CS624206: Internet of Things
L T P C
3 0 0 3
Course Objective:
1. To identify the components of IoT.
2. To analyze various protocols of IoT.
3. To design portable IoT using appropriate boards.
4. To design business Intelligence and Information Security for WoT.
5. To develop schemes for the applications of IOT in real time scenarios.
Pre-requisites, if any: Cloud Computing
Unit 1 Introduction to IoT

Internet of Things-Components-Physical and Logical Design-IoT Enabling Technologies-IoT
Deployment Templates- IoT Domains-IoT and M2M-IoT Platforms and Design
Management.
Unit 2 IoT Architectures
M2M High-level ETSI architecture-IETF Architecture for IoT-OGC Architecture-IoT
Reference Model-Domain Model-Information Model-Functional Model-Communication
Model-IoT Sample Architectures.
Unit 3 IoT Protocols
Protocol Standardization for IoT-Efforts-M2M and WSN Protocols–SCADA and RFID
Protocols Unified Data Standards–Protocols–IEEE 802.15.4 –BACNet Protocol–Modbus-
Zigbee Architecture– Network layer–6LowPAN -CoAP-Security
Unit 4 Building IoT using Raspberry Pi and Arduino
Building IOT with RASPERRY PI-IoT Systems-Logical Design using Python-IoT Physical
Devices & Endpoints-IoT Device-Building Blocks-Raspberry Pi-Board-Linux on Raspberry
Pi-Raspberry Pi Interfaces-Programming Raspberry Pi with Python-Other IoT Platforms-
Arduino.
Unit 5 Case Studies and Practices
Real world design Constraints-Applications-Asset management, Industrial automation, smart
grid, Commercial building automation, Smart cities-participatory Sensing-Data Analytics for
IoT–Software & Management Tools for IoT Cloud Storage Models & Communication APIs-
Cloud for IoT-Amazon Web Services for IoT.
Course Outcomes
CO1 Explain the significance of the components of IoT. Understand
CO2 Explain the various protocols of IoT. Understand
CO3 Describe the roles of portable IoT using appropriate boards. Remember
CO4 Compare the performance of business Intelligence and Analyze
Information Security for WoT.
CO5 Explain schemes for the applications of IOT in real time Understand
scenarios.
CO-PO Mapping
Program
CO’s Objectives
NO
CO1 3 - - - - - 2 - - - - - 2 -
CO2 - - - 3 - - - - - 2 - - - 2
CO3 2 - - - - - 2 - - - - - - 2
CO4 - - - 2 - - - - - - - - - 2
CO5 - - - - 2 - - - - - - 2 - 2
Text Books
1. HonboZhou,”The Internet of Things in the Cloud: A Middleware Perspective” -
CRC Press 2012.
Reference Books
1. Luigi Atzori, Antonio Lera, Giacomo Morabito, “The Internet of Things: A Survey”,
Journal on Networks, Elsevier Publications, October, 2010.
2. 2. Olivier Hersent, David Boswarthick, Omar Elloumi, “The Internet of Things – Key
applications and Protocols”, Wiley, 2012.
IT626204: Deep Learning
L T P C
3 0 0 3
Course Objective:
1. To present the mathematical, statistical and computational challenges of

building neural networks
2. To study the concepts of deep learning
3. To introduce dimensionality reduction techniques
4. To enable the students to know deep learning techniques to support real-time
applications
5. To examine the case studies of deep learning techniques
Pre-requisites, if any: Image Processing and Artificial Intelligence
Unit 1 INTRODUCTION
Introduction to machine learning- Linear models (SVMs and Perceptrons, logistic regression)
- Intro to Neural Nets: What a shallow network computes- Training a network: loss
functions, back propagation and stochastic gradient descent- Neural networks as universal
function approximates
Unit 2DEEP NETWORKS
History of Deep Learning- A Probabilistic Theory of Deep Learning- Back propagation and
regularization, batch normalization- VC Dimension and Neural Nets-Deep Vs Shallow
Networks Convolutional Networks- Generative Adversarial Networks (GAN), Semi-
supervised Learning
Unit 3 DIMENTIONALITY REDUCTION
Linear (PCA, LDA) and manifolds, metric learning - Auto encoders and dimensionality
reduction in networks - Introduction to Convnet - Architectures – AlexNet, VGG, Inception,
ResNet - Training a Convnet: weights initialization, batch normalization, hyperparameter
optimization
Unit 4 OPTIMIZATION AND GENERALIZATION
Optimization in deep learning– Non-convex optimization for deep networks- Stochastic
Optimization Generalization in neural networks- Spatial Transformer Networks- Recurrent
networks, LSTM - Recurrent Neural Network Language Models- Word-Level RNNs & Deep
Reinforcement Learning - Computational & Artificial Neuroscience
Unit 5 CASE STUDY AND APPLICATIONS
Image net- Detection-Audio Wave Net-Natural Language Processing Word2Vec - Joint
Detection BioInformatics- Face Recognition- Scene Understanding- Gathering Image
Captions
Course Outcomes

CO1 Understand basics of deep learning. Understand
CO2 Implement various deep learning models Remember
CO3 Realign high dimensional data using reduction techniques Apply
CO4 Analyze optimization and generalization in deep learning Analyze
CO5 Explore the deep learning applications Evaluate
CO-PO Mapping
Program
CO’s NO Objectives
CO1 2 2 - - - - - - - - - - - -
CO2 - - - 2 2 - - - - 2 - - - -
CO3 - - 2 2 - - - - - 2 - - - -
CO4 - - - 2 2 - - - - - - - - -
CO5 - - - - 2 - - - - - - 2 - -
Text Books
1. Cosma Rohilla Shalizi, Advanced Data Analysis from an Elementary Point of View, 2015.
Reference Books
1. Deng & Yu, Deep Learning: Methods and Applications, Now Publishers, 2013.
2. Ian Goodfellow, YoshuaBengio, Aaron Courville, Deep Learning, MIT Press, 2016.
3. Michael Nielsen, Neural Networks and Deep Learning, Determination Press, 2015
IT626205: Network Security
L T P C
3 0 0 3
Course Objective:
1. To introduce principal concepts, major issues, technologies, and basic approaches
in Network security.
2. To review various algorithms on key management.
3. To explain the principles of various authentication mechanism
4. To understand the key management and distribution system.
5. To familiarize the ability to examine and analyze various attacks and web security.
Pre-requisites, if any: Basic knowledge in network
Unit 1 INTRODUCTION
An Overview of Computer Security Concepts – OSI Security Architecture - Security Attacks
– Security Services –Security mechanisms- Cipher model – Substitution Techniques –
Transposition Techniques – Encryption Algorithms - Confidentiality
Unit 2 ALGORITHMS FOR SECURITY
Data Encryption Standard-Block cipher principles-block cipher modes of operation-
Advanced Encryption Standard (AES)-Triple DES - Blowfish-RC5 algorithm - Public key
cryptography: Principles of public key cryptosystems-The RSA algorithm-Key management -
Diffie Hellman Key exchange- Elliptic curve arithmetic-Elliptic curve cryptography.
Unit 3 HASH FUNCTIONS AND DIGITAL SIGNATURES
Authentication requirement – Authentication function – MAC – Hash function – Security of
hash function and MAC –MD5 - SHA - HMAC – CMAC - Digital signature and
authentication protocols – DSS – ELGamal DSS – Schnoor DSS Scheme-RSA-PSS Digital
signature algorithm.
Unit 4 KEY MANAGEMENT AND DISTRIBUTION
Symmetric Encryption – Symmetric Decryption – Distribution of public keys – X.509
Certificates – Public key Infrastructure – User Authentication protocol – Remote user
Authentication principles – Kerberos-Federated Identity management-Personal Identity
verification.
Unit 5 BRIEF SURVEY OF INTERNET SECURITY
Transport level Security – Web security – SSL – Transport Layer Security – HTTPS 506 –
Secure Shell SSH – Wireless Network Security – IEEE 802.11 Wireless LAN – WAP End to
End Security – Electronic Mail Security – PGP – S/MIME –Domain keys identified mail- IP
Security – Policies – Internet Key Exchange.
COURSE OUTCOMES VS PROGRAM OUT COMES MAPPING

Outcomes Specific
Outcomes
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 2 3
CO2 3 2 3 2 2 3 3
CO3 3 2 2 2 2 3 2
CO4 2 3 2
CO5 2 2 2 3
Course Outcomes
CO1 Have fundamental knowledge on Network security K2
CO2 Know about the various network security algorithms. K2
CO3 Understand the hash functions and digital signatures for K2
network security.
CO4 Analyze the key management and distribution system. K4
CO5 Analyze the Internet security. K4
Reference Books
1. William Stallings, Cryptography and Network Security: Principles and Practices,

Seventh Edition 2016.
2. Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata McGraw Hill,
2015.
3. Man Young Rhee, Internet Security Cryptographic Principles, Algorithms and
Protocols,,Wiley,2003
CS624209: Software Reliability and Metrics
L T P C
3 0 0 3
Course Objective:
1. Learn different definitions of software quality
2. Know different notions of defects and classify them
3. Understand the basic techniques of data collection and how to apply them
4. Learn software metrics that define relevant metrics in a rigorous way.
5. Gain confidence in ultra-high reliability.
Pre-requisites, if any: Software Engineering
Unit 1 INTRODUCTION TO SOFTWARE RELIABILITY

Basic Concepts – Failure and Faults – Environment – Availability –Modeling –uses –
requirements reliability metrics – design & code reliability metrics – testing reliability
metrics.
Unit 2COMPARISON OF SOFTWARE RELIABILITY MODELS
Concepts – General Model Characteristic – Historical Development of models – Model
Classification scheme – Markovian models – General concepts – General Poisson Type
Models – Binomial Type Models – Poisson Type models – Fault reduction factor for Poisson
Type models.
Unit 3 COMPARISON OF SOFTWARE RELIABILITY MODELS
Comparison Criteria – Failure Data – Comparison of Predictive Validity of Model Groups –
Recommended Models – Comparison of Time Domains – Calendar Time Modeling –
Limiting Resource Concept – Resource Usage model – Resource Utilization – Calendar Time
Estimation and confidence Intervals.
Unit 4 FUNDAMENTALS OF MEASUREMENT
Measurements in Software Engineering – Scope of Software metrics – Measurements theory
– Goal based Framework – Software Measurement Validation.
Unit 5 MEASURING SOFTWARE PRODUCT
Measurement of Internet Product Attributes – Size and Structure – External Product
Attributes – Measurement of Quality – Software Reliability: Measurement and Prediction.
Course Outcomes
CO1 Understand basic concepts of software reliability. Understand
CO2 Perform some simple statistical analysis relevant to Remember
software measurement data.
CO3 Use from practical examples both the benefits and Apply
limitations of software metrics for quality control and
assurance.
CO-PO Mapping
Program
Objectives
CO’s PO1
PO1 PO2 PO3 PO4PO5 PO6 PO7PO8PO9 PO10 PO12 PSO1 PSO2
NO 1
CO1 3 2 - - - - - - - - - - 2 -
CO2 - - - 3 2 - - - - 2 - - - 2
CO3 - - 2 2 - - - - - 2 - - - 2
Text Books
1. John D. Musa, ―Software Reliability Engineering‖, Tata McGraw Hill, 1999
Reference Books
1. John D. Musa, Anthony Iannino, KazuhiraOkumoto, ―Software Reliability –
Measurement, Prediction, Application, Series in Software Engineering and
Technology‖, McGraw Hill, 1987
2. Norman Fenton, James Bieman, ―Software Metrics: A Rigorous and Practical
Approach‖, 3rd edition, CRC Press, 2015 25 IF5191 AD
IT626205: Human Computer Interaction
Techniques (Under Regulation 2022)
L T P C
3 0 0 3
Course Objective:
1. To know how to analyze and consider user‟s need in the interaction system
2. To understand various interaction design techniques and models
3. To understand the theory and framework of HCI
4. Understand and analyze the cognitive aspects of human – machine interaction
Pre-requisites, if any: User Interface Design
Unit 1 INTRODUCTION
Foundation – Human – Computer – Interaction – Paradigms – What is HCI – Components –
Cognitive Framework – Perception and Representation – Attention and Memory Constraint –
Knowledge and Mental Model – Interface Metaphors – Input – Output
Unit 2 DESIGN PROCESS
Interaction Styles – Interaction Design Basics – HCI in the Software Process – Design Rules
- Designing Windowing Systems - User Support and On-Line Information - Designing For
Collaborative Work and Virtual Environments - Principles and User-Centred Design -
Methods for User-Centred Design
Unit 3 IMPLEMENTATION AND EVALUATION PROCESS
Implementation issues – Implementation Support - Evaluation techniques – Universal Design
– User Support
Unit 4 MODELS
Cognitive models – Communication and collaboration models: Models of the system –
Models of the System – Modeling Rich Interaction.
Unit 5 APPLICATIONS
Socio – organization issues and stakeholder requirements - Ubiquitous Computing - Context
– aware User Interfaces - Hypertext, multimedia and the World Wide Web
Course Outcomes
CO1 Develop good design for human machine interaction Understand
system
CO2 Design new interaction model to satisfy all types of Remember
customers
CO3 Evaluate the usability and effectiveness of various Evaluate
products
CO4 To know how to apply interaction techniques for systems Apply
CO-PO Mapping
Program
CO’s Objectives
NO
CO1 - 2 - 2 - - - - - - - - 2 -
CO2 2 2 - 2 - - - - - 2 - - - 2
CO3 - - 2 3 - - - - - - - - - 2
CO4 2 - - 2 2 - - - - - - - - 2
Text Books
1. Alan Dix, Janet Finlay, Gregory D.Abowd, Russell Beale, “Human Computer Interaction”,
Third Edition, Pearson Education, 2004
Reference Books
1. Dix, Finlay, Abowd and Beale. “Human – Computer Interaction”, Second edition,
Prentice Hall,1998.
2. J. Preece, Y. Rogers, H. Sharp, D. Benyon, S. Holland and T. Carey. “Human – Computer
Interaction”, Addison Wesley, 1994.
3. John M.Carrol, “Human Computer Interaction in the New Millenium”, Pearson
Education, 2002.
PROGRAMME
ELECTIVE -III [SEM-II]
IT626207: Advanced Computer Graphics and
Animations (Under Regulation 2022)
L T P C
3 0 0 3
Course Objective:
1. To learn the output primitives like line, circle and ellipse using algorithms.
2. To study the 2-D transformations and clipping.
3. To explore 3-D object representations and transformations.
4. To explore graphics programming using OpenGL.
5. To enable the students to understand various 3-D modeling and animation tools.
Pre-requisites, if any: Multimedia Communication
Unit 1 INTRODUCTION
Applications of Computer Graphics - Overview of Graphics Systems - Input Devices -
Output Primitives: Points and Lines - Line Drawing Algorithms - Mid-Point Circle and
Ellipse Algorithms - Attributes of Output Primitives: Line, Curve, Color, Area-Fill,
Character, Bundled Attributes - Antialiasing.
Unit 2TWO-DIMENSIONAL CONCEPTS
Two-Dimensional Geometric Transformations - Two-Dimensional Viewing - Two-
Dimensional Point – Cohen Sutherland Line Clipping - Sutherland-Hodgeman Polygon
Clipping - Weiler-Atherton Polygon Clipping - Text Clipping - Exterior Clipping.
Unit 3 THREE-DIMENSIONAL CONCEPTS
Three-Dimensional Display Methods - Three-Dimensional Object Representations: Polygon -
Quadric Surfaces – Splines – Bezier curves and surfaces – Octree – BSP trees – Visualization
of Datasets. Three-Dimensional Transformations: Translation – Rotation – Scaling –
Reflection - Shearing - Composite transformation
Unit 4 GRAPHICS PROGRAMMING WITH OPENGL
Drawing 3D Scenes – Perform Transformations - Colors And Light - Adding Texture and
Shadows - Using Shading Models. Understanding 3D Modeling and Animation Tools like 3D
Studio Max, Maya, Blender.
Unit 5 Animation
Multimedia I/O Technologies − Digital Voice and Audio − Video Image and Animation –
Full Motion Video−Storage and Retrieval Technologies- Animation Principles - Animation
Drawing - Animation Marketing and Management - Matte Painting.
Course Outcomes
CO1 Develop the line, circle and ellipse drawing algorithms Create
CO2 Apply the two dimensional geometric transformations and Apply
2-D clipping
CO3 Represent 2-D objects and do geometric transformations Analyze
CO4 Perform clipping and Detecting the visible surfaces in 3-D Understand
objects
CO5 Apply transformation, texture, shadow and shading in 3-D Apply
objects using OpenGL and Animation
CO-PO Mapping
Program
Specific
Program Outcomes
Objectiv
es
CO’s PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PS
COURSE OUTCOME
NO 1 2 3 4 5 6 7 8 9 0 1 2 1 O2
Develop the line, circle and
CO1 2 - - - - - - - - - - - 2 -
ellipse drawing algorithms
Apply the two dimensional
CO2 geometric transformations and 2- - 2 - - - - - - - 2 - - - 2
D clipping
Represent 2-D objects and do
CO3 - - 2 - - - - - - 2 - - - 2
geometric transformations
Perform clipping and Detecting
CO4 - - - 2 - - - - - - - - - 2
the visible surfaces in 3-D objects
Apply transformation, texture,
shadow and shading in 3-D
CO5 - - 2 - - - - - - - - 2 - 2
objects using OpenGL and
Animation
Text Books
1. Donald Hearn and M. Pauline Baker, “Computer Graphics C Version”, Second Edition,
Pearson Education, 2012.
Reference Books
1. James D. Foley, Andries Van Dam, Steven K. Feiner, John F. Hughes, “Computer
Graphics Principles and Practice”, Second Edition, Pearson Education 2007.
2. F. S. Hill, “Computer Graphics using OpenGL”, Second edition, Pearson Education 2003.
CS624211: Software Quality Assurance and Testing
L T P C
3 0 0 3
Course Objective:
1. To understand the basics of testing, test planning &design and test team
organization
2. To study the various types of test in the life cycle of the software product.
3. To build design concepts for system testing and execution
4. To learn the software quality assurance ,metrics, defect prevention techniques
5. To learn the techniques for quality assurance and applying for applications.
Pre-requisites, if any: Software Engineering, Software Testing
Unit 1 SOFTWARE TESTING - CONCEPTS, ISSUES, AND TECHNIQUES

Quality Revolution, Verification and Validation, Failure, Error, Fault, and Defect, Objectives
of Testing, Testing Activities, Test Case Selection White-Box and Black ,test Planning and
design, Test Tools and Automation, . Power of Test. Test Team Organization and
Management-Test Groups, Software Quality Assurance Group ,System Test Team
Hierarchy, Team Building.
Unit 2SYSTEM TESTING
System Testing - System Integration Techniques-Incremental, Top Down Bottom Up
Sandwich and Big Bang, Software and Hardware Integration, Hardware Design Verification
Tests, Hardware and Software Compatibility Matrix Test Plan for System Integration. Builtin
Testing. functional testing - Testing a Function in Context. Boundary Value Analysis,
Decision Tables. acceptance testing - Selection of Acceptance Criteria, Acceptance Test Plan,
Test Execution Test. software reliability - Fault and Failure, Factors Influencing Software,
Reliability Models
Unit 3 SYSTEM TEST CATEGORIES
System test categories Taxonomy of System Tests, Interface Tests Functionality Tests. GUI
Tests, Security Tests Feature Tests, Robustness Tests, Boundary Value Tests Power Cycling
Tests Interoperability Tests, Scalability Tests, Stress Tests, Load and Stability Tests,
Reliability Tests, Regression Tests, Regulatory Tests. Test Generation from FSM models-
State-Oriented Model. Finite-State Machine Transition Tour Method, Testing with State
Verification. Test Architectures-Local, distributed, Coordinated, Remote. system test design-
Test Design Factors Requirement Identification, modeling a Test Design Process Test Design
Preparedness, Metrics, Test Case Design Effectiveness. system test execution- Modeling
Defects, Metrics for Monitoring Test Execution .Defect Reports, Defect Causal Analysis,
Beta testing, measuring Test Effectiveness.
Unit 4 SOFTWARE QUALITY
Software quality - People‘s Quality Expectations, Frameworks and ISO-9126, McCall‘s
Quality Factors and Criteria – Relationship. Quality Metrics. Quality Characteristics ISO
9000:2000 Software Quality Standard. Maturity models- Test Process Improvement,Testing
Maturity Model.
Unit 5 SOFTWARE QUALITY ASSURANCE
Quality Assurance - Root Cause Analysis, modeling, technologies, standards and
methodologies for defect prevention. Fault Tolerance and Failure Containment - Safety
Assurance and Damage Control, Hazard analysis using fault-trees and event-trees.
Comparing Quality Assurance Techniques and Activities. QA Monitoring and Measurement,
Risk Identification for Quantifiable Quality Improvement. Case Study: FSM-Based Testing
of Web-Based Applications.
Course Outcomes

CO1 Perform functional and non-functional tests in the life Understand
cycle of the software product.
CO2 Understand system testing and test execution process. Knowledge
CO3 Identify defect prevention techniques and software quality Knowledge
assurance metrics.
CO4 Apply techniques of quality assurance for typical Apply
applications.
CO-PO Mapping
Program
Objectives
CO’s
NO
CO1 3 - 2 - 1 - - - - - - - 2 -
CO2 3 2 - - - - - - - 3 - - - 2
CO3 - - 3 2 - - - - - - - - - 2
CO4 - - - 2 2 - - - - - - - - 2
Text Books
1. Software Testing And Quality Assurance-Theory and Practice, Kshirasagar Nak

Priyadarshi Tripathy, John Wiley & Sons Inc,2008
Reference Books
1. Software Quality Engineering: Testing, Quality Assurance, and Quantifiable Improvement,

Jeff Tian, John Wiley & Sons, Inc., Hoboken, New Jersey. 2005.
2. Software Quality Assurance - From Theory to Implementation, Daniel Galin, Pearson
Education Ltd UK, 2004
3. Software Quality Assurance, MilindLimaye, TMH ,New Delhi, 2011
CS624212: Cognitive Computing
L T P C
3 0 0 3
Course Objective:
1. To appreciate the need of Cognitive Computing Techniques.
2. To learn different types of sets which can handle imprecise data values
3. To develop systems which have learning capabilities.
4. To learn techniques to optimize the results and find the optima.
Pre-requisites, if any:
Knowledge of relational algebra, Knowledge of basic Mathematics and Algorithms
Unit 1 Psychology and Neuroscience

Philosophy: Mental-physical Relation – From Materialism to Mental Science – Detour before
the naturalistic turn – The Philosophy of Science – The Mind in Cognitive Science – Logic
and the Sciences of the Mind – Psychology: Place of Psychology within Cognitive Science -
Science of Information Processing – Neurosciences: Cognitive Neuroscience – Perception -
Decision – Learning and Memory – Language Understanding and Processing.
Unit 1 Probabilistic Programming Language
Web PPL Language – Syntax – Using Javascript Libraries – Manipulating probability types
and distributions – Finding Inference – Exploring random computation – Coroutines:
Functions that receive continuations -Enumeration – Other basic computation.
Unit 3 Fuzzy sets and fuzzy logic
Introduction to fuzzy logic, classical and fuzzy sets, overview of fuzzy sets, membership
function, fuzzy rule generation, operations on fuzzy sets: compliment, intersection, union,
combinations on operations, aggregation operation. Fuzzy Extension Principles,
Defuzzification. Fuzzy Rule bases, Development of Fuzzy Logic based Expert Systems.
CASE STUDIES
Unit 4 Neural Networks &Rough Sets:
Overview of biological neurons, Mathematical model of Neuron, Perceptron and Multi Layer
Perceptron, Learning in Artificial Neural Networks; Supervised, Unsupervised and
Competitive Learning paradigms; Learning rules and Functions, Back propagation algorithm,
Rough Sets. Upper and Lower Approximations, Boundary Region, Decision Tables and
Decision Algorithms. Properties of Rough Sets. Rough Membership, Reducts. Discernibility
Matrix and Discernibility Functions. Generation of Inference Rules.
Unit 5 Evolutionary Algorithms and Hybrid Algorithms
Introduction, Evolutionary algorithms - Genetic Algorithm: History, terminology, biological
background, creation of offspring, working principles of genetic algorithms, fitness function,
Roulette wheel selection, Boltzmann selection, cross over mutation, inversion, deletion, and
duplication, generation cycle , Swarm Optimization –Part Swarm Optimization and Ant
Colony Optimization. Differential Evolutionary Algorithm.
Course Outcomes

CO1 Understand the Philosophy of K2
Science
CO2 Able to realize importance and apply Computing K3
techniques for real world problem solving
CO3 Able to represent the imprecise information using sets and K2
develop inference systems based on these.
CO4 Develop learning systems K3
CO5 Learn and practice various optimization algorithms for real K2
world problems solving
CO-PO Mapping
Program
CO’s NO Outcomes
PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 2
CO2 2 2 3 2 2
CO3 3 2 2
CO4 2 3
CO5 3 2
Text Books
1. Robert A. Wilson, Frank C. Keil, “The MIT Encyclopedia of the Cognitive
Sciences”, The MIT Press, 1999.
Reference Books
1. Noah D. Goodman, Andreas Stuhlmuller, “The Design and Implementation

of Probabilistic Programming Languages”, Electronic version of book,
https://dippl.org/.
2. Noah D. Goodman, Joshua B. Tenenbaum, The ProbMods Contributors,
“Probabilistic Models of Cognition”, Second Edition, 2016,
https://probmods.org/.
CS624213: SOCIAL NETWORK ANALYSIS
L T P C
3 0 0 3
Course Objective:
1. To Understand the knowledge about the current Web Development Process.
2. To Design the Ontological representation of social relationships.
3. To Analyze the Detecting Communities in Social Networks
4. To Understand the extraction and mining tools for Social networks
5. To Gain knowledge on Web personalization and Web Visualization of
Social networks
Pre-requisites, if any: Basic Knowledge of Graph Theory
Unit 1INTRODUCTION TO SOCIAL NETWORK ANALYSIS

Introduction to Web - Limitations of current Web – Development of Semantic Web –
Emergence of the Social Web - Network analysis - Development of Social Network Analysis
- Key concepts and measures in network analysis - Electronic sources for network analysis -
Electronic discussion networks, Blogs and online communities.
Unit 2 MODELLING, AGGREGATING AND KNOWLEDGE REPRESENTATION
Ontology and their role in the Semantic Web - Ontology-based Knowledge Representation -
Ontology languages for the Semantic Web – RDF and OWL - Ontological representation of
social individuals, Ontological representation of social relationships, Aggregating and
reasoning with social network data, Advanced Representations.
Unit 3 EXTRACTION AND MINING COMMUNITITES IN WEB SOCIAL NETWORKS
Extracting evolution of Web Community from a Series of Web Archive - Detecting
Communities in Social Networks - Definition of Community - Evaluating Communities -
Methods for Community Detection & Mining - Applications of Community Mining
Algorithms - Tools for Detecting Communities Social Network Infrastructures and
Communities.
Unit 4 PREDICTING HUMAN BEHAVIOR AND PRIVACY ISSUES
Understanding and Predicting Human Behavior for Social Communities - User Data
Management, Inference and Distribution - Enabling New Human Experiences - Reality
Mining - Context-Awareness - Privacy in Online Social Networks - Trust in Online
Environment - Trust Models Based on Subjective Logic - Trust Network Analysis -
Combining Trust and Reputation
Unit 5 VISUALIZATION AND APPLICATIONS OF SOCIAL NETWORKS
Graph Theory- Centrality- Clustering - Node-Edge Diagrams, Matrix representation,
Visualizing Online Social Networks, Visualizing Social Networks with Matrix-Based
Representations- Matrix + Node-Link Diagrams, Hybrid Representations - Applications -
Covert Networks - Community Welfare - Collaboration Networks - CoCitation Networks.

Outcomes Specific
Outcomes
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 3
CO2 2 2 1
CO3 3 3 2 2
CO4 2 2
CO5 2
Course Outcomes
CO1 Apply knowledge for current Web development in the B4
era of Social Web.
CO2 Model, aggregate and represent knowledge for Semantic B4
Web.
CO3 Design extraction and mining tools for Social networks. B3
CO4 Develop personalized web sites and visualization for B3
Social networks.
CO5 Design Web personalization and Visualization for B3
Social networks
Text Books
1. Peter Mika, ―Social Networks and the Semantic Web‖, First Edition,
Springer 2007.
2. BorkoFurht, ―Handbook of Social Network Technologies and Applications‖,
1st Edition, Springer, 2010
Reference Books
1. Peter Mika, ―Social networks and the Semantic Web‖, Springer, 1st edition 2007.
2. Dion Goh and Schubert Foo, ―Social information Retrieval Systems:
Emerging Technologies and Applications for Searching the Web Effectively‖,
IGI Global Snippet, 2008.
CS624215: Block Chain Technologies
L T P C
3 0 0 3
Course Objective:
1. To learn the various cryptography primitives used in block chain.
2. To study the design principles of block chain.
3. To understand the various consensus algorithms.
4. To study the block chain in networking.
5. To learn the enhancements of block chain technologies.
Pre-requisites, if any: Cryptography, Networking
Unit 1 CRYPTOGRAPHY IN BLOCKCHAIN

Blockchain Definitions – Blockchain versus Databases – History – Motivation –
Characteristics – Types – Overview - Hashing in Blockchain – Linking blocks in blockchain
– Linking blocks using SHA256 – Block structure – Blockchain functionality – Creating
Blockchain – Byzantine failure problem in blockchain – Digital signatures in blockchain –
Blockchain wallets
Unit 2 BLOCKCHAIN DESIGN PRINCIPLES
Networked Integrity – Distributed Power- Value as Incentive – Security – Privacy – Rights
Preserved – Inclusion – Centralized Registries versus Distributed Ledgers – Public versus
Private Ledgers – Transparency as a Strategic Risk – Transparency as a Strategic Asset -
Zero Knowledge Proofs
Unit 3 CONSENSUS ALGORITHMS
Proof of Work – Pure Stake Based Consensus – Proof of Stake - Leased Proof of Stake –
Delegated Proof of Stake – Hybrid Form of PoS and PoW – Practical Byzantine Fault
Tolerance – Ripple –Tendermint – Proof of Elapsed Time – Proof of Activity – Proof of Burn
– Hyperledger Fabric
Unit 4 NETWORKING IN BLOCK CHAIN
Peer – to –peer Networking – Network Discovery – Block Synchronization – Building a
simple Blockchain in P2P Network – Validating new Block – Selecting Longest chain –
Block Exchange between Peers – Application InterfacesBlockchain Networks – Testnet –
Regtest – Blockchain in 5G – Blockchain in Social Networking – Blockchain for IoT
Unit 5 BLOCKCHAIN OPTIMIZATIONS AND ENHANCEMENTS
Blockchain Optimizations – Transaction Exchange – Off-chain Transactions – Block size
improvements – Blockchain enhancements – Sharding – Evolution of consensus algorithm –
Proof of Stake – Proof of Activity – Byzantine Fault Tolerance Consensus Models – Proof of
Elapsed Time – Cross-chain Protocol – Privacy Enhancement – Blockchain Security –
Transaction Security Model – Decentralized Security Model – Attacks on Blockchain
Course Outcomes
CO1 Implement the required cryptography primitives for block K3
chain systems.
CO2 Work with various block chain design principles. K2
CO3 Implement with various consensus algorithms. K3
CO4 Equip networks with the various block chain techniques. K3
CO5 Work with block chain optimization techniques. K2
CO-PO Mapping
Program
CO’s NO Outcomes
PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2
CO2 2 2 3 2 2
CO3 3 2 2
CO4 2 3
CO5 2 3 2
Text Books
1. Koshik Raj, “Foundations of Blockchain”, Packt Publishers, 2019
Reference Books
1. S. Shukla, M. Dhawan, S. Sharma and S. Venkatesan, “Blockchain

Technology: Cryptocurrency and Applications”, Oxford University Press,
2019.
2. Josh Thompson, “Blockchain: The Blockchain for Beginnings, Guild to
Blockchain Technology and Blockchain Programming”, Create Space Independent
Publishing Platform, 2017.
3. Andreas M. Antonopoulos, “Mastering Bitcoin: Unlocking Digital
Cryptocurrencies”, Oreilly Media, 1st Edition, 2014
PROGRAMME
ELECTIVE -IV
IT626208 - PATTERN RECOGNITION
Course Category: Programme L T P C
Course Type: Theory 3 0 0 3
Elective
COURSE OBJECTIVES:
 To know the fundamental algorithms for pattern recognition
 To understand the overview of pattern recognition
 To know the major approaches in statistical pattern recognition.
 To know the major approaches in syntactic pattern recognition.
 To know several unsupervised learning and clustering algorithms
UNIT 1: BASICS OF PROBABILITY, RANDOM PROCESSES AND

9
LINEAR ALGEBRA
Probability: independence of events, conditional and joint probability, Bayes’ theorem;
Random Processes: Stationary and nonstationary processes, Expectation, Autocorrelation,
Cross-Correlation, spectra; Linear Algebra: Inner product, outer product, inverses, eigen
values, eigen vectors; Bayes Decision Theory
UNIT 2: PATTERN RECOGNITION OVERVIEW 9
Typical Pattern Recognition System, Patterns and Features Extraction, Training and Learning
in Pattern Recognition system, Different types of Pattern Recognition Approaches –
Statistical, Syntactic, Neural. Discriminant functions.
UNIT 3: STATISTICAL PATTERN RECOGNITION 9
Parametric estimation and supervised learning, Maximum likelihood estimation, Bayesian
parameter estimation, Non-parametric approaches - Parzen window, k-NN estimation.
UNIT 4: SYNTACTIC PATTERN RECOGNITION 9
Grammar Based Approaches, Elements of Formal Grammars, Parsing Concepts – Parsing
Algorithm, Transition Networks in Parsing, Higher Dimensional Grammars, Stochastic
Grammars, Graphical Approaches – Graph Isomorphism, Attributed Graphs
UNIT 5: UNSUPERVISED LEARNING AND CLUSTERING 9
Mixture Models and EM – K-Means Clustering – Dirichlet Process Mixture Models –
Spectral Clustering – Hierarchical Clustering – The Curse of Dimensionality –
Dimensionality Reduction –Principal Component Analysis – Latent Variable Models (LVM)
– Latent Dirichlet Allocation (LDA).
TOTAL: 45 PERIODS
COURSE OUTCOMES: At the end of the course, the student will be able to
CO1: Acquire the knowledge of fundamental algorithms related to pattern recognition
CO2: Learn the pattern recognition approaches
CO3: Apply the major approaches in statistical pattern recognition.
CO4: Apply the major approaches in syntactic pattern recognition.
CO5: Discusses several unsupervised learning and clustering algorithms suitable for pattern
classification
CO-PO MAPPING
CO1 3 2 2 2 3 2
CO2 2 2 2 2 3 3
CO3 2 2 2 2 2 3
CO4 2 2 2 2 2 3
CO5 2 3 2 2 2 2
1- low, 2 - medium, 3 - high, ‘-' no correlation
REFERENCE BOOKS:
1.Stephen Marsland, “Machine Learning: An Algorithmic Perspective”, CRC Press, 2011.
2.Richard O. Duda, Peter E. Hart, David G. Stork, ”Pattern Classification”, Second Edition.,
Wiley India, 2006.
3.Christopher M. Bishop, “Pattern Recognition and Machine Learning”, Springer (India)
Private Limited, 2013.
4.Ian H. Witten, Eibe Frank, “Data Mining: Practical Machine Learning Tools and
Techniques”, Second Edition, Elsevier India, 2011.
5.SergiosTheodoridis, KonstantinosKoutroumbas, “Pattern Recognition”, Fourth Edition.,
China Machine Press, 2009
6. William Gibson,” Pattern Recognition ”,Penguin, 2011
WEB RESOURCES:
1. https://www.v7labs.com/blog/pattern-recognition-guide
2. https://www.simplilearn.com/pattern-recognition-and-ml-article
IT626209 - PARALLEL COMPUTING
Elective
COURSE OBJECTIVES:
 To study the scalability and clustering issues and the technology necessary for them.
 To understand the technologies enabling parallel computing.
 To study the different types of interconnection networks.
 To study the different parallel programming models.
 To study the software support needed for shared memory programming.
UNIT 1: SCALABILITY AND CLUSTERING 9

Evolution of Computer Architecture – Dimensions of Scalability – Parallel Computer Models –
Basic Concepts of Clustering – Scalable Design Principles – Parallel Programming Overview
– Processes, Tasks and Threads – Parallelism Issues – Interaction / Communication Issues
–
Semantic Issues In Parallel Programs.
UNIT 2: ENABLING TECHNOLOGIES 9
System Development Trends – Principles of Processor Design – Microprocessor Architecture
Families – Hierarchical Memory Technology – Cache Coherence Protocols – Shared Memory
Consistency – Distributed Cache Memory Architecture – Latency Tolerance Techniques –
Multithreaded Latency Hiding.
UNIT 3: SYSTEM INTERCONNECTS 9
Basics of Interconnection Networks – Network Topologies and Properties – Buses, Crossbar and
Multistage Switches, Software Multithreading – Synchronization Mechanisms.
UNIT 4: PARALLEL PROGRAMMING 9
Paradigms and Programmability – Parallel Programming Models – Shared Memory
Programming.
UNIT 5: MESSAGE PASSING PROGRAMMING 9
Message Passing Paradigm – Message Passing Interface – Parallel Virtual Machine.
TOTAL: 45 PERIODS
CO1: Know the scalability and clustering issues and the technology necessary for them.
CO2: Build the technologies enabling parallel computing.
CO3: Build the different types of interconnection networks.
CO4: Design the different parallel programming models.
CO5: Develop the software support needed for shared memory programming.
CO-PO MAPPING
CO1 3 2 2 3 2
CO2 2 2 2 3 3
CO3 2 2 2 2 3
CO4 2 2 2 2 3
CO5 2 3 2 2 2
REFERENCE BOOKS:
1.Kai Hwang and Zhi.WeiXu, “Scalable Parallel Computing”, Tata McGraw-Hill, New
Delhi, 2016.
2.David E. Culler &Jaswinder Pal Singh, “Parallel Computing Architecture: A
Hardware/Software Approach”, Morgan Kaufman Publishers, 2000.
3.Michael J. Quinn, “Parallel Programming in C with MPI &OpenMP”, Tata McGraw-
Hill, New Delhi, 2005.
4.Anubhav Pradhan, Anil V Deshpande, “Mobile Apps Development”, First Edition, Wiley
India,2013
5.Joseph JaJa, “Introduction to Parallel Algorithms”, Addison-Wesley, 2000.
6.Selim G. Akl, “The Design and Analysis of Parallel Algorithms”, Prentice Hall, New Jercy,
2016
WEB RESOURCES:
1. https://www.ibm.com/topics/parallel-computing
2. https://appicontemplate.com/
IT626210 - MOBILE APPLICATION DEVELOPMENT
Elective
COURSE OBJECTIVES:
 To understand the need and characteristics of mobile applications
 To design the right user interface for mobile application
 To understand the design issues in the development of mobile applications.
 To understand the development procedure for mobile application.
 To develop mobile applications using various tools and platforms
UNIT 1: INTRODUCTION 9
Mobile Application Model – Infrastructure andManaging Resources – Mobile Device Profiles
– Frameworks and Tools.
UNIT 2: USER INTERFACE 9
Generic UI Development - Multimodal and Multichannel UI –Gesture Based UI – Screen
Elements and Layouts – Voice XML.
UNIT 3: APPLICATION DESIGN 9
Memory Management – Design Patterns for Limited Memory – Work Flow for Application
development – Java API – Dynamic Linking – Plugins and rule of thumb for using DLLs –
Concurrency and Resource Management.
UNIT 4: MOBILE OS 9
Mobile OS: Android, iOS – Android Application Architecture – Android basic components –
Intents and Services – Storing and Retrieving data – Packaging and Deployment – Security
and Hacking.
UNIT 5: APPLICATION DEVELOPMENT 9
Communication via the Web – Notification and Alarms – Graphics and Multimedia: Layer
Animation, Event handling and Graphics services – Telephony – Location based services
TOTAL: 45 PERIODS
CO1: Know the features of the basics of mobile application development frameworks and
tools
CO2: Able to develop a UI for mobile application
CO3: Design mobile applications that manages memory dynamically
CO4: Build applications based on mobile OS like Android, iOs
CO5: Build location based services
CO-PO MAPPING
CO1 3 2 2 2 2 2 3 2
CO2 2 2 2 2 3 2 3 3
CO3 2 2 2 3 2 2 2 3
CO4 2 2 2 2 2 2 2 3
CO5 2 3 2 2 3 3 2 2
REFERENCE BOOKS:
1.Reto Meier, “Professional Android 4 Application Development”,Wiley, First Edition, 2014.
2.ZigurdMednieks, LairdDornin, G. Blake Meike, Masumi Nakamura, “Programming
Android”, O’Reilly, 2nd Edition, 2016.
3.Alasdair Allan, “iPhone Programming”, O’Reilly, First Edition, 2013.
4.Anubhav Pradhan, Anil V Deshpande, “ Mobile Apps Development”, First Edition, Wiley
India, 2013
5.Barry Burd,”Android Application Development All in one for Dummies”, First Edition,
Wiley India, 2011
6.Erik Hellman, “Android programming-Pushing the Limits”, First Edition, Wiley India Pvt
Ltd, 2014.
WEB RESOURCES:
1. https://www.ibm.com/topics/mobile-application-development
2. https://appicontemplate.com/
IT626211 - VIRTUAL AND AUGMENT
REALITY
Course Type: L T P C
Course Category: Programme Elective 3 0 0 3
Theory
COURSE OBJECTIVES:
 To study about Fundamental Concept and Components of Virtual Reality
 To study about Interactive Techniques in Virtual Reality
 To study about Visual Computation in Virtual Reality
 To study about Augmented and Mixed Reality and Its Applications
 To know about I/O Interfaces and its functions.
UNIT 1: INTRODUCTION TO VIRTUAL REALITY 9

Introduction, Fundamental Concept and Components of Virtual Reality. Primary Features and
Present Development on Virtual Reality. Computer graphics, Real time computer graphics,
Flight Simulation, Virtual environment requirement, benefits of virtual reality, Historical
development of VR, Scientific Landmark 3D Computer Graphics: Introduction, The Virtual
world space, positioning the virtual observer, the perspective projection, human vision, stereo
perspective projection, 3D clipping, Colour theory, Simple 3D modelling, Illumination
models, Reflection models, Shading 24 algorithms, Radiosity, Hidden Surface Removal,
Realism Stereographic image.
UNIT 2: INTERACTIVE TECHNIQUES IN VIRTUAL REALITY 9
Introduction, from 2D to 3D, 3D spaces curves, 3D boundary representation Geometrical
Transformations: Introduction, Frames of reference, Modeling transformations, Instances,
Picking, Flying, Scaling the VE, Collision detection Generic VR system: Introduction,
Virtual environment, Computer environment, VR technology, Model of interaction, VR
Systems.
UNIT 3: VISUAL COMPUTATION IN VIRTUAL REALITY 9
Animating the Virtual Environment: Introduction, The dynamics of numbers, Linear and
Nonlinear interpolation, the animation of objects, linear and non-linear translation, shape
&object in betweening, free from deformation, particle system. Physical Simulation:
Introduction, Objects falling in a gravitational field, Rotating wheels, Elastic collisions,
projectiles, simple pendulum, springs, Flight dynamics of an aircraft.
UNIT 4: AUGMENTED AND MIXED REALITY 9
Taxonomy, technology and features of augmented reality, difference between AR and VR,
Challenges with AR, AR systems and functionality, Augmented reality methods,
visualization techniques for augmented reality, wireless displays in educational augmented
reality applications, mobile projection interfaces, marker-less tracking for augmented reality,
enhancing interactivity in AR environments, evaluating AR systems.
UNIT 5: I/O INTERFACE IN VR & APPLICATION OF VR 9
Human factors: Introduction, the eye, the ear, the somatic senses. VR Hardware:
Introduction, sensor hardware, Head-coupled displays, Acoustic hardware, Integrated VR
systems. VR Software: Introduction, Modeling virtual world, Physical simulation, VR
toolkits, Introduction to VRML, Input -- Tracker, Sensor, Digitalglobe, Movement Capture,
Video-based Input, 3D Menus & 3DScanner etc. Output -- Visual /Auditory / Haptic
Devices.
VR Technology in Film & TV Production. VR Technology in Physical Exercises and Games.
Demonstration of Digital Entertainment by VR.
TOTAL: 45 PERIODS
CO1: Able to know the Fundamental Concept and Components of Virtual Reality
CO2: Able to know the Interactive Techniques in Virtual Reality
CO3: Get the knowledge about Visual Computation in Virtual Reality
CO4: Able to know the concepts of Augmented and Mixed Reality and Its Applications
CO5: Know about I/O Interfaces and its functions.
CO-PO MAPPING
CO1 3 2 2 2 2 2 3 3
CO2 2 2 2 2 3 2 3 3
CO3 2 2 3 2 3 2 2 2
CO4 2 2 2 2 2 2 2 3
CO5 2 3 2 2 3 2 2 2
REFERENCE BOOKS:
1.Alan B. Craig, “Understanding Augmented Reality, Concepts and Applications”, Morgan
Kaufmann,First Edition 2013.
2.Alan Craig, William Sherman and Jeffrey Will, “Developing Virtual Reality Applications,
Foundations of Effective Design”, Morgan Kaufmann, 2009.
3.John Vince, “Virtual Reality Systems “, Pearson Education Asia, 2007.
4.Adams, “Visualizations of Virtual Reality”, Tata McGraw Hill, 2000.
5.William R. Sherman, Alan B. Craig, “Understanding Virtual Reality: Interface, Application
and Design”, Morgan Kaufmann, 2008
6.Burdea, G. C. and P. Coffet. Virtual Reality Technology, Second Edition. Wiley-IEEE
Press, 2003/2006.
WEB RESOURCES:
1. http://virtualrealityforeducation.com/resources/
2.https://www.fusionvr.in/industry-academic-alliance
program?gclid=Cj0KCQjwocShBhCOARIsAFVYq0gk9Ihi2C8xFtgTEQahsKUeax_sMHHK
bIYPpQnjFRldyW20i62iexcaAvtNEALw_wcB
IT626212 - MULTIMEDIA DATABASES
Elective
COURSE OBJECTIVES:
 To familiarize about the database indexing methods and different
multidimensional data structures.
 To learn about text database, its storage and retrieval
 To learn about image database, its storage and retrieval
 To understand about Audio and Video Storage.
 To understand design and architecture of a Multimedia Database.
UNIT 1: DATABASE INDEXING METHODS 9
Hashing – B-trees – Secondary Key Access Methods – Inverted Files – Point Access
Methods (PAMs) –Spatial Access Methods (SAMs) – Space Filling Curves – Transformation
to Higher–D Points – Multidimensional Data Structures – K-D Trees – Point Quadtrees– The
MX–Quadtree– RTrees.
UNIT 2: TEXT DATABASES 9
Precision and Recall – Stop Lists – Word Stems and Frequency Tables – Latent Semantic
Indexing – TV-Trees – Indexing Text and DNA Strings – Access Methods for Text – Full
Text Scanning – Inversion – Signature Files – Vector Space Model and Clustering.
UNIT 3: IMAGE RETRIEVAL MECHANISMS 9
Image Databases – Raw Images – Compressed Image Representations – Similarity Based
Retrieval – Alternative Image DB Paradigms – Representing Image DBs with Relations –
Representing Image DBs with R-Trees – Retrieving Images by Spatial Layout –
Implementations.
UNIT 4: AUDIO/VIDEO DATABASES 9
Audio Databases – A General Model of Audio Data – Capturing Audio Content through
Discrete Transformation – Indexing Audio Data–Video Databases – Organizing Content of a
Single Video – Querying Content of Video Libraries – Video Segmentation.
UNIT 5: MULTIMEDIA DATABASE DESIGN 9
Design and Architecture of a Multimedia Database – Organizing Multimedia Data based on
the Principle of Uniformity – Media Abstractions – Query Languages for Retrieving
Multimedia Data.
TOTAL: 45 PERIODS
CO1: Apply database indexing methods for efficient storage and retrieval of multimedia
content.
CO2: Work with Text databases, its storage and retrieval.
CO3: Demonstrate about the Image database, its storage and retrieval.
CO4: Formulate and generalize the use of audio and video databases for real time multimedia
applications.
CO5: Apply multimedia database design for multimedia architecture.
CO-PO MAPPING
CO1 3 2 2 2 2 2 3 3
CO2 2 2 2 2 3 2 3 3
CO3 2 3 2 3 2 3 2 2 2
CO4 2 2 2 3 2 3 2 3
CO5 2 3 21- low, 2 - medium, 3 - high, ‘-' no correlation2
2 2 2 2
REFERENCE BOOKS:
1.Christos Faloutsos, “Searching Multimedia databases by Content”, Kluwer Academic
Publishers,2011.
2.V. S. Subramanian, “Principles of Multimedia Database Systems”, Harcourt India Pvt Ltd.,
2001.
3.Lynne Dunckley, “Multimedia Databases: An Object Relational Approach”, Pearson
Education, 2003.
4.S. Khoshafian, A. B. Baker, “Multimedia and Imaging Databases”, Elsevier, 1996.
5.C. Kingsley Nwosu, “Multimedia Database Systems: Design and Implementation
Strategies”, Kluwer Academic Publishers,2012.
6.R. Elmasri, S. B. Navathe, “Fundamentals of Database Systems”, Seventh edition, Pearson
Education,2017.
WEB RESOURCES:
1. https://researchguides.dartmouth.edu/c.php?g=59724&p=382829
2. https://www.tutorialspoint.com/Multimedia-Databases
PROGRAMME
ELECTIVE -V
CS624221 - MULTIMIDIA AND COMPRESSION
TECHNIQUES
Elective
COURSE OBJECTIVES:
 To understand the basic ideas of compression algorithms related to multimedia
components
 To learn the Text compression algorithms
 To get the knowledge of Image compression algorithms
 To know the features of Audio compression algorithms
 To know the features of Video compression algorithms
UNIT 1: FUNDAMENTALS OF COMPRESSION 9
Introduction To multimedia – Graphics, Image and Video representations – Fundamental
concepts of video, digital audio – Storage requirements of multimedia applications – Need for
compression – Taxonomy of compression Algorithms - Elements of Information Theory –
Error Free Compression – Lossy Compression.
UNIT 2: TEXT COMPRESSION 9
Huffman coding – Adaptive Huffman coding – Arithmetic coding – Shannon-Fano coding –
Dictionary techniques – LZW family algorithms.
UNIT 3: IMAGE COMPRESSION 9
Image Compression: Fundamentals –– Compression Standards – JPEG Standard – Sub-band
coding – Wavelet Based compression – Implementation using Filters – EZW, SPIHT coders
– JPEG 2000 standards – JBIG and JBIG2 standards.
UNIT 4: AUDIO COMPRESSION 9
Audio compression Techniques – law, A-Law compounding – Frequency domain and
filtering – Basic sub-band coding – Application to speech coding – G.722 – MPEG audio –
progressive encoding – Silence compression, Speech compression – Formant and CELP
vocoders.
UNIT 5: VIDEO COMPRESSION 9
Video compression techniques and Standards – MPEG video coding: MPEG-1 and MPEG-2
video coding: MPEG-3 and MPEG-4 – Motion estimation and compensation techniques –
H.261 Standard – DVI technology – DVI real time compression – Current Trends in
Compression standards.
TOTAL: 45 PERIODS
CO1: Implement basic compression algorithms familiar with the use of MATLAB and its
equivalent open source environments
CO2: Design and implement the Text compression algorithms
CO3: Analyse different approaches of image compression algorithms in multimedia projects.
CO4: Analyse different approaches of audio compression algorithms in multimedia projects.
CO5: Design and implement the video compression algorithms
CO-PO MAPPING
CO1 3 2 2 2 3 3 3
CO2 2 2 2 3 3 2 3 3
CO3 2 3 2 2 2 2 2 2
CO4 2 2 2 2 3 2 2 3
CO5 2 3 2 2 2 2 2 2
1- low, 2 – medium, 3 – high, ‘-‘ no correlation
REFERENCE BOOKS:
1.Cold McAnlis and AleksHaecky, “ Understanding Compression: Data Compression for
Modern Developers”, O’Reilly, 2016
2.Khalid Sayood: Introduction to Data Compression”, Morgan Kauffman Harcourt India,
Third Edition, 2010.
3.David Solomon, “Data Compression – The Complete Reference”, Fourth Edition, Springer
Verlog, New York, 2006.
4.Mark S. Drew, Ze-Nian Li, “Fundamentals of Multimedia”, PHI, 2009.
5.Raymond Westwater and BorkoFurht,” Real-time Video Compression: Techniques and
Algorithms”, Springer, 2013.
6.Yun Q.Shi, Huifang Sun, “Image and Video Compression for Multimedia Engineering,
Algorithms and Fundamentals”, CRC Press, 2003.
WEB RESOURCES:
1.https://www.analytixlabs.co.in/blog/data-compression-technique/
2.https://www.alibabacloud.com/knowledge/hot/digital-video-compression-techniques
IT626213 - REMOTE SENSING
Elective
COURSE OBJECTIVES:
 To familiarize about the basic principles of remote sensing
 To acquire knowledge about the motion of remote sensing satellites in the space
 To expose the various types of sensors used for remote sensing
 To gain knowledge about the generation of satellite data products
 To extract useful information from satellite images
UNIT 1: PHYSICS OF REMOTE SENSING 9

Remote Sensing - Defintion - Components - Electro Magnetic Spectrum – Basic wave theory
– Particle theory – Stefan Boltzman law - Wiens-Displacement Law - Radiometric quantities
- Effects of Atmosphere- Scattering – Different types –Absorption-Atmospheric window-
Energy interaction with surface features – Spectral reflectance of vegetation, soil and water –
atmospheric influence on spectral response patterns- multi concept in Remote sensing
UNIT 2: PLATFORMS 9
Orbit elements – Types of orbits – Motions of planets and satellites – Launch of space vehicle
– Orbit perturbations and maneuvers – escape velocity - Types and characteristics of different
remote sensing platforms – sun synchronous and geo synchronous satellites.
UNIT 3: SENSORS 9
Classification of remote sensors – selection of sensor parameters - resolution concept -
Spectral, Radiometric and temporal resolution – Quality of images – imaging mode –
photographic camera – opto-mechanical scanners – pushbroom and whiskbroom cameras –
Panchromatic, multi spectral , thermal, hyperspectral scanners and microwave sensors –
geometric characteristics of scanner imagery – Operational Earth resource satellites -
Landsat, SPOT, IRS, WorldView, hyperion and hysis, ERS, ENVISAT,Sentinel.
UNIT 4: DATA RECEPTION AND DATA PRODUCTS 9
Ground segment organization – Data product generation – sources of errors in received data –
referencing scheme – data product output medium – Digital products – Super structure,
Fast,GeoTIFF, Hierarchical and HDF formats – Indian and International Satellite Data
Products – ordering of data
UNIT 5: DATA ANALYSIS 9
Data products and their characteristics – Elements of visual interpretation – interpretation
keys – Digital image processing – Preprocessing – Image rectification – Image enhancement
techniques– Image classification – Supervised and unsupervised classification algorithms for
multispectral and hyperspectral images – Accuracy assessment.- hybrid classification
techniques – Knowledge based classification, Neural Network Classification, Fuzzy
Classification.
TOTAL: 45 PERIODS
CO1: Know the concepts and laws related to remote sensing
CO2: Acquire knowledge about various remote sensing platforms
CO3: Acquire the knowledge of the characteristics of different types of remote sensors
CO4: Apply the knowledge about reception, product generation, storage and ordering of
satellite data.
CO5: Design the basic concept of different image processing techniques and interpretation of
satellite data
CO-PO MAPPING
CO1 3 2 2 2 2 2 3 2
CO2 2 2 2 2 3 2 3 3
CO3 2 2 2 3 2 3 2 2
CO4 2 2 2 2 2 2 2 3
CO5 2 3 2 3 2 2 2 2
REFERENCE BOOKS:
1.Thomas Lillesand, R.W.Kiefer and Jonathan Chipman, “Remote Sensing and Image
interpretation”, Wiley, Seventh edition, 2015.
2.John R. Jensen,”Introductory Digital Image Processing: A Remote Sensing Perspective”,
Pearson Eduction, 4th Edition, 2016.
4.Paul J. Curran. “Principles of Remote Sensing”, Longman Scientific & Technical, 1986.
5.George Joseph, C.Jeganathan, “Fundamentals of Remote Sensing”, Third Edition,
Universities Press (India) Pvt Ltd, Hyderabad, 2018.
6.S. C. Bhatia,”Fundamentals of Remote Sensing”, Atlantic Publishers & Distributors (P)
Limited,2008.
WEB RESOURCES:
1. http://www.gpsworld.com/
2. http://rsl.gis.umn.edu/rs101.html
IT626214 - GRID COMPUTING
Elective
COURSE OBJECTIVES:
 To learn the basics of grid computing
 To know the grid computing initiatives
 To learn the application of grid computing
 To know the features of the Grid computing technology
 To understand the tool kits to facilitated the grid computing
UNIT 1: GRID COMPUTING 9

Introduction - Definition and Scope of grid computing
UNIT 2: GRID COMPUTING INITIALIVES 9
Grid Computing Organizations and their roles – Grid Computing analog –
Grid Computing road map.
UNIT 3: GRID COMPUTING APPLICATIONS 9
Merging the Grid sources – Architecture with the Web Devices Architecture.
UNIT 4: TECHNOLOGIES 9
Acting under Uncertainty, Basic Probability Notation, Representing Knowledge in an
Uncertain Domain, The Semantics of Bayesian Networks, Efficient Representation of
Conditional Distributions, Exact Inference in Bayesian Networks, Approximate Inference in
Bayesian Networks, Extending Probability to First-Order Representations, Other Approaches
to Uncertain Reasoning.
UNIT 5: GRID COMPUTING TOOL KITS 9
Inductive learning for classification, decision-tree induction, neural-networks: representation
and training.
TOTAL: 45 PERIODS
CO1: Acquire the knowledge of the basics of grid computing
CO2: Know the features of the grid computing initiatives
CO3: Know the application of grid computing
CO4: Apply the Grid computing technology
CO5: Develop the tool kits to facilitated the grid computing
CO-PO MAPPING
CO1 3 2 2 3 2
CO2 2 2 2 3 3
CO3 2 2 2 2 2
CO4 2 2 2 2 3
CO5 2 3 2 2 2
REFERENCE BOOKS:
1.Joshy Joseph & Craig Fellenstein, “Grid Computing”, Pearson Education, 2004.
2.Ahmar Abbas, “Grid Computing: A Practical Guide to technology and Applications”,
Charles River media – 2004.
3.Barry Wilkinson,” Grid ComputingTechniques and Applications,” Taylor and Francis,
2010.
4.HaiZhuge,”Grid and Cooperative Computing”, Springer,2005.
5.Frederic Magoules,”Fundamentals of Grid Computing- Theory, Algorithms and
Technologies”, CRC Press, 2019.
6.Lizhe Wang, Wei Jie, Jinjun Chen,” Grid Computing- Infrastructure, Service, and
Applications”, CRC Press,2018.
WEB RESOURCES:
1. https://www.spiceworks.com/tech/cloud/articles/what-is-grid-computing/
2. https://www.geeksforgeeks.org/grid-computing/
IT626215 - WEB MINING
Elective
COURSE OBJECTIVES:
 To define the web mining and understand the need for web mining
 To know the features of supervised and unsupervised algorithm
 To learn the methods of information retrieval and web search algorithm
 To know the different application areas for web mining
 To learn the methods of Web usage mining
UNIT 1: INTRODUCTION 9
Web Data Mining and Data Mining Foundations, Introduction – World Wide Web (WWW),
A Brief History of the Web and the Internet, Web Data Mining-Data Mining, Web Mining.
Data Mining Foundations – Association Rules and Sequential Patterns – Basic Concepts of
Association Rules, Apriori Algorithm- Frequent Itemset Generation, Association Rule
Generation, Data Formats for Association Rule Mining, Mining with multiple minimum
supports – Extended Model, Mining Algorithm, Rule Generation, Mining Class Association
Rules, Basic Concepts of Sequential Patterns, Mining Sequential Patterns on GSP, Mining
Sequential Patterns on PrefixSpan, Generating Rules from Sequential Patterns.
UNIT 2: SUPERVISED AND UNSUPERVISED LEARNING 9
Supervised Learning – Basic Concepts, Decision Tree Induction – Learning Algorithm,
Impurity Function, Handling of Continuous Attributes, Classifier Evaluation, Rule Induction
– Sequential Covering, Rule Learning, Classification Based on Associations, Naïve Bayesian
Classification , Naïve Bayesian Text Classification – Probabilistic Framework, Naïve
Bayesian Model . Unsupervised Learning – Basic Concepts , K-means Clustering – K-means
Algorithm, Representation of Clusters, Hierarchical Clustering – Single link method,
Complete link Method, Average link method, Strength and Weakness.
UNIT 3: INFORMATION RETRIEVAL AND WEB SEARCH 9
Basic Concepts of Information Retrieval, Information Retrieval Methods – Boolean Model,
Vector Space Model and Statistical Language Model, Relevance Feedback, Evaluation
Measures, Text and Web Page Preprocessing – Stopword Removal, Stemming, Web Page
Preprocessing, DuplicateDetection, Inverted Index and Its Compression – Inverted Index,
Search using Inverted Index, Index Construction, Index Compression, Latent Semantic
Indexing – Singular Value Decomposition, Query and Retrieval, Web Search, Meta Search,
Web Spamming.
UNIT 4: LINK ANALYSIS AND WEB CRAWLING 9
Link Analysis – Social Network Analysis, Co-Citation and Bibliographic Coupling, Page
Rank Algorithm, HITS Algorithm, Community Discovery-Problem Definition, Bipartite Core
Communities, Maximum Flow Communities, Email Communities. Web Crawling – A Basic
Crawler Algorithm- Breadth First Crawlers, Preferential Crawlers, Implementation Issues –
Fetching, Parsing, Stopword Removal, Link Extraction, Spider Traps, Page Repository,
Universal Crawlers, Focused Crawlers, Topical Crawlers, Crawler Ethics and Conflicts.
UNIT 5: OPINION AND WEB USAGE MINING 9
Opinion Mining and Opinion Mining – Sentiment Classification – Classification based on
Sentiment Phrases, Classification Using Text Classification Methods, Feature based Opinion
Mining and Summarization – Problem Definition, Object feature extraction, Feature
Extraction from Pros and Cons of Format1, Feature Extraction from Reviews of Format 2 and
3, Comparative Sentence and Relation Mining, Opinion Search and Opinion Spam. Web
Usage Mining – Data Collection and Preprocessing- Sources and Types of Data, Key
Elements of Web usage Data Preprocessing, Data Modeling for Web Usage Mining,
Discovery and Analysis of Web usage Patterns -Session and Visitor Analysis, Cluster
Analysis and Visitor Segmentation, Association and Correlation Analysis, Analysis of
Sequential and Navigation Patterns.
TOTAL: 45 PERIODS
CO1: Describe web mining and understand the need for web mining
CO2: Apply the features of supervised and unsupervised algorithm
CO3: Apply the methods of information retrieval and web search algorithm
CO4: Develop the different application areas for web mining
CO5: Design the methods of Web usage mining
CO-PO MAPPING
CO1 3 2 2 2 2 2 3 2
CO2 2 2 2 2 2 2 3 3
CO3 2 2 2 3 2 3 2 3
CO4 2 2 2 3 2 3 2 3
CO5 2 3 2 2 2 2 2 2
REFERENCE BOOKS:
1. Bing Liu, “Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data”, Springer
Publications, Second Edition,2013.
2. Jiawei Han, MichelineKamber,”Data Mining: Concepts and Techniques”, Elsevier
Publications, Fourth Edition, 2022
3.Anthony Scime,“Web Mining:: Applications and Techniques”, Idea Group Publishing,2005
4.SoumenChakrabarti,“Mining the Web: Discovering Knowledge from Hypertext Data”,
Elsevier Publications, Second Edition,2002
5.Hsinchun Chen, “Dark Web-Exploring and Data Mining the Dark Side of the Web,2011
6.Zdravko Markov, Daniel T. Larose, Data Mining the WebUncovering Patterns in Web
Content, Structure, and Usage,2007
WEB RESOURCES:
1. https://www.javatpoint.com/web-content-vs-web-structure-vs-web-usage-mining
2. https://www.geeksforgeeks.org/web-mining/
IT626216 - SOFTWARE QUALITY ASSURANCE
Elective
COURSE OBJECTIVES:
 Tobe exposed to the Software Quality Assurance (SQA) architecture and the
details of SQA components.
 To understand of how the SQA components can be integrated into the project life
cycle.
 To be familiar with the software quality infrastructure.
 To exposed to the management components of software quality.
 To be familiar with the software quality Standards, Certification and Assessments
UNIT 1: INTRODUCTION TO SOFTWARE QUALITY & ARCHITECTURE 9

Need for Software quality – Quality challenges – Software quality assurance (SQA) –
Definition and objectives – Software quality factors- McCall‟s quality model – SQA system
and architecture – Software Project life cycle Components – Pre project quality components –
Development and quality plans.
UNIT 2: SQA COMPONENTS AND PROJECT LIFE CYCLE 9
Software Development methodologies – Quality assurance activities in the development
process- Verification & Validation – Reviews – Software Testing – Software Testing
implementations – Quality of software maintenance – Pre-Maintenance of software quality
components – Quality assurance tools – CASE tools for software quality – Software
maintenance quality – Project Management.
UNIT 3: SOFTWARE QUALITY INFRASTRUCTURE 9
Procedures and work instructions - Templates - Checklists – 3S development - Staff training
andcertification Corrective and preventive actions – Configuration management – Software
changecontrol – Configuration management audit -Documentation control – Storage and
retrieval.
UNIT 4: SOFTWARE QUALITY MANAGEMENT & METRICS 9
Project process control – Computerized tools - Software quality metrics – Objectives of
qualitymeasurement – Process metrics – Product metrics – Implementation – Limitations of
software metrics – Cost of software quality – Classical quality cost model – Extended model
– Application of Cost model.
UNIT 5: STANDARDS, CERTIFICATIONS & ASSESSMENTS 9
Quality management standards – ISO 9001 and ISO 9000-3 – capability Maturity Models –
CMM and CMMI assessment methodologies - Bootstrap methodology – SPICE Project –
SQA project process standards – IEEE st 1012 & 1028 – Organization of Quality Assurance
– Department management responsibilities – Project management responsibilities – SQA
units and other actors in SQA systems.
TOTAL: 45 PERIODS
CO1: Describe the basic tenets of software quality and quality factors.
CO2: Utilize the concepts in software development life cycle.
CO3: Demonstrate their capability to adopt quality standards
CO4: Assess the quality of software product.
CO5: Apply the concepts in preparing the quality plan & documents.
CO-PO MAPPING
CO1 3 2 2 3 3
CO2 2 2 2 3 2 3 3
CO3 2 3 2 2 2 2 2
CO4 2 2 2 2 3
CO5 2 3 2 2 2 2
REFERENCE BOOKS:
1.Daniel Galin, “Software Quality Assurance - From Theory to Implementation”, Pearson
Education Ltd UK, 2009.
2. MilindLimaye.“Software Quality Assurance”, TMH ,New Delhi, 2011.
3.Daniel Galin, “Software Quality :Concepts and practice”, IEEE/Wiley Publication, 2018.
4.Alan C. Gillies, “Software Quality: Theory and Management”, International Thomson
Computer Press, 2011.
5.Mordechai Ben-Menachem, “Software Quality: Producing Practical Consistent
Software”, International Thompson Computer Press, 2014.
6.KshirasagarNaik, PriyadarshiTripathy, “Software Testing and Quality Assurance: Theory
and Practice”, Wiley, 2008.
WEB RESOURCES:
1.https://www5.aptest.com/resources.html
2.https://www.geeksforgeeks.org/top-10-resources-to-learn-software-testing-in-2021/
INSTITUTE ELECTIVE
IT626901: MODERN SENSOR TECHNOLOGY
L T P C
Course Category: Institute Elective Course Type: Theory 3 0 0 3
COURSE OBJECTIVES:
 To impart the fundamentals of sensor technology and its significance in industrial
applications.
 To provide in depth knowledge in different types of Sensors.
 To implement the sensors for monitoring of Industrial Equipment.
 To provide knowledge in measuring various physical variables during industrial and
scientific activities.
 To impart understanding of intelligent sensors, micro-sensors and Nano-sensors
UNIT 1: CHARACTERISTICS OF SENSORS 9
Introduction to Instrument and their representation – Static performance characteristics of
instruments – Dynamic characteristics of instruments – Transducer elements – Intermediate
elements – Indicating, Recording and display elements
UNIT-2 : MEASUREMENT OF MECHANICAL COMPONENTS 9
Motion and vibration measurements – Relative, absolute type vibration measurement devices -
Dimensional metrology – Mechanical, Electromechanical, Pneumatic, Hydraulic dimensional
gauging devices - Force measurement - Balance principle of force measurement – Hydraulic
load cell – Pneumatic load cell – Elastic force devices – Electromechanical methods – Torque
and power measurements – Transmission, Torsion, Driving, Absorption type dynamometer
UNIT-3 : SENSORS FOR EQUIPMENT MONITORING 9
Pressure measurement – Moderate pressure measurement – High pressure Bridgeman Gauge –
Low pressure measurement – Calibration of pressure gauges – Temperature measurement –
Measurement of temperature – Non electrical methods of Temperature Measurement –
Electrical Methods of Temperature measurement – Radiation Methods – Flow measurement –
Acoustics measurement.
UNIT-4 : SENSORS FOR CONDITION MONITORING 9
Vibration and Noise monitoring – Temperature monitoring – Wear behavior monitoring –
Corrosion monitoring – Material defect monitoring - Acoustic emission monitoring technique
– Performance trend monitoring – Selection of condition monitoring techniques – Expert
system technique in fault diagnostics.
UNIT-5 : ADVANCEMENT IN SENSING TECHNOLOGY 9
Specific gravity measurements – Measurements of liquid level – Viscosity – Humidity and
Moisture – pH value – Biomedical measurements – Environmental air pollution measurement
devices - Smoke density measurement – Fibre optic Transducers – Microsensors – Smart
Sensors – Virtual Instrumentation
TOTAL: 45 PERIODS
CO1: Get the knowledge of various elements in sensor measurement.
CO2: Learn about the various sensors for motion, vibration, force and power
CO3: Familiarize with pressure, temperature and flow measurements
CO4: Find innovative solutions in monitoring physical parameters during on-line and off-line
conditions.
CO5: Analyse the fundamental principles of advancement in sensor technology.
CO-PO MAPPING
PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
PO1
2 3 4 5 6 7 8 9 0 1 2 1 2
CO1 2 2 2 2 - - - - 2 - 2 2 -
CO2 2 2 2 2 - - - - 2 - 2 2 -
CO3 2 2 2 - - - - 2 - 2 - 2
CO4 2 2 2 - - - - 2 - 2 - 2
CO5 2 2 2 2 - - - - 2 2 - 2
TEXT BOOKS:
1.Nakra B.C. and Chaudhry K.K., “Instrumentation, Measurement and Analysis”, Tata Mc
Graw Hill, 4th Edition, 2017.
2.Wang L. and Gao R.X., “Condition Monitoring and Control for Intelligent Manufacturing”,
Springer - Verlog London Limited, 2006.
Reference Books
1.John Vetelino, AravindReghu, “Introduction to Sensors”, CRC Press, 2017
2.Sinclair I.R., “Sensors and Transducers”, Elsevier India Private Limited, 2001.
WEB RESOURCES:
1.https://www.techbriefs.com/component/content/article/tb/pub/features/articles/33212
2.https://www.hindawi.com/journals/js/2021/1527467/
IT626902: DECISION SUPPORT AND INTELLIGENT SYSTEMS
Course Type: L T P C
Course Category: Institute Elective 3 0 0 3
Theory
COURSE OBJECTIVES:
 To review and clarify the fundamental terms, concepts associated with Decision
Support Systems.
 To discuss the modelling and analysis of the Decision Support Systems.
 To understand the enterprise DSS and knowledge management.
 To understand the intelligent systems used in DSS.
 To discuss organizational and social implications of Decision Support Systems
UNIT 1:DECISION MAKING AND COMPUTERIZED SUPPORT 9
Decision Making: Introduction and Definitions - Managers and Decision Making -
Managerial decision making and Information Systems - Managers and computerized support
Need - framework for decision support – concept of decision support systems (DSS) –
executive support systems - preview of the modeling process-phases of decision making
process.
UNIT 2 : MODELING AND ANALYSIS 9
DSS components- DSS classifications - Data warehousing, access, analysis, mining and
visualization - modeling and analysis- Static and dynamic models – influence diagrams –
Optimization via mathematical programming – Heuristic programming – simulation –
multidimensional modeling – model base management.
UNIT 3 : ENTERPRISE DECISION SUPPORT SYSTEMS 9
Group decision making – Group support systems- Technologies – Creativity and Idea
generation - enterprise information systems (EIS) – Comparing and Integrating EIS and DSS
- supply and value chain and DSS- supply chain problems and solutions – Computerized
systems - knowledge management methods, technologies and tools.
UNIT 4 : INTELLIGENT SYSTEMS 9
Artificial intelligence (AI) – Concepts and Definitions – AI versus natural intelligence -
expert systems-concepts, structure, types and benefits and problems – knowledge
Engineering - knowledge acquisition and validation - knowledge representation – Techniques
– Inference techniques.
UNIT 5 : IMPLEMENTATION, INTEGRATION, AND IMPACTS 9
Implementation – Major issues of implementation – implementation strategies – Models of
integration – Intelligent DSS – Intelligent modelling and model management – problems and
issues in integration - impact of management support systems - overview – personnel
management issues – impact of Individuals – Impacts on productivity, quality and
competitiveness – Issues of legality, privacy and ethics – Other societal impacts.
TOTAL: 45 PERIODS
CO1: Demonstrate an understanding of the theory of decisions and decision analysis
CO2: Demonstrate the different models used in the DSS
CO3: Design an information system using emerging tools and technologies for a given
business problem.
CO4: Describe the role of expert systems.
CO5: Illustrate the implementation, integration and impacts of Decision Support Systems
CO-PO MAPPING
CO1 2 2 2 2 2 - - - - - - 2 - -
CO2 2 2 - - 2 - - - - - - 2 - -
CO3 2 2 2 - - - - - - - 2 - -
CO4 2 2 - - 2 - - - - - - 2 - -
CO5 2 2 2 2 2 - - - - - - 2 - -
TEXT BOOKS:
1.Efraim Turban and Jay E Aronson, “Decision Support and Intelligent Systems”, Prentice
Hall, 9thEdition, 2010.
2.Elain Rich, Kevin Knight and Shivashankar B. Nair , “Artificial intelligence”, Tata
McGraw-Hill Publishing Company Limited, 3rd Edition, 2009.
Reference Books:
1.Daniel J. Power, “Decision Support Systems: Concepts and Resources for Managers”,
Greenwood Publishing Group, 1st Edition, 2002.
2.Quazi Khabeer, “Business Process Management and Decision Support Systems”, Alpha
Science International Limited, 1stEdition, 2013.
WEB RESOURCES:
1.https://www.researchgate.net/publication/277703502_Intelligent_Decision_Support_Syste
ms
2.https://www.intechopen.com/chapters/10951

R22-M.tech Curriculum and Syllabus

Uploaded by

Copyright:

Available Formats

R22-M.tech Curriculum and Syllabus

Uploaded by

Document Information

Original Title

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

R22-M.tech Curriculum and Syllabus

Uploaded by

Copyright:

Available Formats

PSN College of Engineering

Department of Computer Science and Engineering

M.Tech I.T - R 2022- Curriculum and Syllabus (I to IV Semester)

Programme Elective -II [Sem-II]

Programme Elective -III [Sem-II]

Programme Elective -IV [Sem-III]

Programme Elective -V [Sem-III]

Unit I – PROBABILITY AND RANDOM VARIABLES

Unit II – QUEUING MODELS

Unit III – SIMULATION

Unit IV – LINEAR PROGRAMMING

Unit V- NON-LINEAR PROGRAMMING

Course Program Outcomes Program

1. Mukesh Singhal and Niranjan G. Shivaratri, “Advanced Concepts in Operating

1. Abraham Silberschatz; Peter Baer Galvin; Greg Gagne, “Operating System

1. To understand the usage of algorithms in computing

Pre-requisites, if any: Fundamentals of data structures and algorithms

Unit 1 Algorithm and Analysis of Algorithm

Pre-requisites, if any: Probability and Number Theory

Course Program Outcomes Program

Pre-requisites, if any: Basic Knowledge about Data Structures

CO Outcomes Bloom’s Level

LAB REQUIREMENT FOR A BATCH OF 30 STUDENTS

Pre-requisites, if any: Basic knowledge in Data Analysis

Course Program Outcomes Program

Pre-requisites, if any: Basic Knowledge of Image Processing

Unit 1 INTRODUCTION TO DIGITAL IMAGE PROCESSING

Course Program Outcomes Program

Pre-requisites, if any: Computer Networks

At the end of the Course the students will be able to,

Pre-requisites, if any: Basics of Cryptography

Unit 1 INTRODUCTION AND BASIC ENCRYPTION

Course Program Outcomes Program

COURSE OUTCOMES VS PROGRAM OUTCOMES MAPPING

Course Program Outcomes Program

Enter correlation levels 1, 2 & 3 define as : 1-low, 2- medium & 3-high

Pre-requisites, if any: Basic Knowledge in Database Technology

Course Program Outcomes Program

Pre-requisites, if any: Knowledge on basics of Java

UNIT I INTRODUCTION TO INTERNET

CO5 Create user-interface applications using GUI components and to Apply

1. D. Hunter, et. Al. Beginning XML [WROX]

Pre-requisites, if any: Operating Systems

Unit 1 GENERAL OVERVIEW OF THE SYSTEM

Course Program Outcomes Program

Enter correlation levels 1, 2 & 3 define as: 1-low, 2- medium, & 3-

high Course Outcomes

1. To be aware of the Challenges and architecture of Wireless Sensor Networks.

Pre-requisites, if any: Computer Networks

Unit 1 OVERVIEW OF WIRELESS SENSOR NETWORKS

Pre-requisites, if any: Basic knowledge in Artificial Intelligence

Course Program Outcomes Program

1. S. Russell and P. Norvig, "Artificial Intelligence: A Modern Approach‖, Prentice

1. M. Tim Jones, ―Artificial Intelligence: A Systems Approach(Computer Science),

Pre-requisites, if any: Cloud Computing

Unit 1 Introduction to IoT

1. To present the mathematical, statistical and computational challenges of

Pre-requisites, if any: Image Processing and Artificial Intelligence

CO Outcomes Bloom’s Level