M.E. Cse.
M.E. Cse.
AFFILIATED INSTITUTIONS
M.E. COMPUTER SCIENCE AND ENGINEERING
REGULATIONS 2017
CHOICE BASED CREDIT SYSTEM
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex engineering
activities with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues and the consequent responsibilities relevant
to the professional engineering practice.
1
7. Environment and sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of, and
need for sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
9. Individual and team work: Function effectively as an individual, and as a member or leader
in diverse teams, and in multidisciplinary settings.
11. Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to ones own work, as a member and
leader in a team, to manage projects and in multidisciplinary environments.
12. Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.
1 3 3 3 3 3 1 3 3 1 2 3
2 3 2 3 3 3 3 1 2 3 3 2
3 1 3 2 3 2 3 3 3 1
2
MAPPING OF PROGRAM SPECIFIC OBJECTIVES WITH PROGRAMME OUTCOMES
A broad relation between the Program Specific Objectives and the outcomes is given in the
following table
PROGRAM PROGRAMME OUTCOMES
SPECIFIC
OBJECTIVES A B C D E F G H I J K L
1 3 1 2 3 3 1 1 1 2 1
2 3 3 3 3 3 2 1 1 3
3 1 2 3 3 3 2 1 1 2
3
M.E. COMPUTER SCIENCE AND ENGINEERING
SEMESTER COURSE WISE PO MAPPING
Programme Outcomes
SUBJECTS
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO5
PO8 PO9 PO10
PO11 PO12
Applied Probability and Statistics 3 1
3 3 2 3 1 1 1 1 1 1
4
Mobile and Pervasive Computing 3 3 3 3 3 1 1 1 2 1 1 2
Parallel Programming Paradigms 3 3 3 3 3 1 1 1 2 1 1 2
Information Retrieval Techniques 3 3 3 3 3 1 1 1 2 1 1 2
Software Architectures and Design 3 3 3 3 3 1 1 1 2 1 1 2
Big Data Computing Laboratory 3 3 3 3 3 1 3 1 2 1 2 2
Term Paper Writing and Seminar 3 3 3 3 3 3 1 1 2 1 2 2
Professional Elective III
Performance Analysis of Computer 2
3 3 3 3 3 1 1 1 1 1 1
Systems
Language Technologies 3 3 3 3 3 1 1 1 1 1 1 2
Computer Vision 3 3 3 3 3 1 1 1 1 1 1 2
Speech Processing and Synthesis 3 3 3 3 3 3 3 1 1 1 1 2
SEMESTER III
Reconfigurable Computing 3 3 3 3 3 1 1 1 1 1 1 2
Mobile Application Development 3 3 3 3 3 1 1 1 1 1 1 2
Bio Informatics 3 3 3 3 3 1 1 1 1 1 1 2
Information Storage Management 3 3 3 3 3 1 3 1 1 1 1 2
Project Work Phase I 3 3 3 3 3 1 1 3 3 3 3 1
Project Work Phase II 3 3 3 3 3 1 1 3 3 3 3 1
5
ANNA UNIVERSITY, CHENNAI
AFFILIATED INSTITUTIONS
M.E. COMPUTER SCIENCE AND ENGINEERING
REGULATIONS 2017
CHOICE BASED CREDIT SYSTEM
CURRICULA AND SYLLABI
SEMESTER I
SL. COURSE COURSE TITLE CATEGORY CONTACT L T P C
NO CODE PERIODS
THEORY
1. MA5160 Applied Probability
and Statistics FC 4 4 0 0 4
2. CP5151 Advanced Data
Structures and PC 4 4 0 0 4
Algorithms
3. CP5152 Advanced Computer
PC 3 3 0 0 3
Architecture
4. CP5153 Operating System
PC 3 3 0 0 3
Internals
5. CP5154 Advanced Software
PC 3 3 0 0 3
Engineering
6. CP5191 Machine Learning
PC 3 3 0 0 3
Techniques
PRACTICALS
7. CP5161 Data Structures
PC 4 0 0 4 2
Laboratory
TOTAL 24 20 0 4 22
SEMESTER II
SL. COURSE COURSE TITLE CATEGORY CONTACT L T P C
NO CODE PERIODS
THEORY
1. CP5201 Network Design and
PC 3 3 0 0 3
Technologies
2. CP5291 Security Practices PC 3 3 0 0 3
3. CP5292 Internet of Things PC 3 3 0 0 3
4. CP5293 Big Data Analytics PC 3 3 0 0 3
5. Professional
PE 3 3 0 0 3
Elective I
6. Professional
PE 3 3 0 0 3
Elective II
PRACTICALS
7. CP5261 Data Analytics
PC 4 0 0 4 2
Laboratory
8. CP5281 Term Paper Writing
EEC 2 0 0 2 1
and Seminar
TOTAL 24 18 0 6 21
6
SEMESTER III
SL. COURSE COURSE TITLE CATEGORY CONTACT L T P C
NO CODE PERIODS
THEORY
1. Professional Elective III PE 3 3 0 0 3
2. Professional Elective IV PE 3 3 0 0 3
3. Professional Elective V PE 3 3 0 0 3
PRACTICALS
4. CP5311 Project Work Phase I EEC 12 0 0 12 6
TOTAL 21 9 0 12 15
SEMESTER IV
SL. COURSE COURSE TITLE CATEGORY CONTACT L T P C
NO CODE PERIODS
PRACTICALS
1. CP5411 Project Work Phase II
EEC 24 0 0 24 12
TOTAL 24 0 0 24 12
7
FOUNDATION COURSES (FC)
SL. COURSE COURSE TITLE CATEGORY CONTACT L T P C
NO CODE PERIODS
1. MA5160 Applied Probability
FC 4 4 0 0 4
and Statistics
8
LIST OF ELECTIVES
II SEMESTER
ELECTIVE I
SL. COURSE CATEGORY CONTACT
COURSE TITLE L T P C
NO. CODE PERIODS
1. IF5191 Advanced Databases PE 3 3 0 0 3
2. CP5001 Principles of Programming
PE 3 3 0 0 3
Languages
3. CP5071 Image Processing and
PE 3 3 0 0 3
Analysis
4. CP5091 Web Engineering PE 3 3 0 0 3
5. CP5092 Cloud Computing
PE 3 3 0 0 3
Technologies
II SEMESTER
ELECTIVE II
SL. COURSE CATEGORY CONTACT
COURSE TITLE L T P C
NO CODE PERIODS
1. MP5291 Real Time Systems PE 3 3 0 0 3
2. CP5093 Mobile and Pervasive
PE 3 3 0 0 3
Computing
3. CP5002 Parallel Programming
PE 3 3 0 0 3
Paradigms
4. CP5094 Information Retrieval
PE 3 3 0 0 3
Techniques
5. CP5072 Software Architectures and
PE 3 3 0 0 3
Design
SEMESTER III
ELECTIVE III
SL. COURSE CATEGORY CONTACT
COURSE TITLE L T P C
NO. CODE PERIODS
1. CP5003 Performance Analysis of PE 3 3 0 0 3
Computer Systems
2. CP5004 Language Technologies PE 3 3 0 0 3
3. CP5095 Computer Vision PE 3 3 0 0 3
4. CP5096 Speech Processing and PE 3 3 0 0 3
Synthesis
5. CP5005 Software Quality Assurance PE 3 3 0 0 3
and Testing
9
SEMESTER III
ELECTIVE IV
SL. COURSE CATEGORY CONTACT
COURSE TITLE L T P C
NO. CODE PERIODS
1. CP5006 Formal models of software PE 3 3 0 0 3
systems
2. CP5073 Embedded Software PE 3 3 0 0 3
Development
3. CP5074 Social Network Analysis PE 3 3 0 0 3
4. CP5007 Bio-inspired Computing PE 3 3 0 0 3
5. CP5008 Compiler Optimization PE 3 3 0 0 3
Techniques
SEMESTER III
ELECTIVE V
SL. COURSE CATEGORY CONTACT
COURSE TITLE L T P C
NO CODE PERIODS
1. CP5009 Data Visualization
PE 3 3 0 0 3
Techniques
2. CP5010 Reconfigurable Computing PE 3 3 0 0 3
3. CP5097 Mobile Application
PE 3 3 0 0 3
Development
4. CP5075 Bio Informatics PE 3 3 0 0 3
5. CP5076 Information Storage
PE 3 3 0 0 3
Management
10
MA5160 APPLIED PROBABILITY AND STATISTICS L T P C
4 0 0 4
OBJECTIVES:
This course is designed to provide the solid foundation on topics in applied probability and various
statistical methods which form the basis for many other areas in the mathematical sciences
including statistics, modern optimization methods and risk modeling. It is framed to address the
issues and the principles of estimation theory, testing of hypothesis and multivariate analysis.
UNIT I PROBABILITY AND RANDOM VARIABLES 12
Probability Axioms of probability Conditional probability Bayes theorem - Random variables
- Probability function Moments Moment generating functions and their properties Binomial,
Poisson, Geometric, Uniform, Exponential, Gamma and Normal distributions Function of a
random variable.
UNIT II TWO DIMENSIONAL RANDOM VARIABLES 12
Joint distributions Marginal and conditional distributions Functions of two dimensional random
variables Regression curve Correlation.
OUTCOMES:
After completing this course, students should demonstrate competency in the following
topics:
Basic probability axioms and rules and the moments of discrete and continuous random
variables.
Consistency, efficiency and unbiasedness of estimators, method of maximum likelihood
estimation and Central Limit Theorem.
Use statistical tests in testing hypotheses on data.
Perform exploratory analysis of multivariate data, such as multivariate normal density,
calculating descriptive statistics, testing for multivariate normality.
The students should have the ability to use the appropriate and relevant, fundamental and applied
mathematical and statistical knowledge, methodologies and modern computational tools.
11
REFERENCES:
1. Devore, J. L., Probability and Statistics for Engineering and the Sciences, 8th Edition,
Cengage Learning, 2014.
2. Dallas E. Johnson, Applied Multivariate Methods for Data Analysis, Thomson and
Duxbury press, 1998.
3. Gupta S.C. and Kapoor V.K., Fundamentals of Mathematical Statistics, Sultan and Sons,
New Delhi, 2001.
4. Johnson, R.A., Miller, I and Freund J., "Miller and Freunds Probability and Statistics for
Engineers ", Pearson Education, Asia, 8th Edition, 2015.
5. Richard A. Johnson and Dean W. Wichern, Applied Multivariate Statistical Analysis, 5th
Edition, Pearson Education, Asia, 2002.
12
UNIT IV ALGORITHM DESIGN TECHNIQUES 12
Dynamic Programming: Matrix-Chain Multiplication Elements of Dynamic Programming
Longest Common Subsequence- Greedy Algorithms: An Activity-Selection Problem Elements of
the Greedy Strategy- Huffman Codes.
REFERENCES:
1. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, Data Structures and Algorithms,
Pearson Education, Reprint 2006.
2. Robert Sedgewick and Kevin Wayne, ALGORITHMS, Fourth Edition, Pearson Education.
3. S.Sridhar,Design and Analysis of Algorithms, First Edition, Oxford University Press. 2014
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to
Algorithms, Third Edition, Prentice-Hall, 2011.
13
UNIT III MULTIPROCESSOR ISSUES 9
Introduction- Centralized, Symmetric and Distributed Shared Memory Architectures Cache
Coherence Issues Performance Issues Synchronization Models of Memory
Consistency Case Study-Interconnection Networks Buses, Crossbar and Multi-stage
Interconnection Networks
OUTCOMES:
Upon completion of this course, the students should be able to:
Identify the limitations of ILP.
Discuss the issues related to multiprocessing and suggest solutions
Point out the salient features of different multicore architectures and how they exploit
parallelism.
Discuss the various techniques used for optimising the cache performance
Design hierarchal memory system
Point out how data level parallelism is exploited in architectures
REFERENCES:
1. Darryl Gove, Multicore Application Programming: For Windows, Linux, and Oracle
Solaris, Pearson, 2011
2. David B. Kirk, Wen-mei W. Hwu, Programming Massively Parallel Processors,
Morgan Kauffman, 2010
3. David E. Culler, Jaswinder Pal Singh, Parallel computing architecture : A
hardware/software approach , Morgan Kaufmann /Elsevier Publishers, 1999
4. John L. Hennessey and David A. Patterson, Computer Architecture A Quantitative
Approach, Morgan Kaufmann / Elsevier, 5th edition, 2012.
5. Kai Hwang and Zhi.Wei Xu, Scalable Parallel Computing, Tata McGraw Hill,
NewDelhi, 2003
14
CP5153 OPERATING SYSTEM INTERNALS LT PC
3 0 0 3
OBJECTIVES :
To be able to read and understand sample open source programs and header files.
To learn how the processes are implemented in linux.
To understand the implementation of the Linux file system.
To study Linux memory management data structures and algorithms.
To acquire the knowledge in the implementation of interprocess communication.
To understand how program execution happens in Linux.
UNIT I INTRODUCTION 9
Basic Operating System Concepts - Overview of Unix File System - Files - Links - Types - Inodes
-Access Rights - System Calls - Overview of Unix Kernels -Model - Implementation - Reentrant
Kernels - Address Space - Synchronization - Interprocess Communication - Process Management
- Memory Management - Device Drivers.
UNIT II PROCESSES 9
Processes, Lightweight Processes, and Threads - Process Descriptor - State - Identifying a
Process - Relationships among processes - Organization - Resource Limits - Creating Processes
- - System Calls - Kernel Threads - Destroying Processes -Termination - Removal.
UNIT III FILE SYSTEM 9
The Virtual File System (VFS) - Role - File Model -System Calls - Data Structures - Super Block,
Inode, File, dentry Objects - dentry Cache - Files Associated with a Process - Filesystem Types -
Special Filesystems - Filesytem Type Registration - Filesytem Handling - Namespaces - Mounting
- Unmounting - Implementation of VFS System Calls.
15
REFERENCES:
1. Daniel P. Bovet and Marco Cesati, "Understanding the Linux Kernel", 3rd Edition, O'Reilly
Publications, 2005.
2. Harold Abelson, Gerald Jay Sussman and Julie Sussman, Structure and Interpretation
of Computer Programs, Second Edition, Universities Press, 2013.
3. Maurice J. Bach, The Design of the Unix Operating System 1st Edition Pearson Education,
2003.
4. Michael Beck, Harald Bohme, Mirko Dziadzka, Ulrich Kunitz, Robert Magnus, Dirk Verworner,
Linux Kernel Internals, 2nd Edition, Addison-Wesley, 1998.
5. Robert Love, Linux Kernel Development, 3rd Edition, Addison-Wesley, 2010.
OBJECTIVES:
To understand Software Engineering Lifecycle Models
To do project management and cost estimation
To gain knowledge of the System Analysis and Design concepts.
To understand software testing approaches
To be familiar with DevOps practices
UNIT I INTRODUCTION 9
Software engineering concepts Development activities Software lifecycle models - Classical
waterfall - Iterative waterfall Prototyping Evolutionary - Spiral Software project management
Project planning Estimation Scheduling Risk management Software configuration
management.
UNIT II SOFTWARE REQUIREMENT SPECIFICATION 9
Requirement analysis and specification Requirements gathering and analysis Software
Requirement Specification Formal system specification Finite State Machines Petrinets
Object modelling using UML Use case Model Class diagrams Interaction diagrams Activity
diagrams State chart diagrams Functional modelling Data Flow Diagram.
UNIT III ARCHITECTURE AND DESIGN 9
Software design Design process Design concepts Coupling Cohesion Functional
independence Design patterns Model-view-controller Publish-subscribe Adapter
Command Strategy Observer Proxy Facade Architectural styles Layered - Client-
server - Tiered - Pipe and filter.- User interface design
UNIT IV TESTING 9
Testing Unit testing Black box testing White box testing Integration and System testing
Regression testing Debugging - Program analysis Symbolic execution Model Checking
UNIT V DEVOPS 9
DevOps:Motivation-Cloud as a platform-Operations- Deployment Pipeline:Overall Architecture-
Building and Testing-Deployment- Case study: Migrating to Microservices.
TOTAL: 45 PERIODS
16
OUTCOMES:
At the end of this course, the students will be able to:
Understand the advantages of various Software Development Lifecycle Models
Gain knowledge on project management approaches as well as cost and schedule
estimation strategies
Perform formal analysis on specifications
Use UML diagrams for analysis and design
Architect and design using architectural styles and design patterns
Understand software testing approaches
Understand the advantages of DevOps practices
REFERENCES:
1. Bernd Bruegge, Alan H Dutoit, Object-Oriented Software Engineering, 2nd edition, Pearso
Education, 2004.
2. Carlo Ghezzi, Mehdi Jazayeri, Dino Mandrioli, Fundamentals of Software Engineering, 2nd
edition, PHI Learning Pvt. Ltd., 2010.
3. Craig Larman, Applying UML and Patterns, 3rd ed, Pearson Education, 2005.
4. Len Bass, Ingo Weber and Liming Zhu, DevOps: A Software Architects Perspective,
Pearson Education, 2016
5. Rajib Mall, Fundamentals of Software Engineering, 3rd edition, PHI Learning Pvt. Ltd.,
2009.
6. Stephen Schach, Software Engineering 7th ed, McGraw-Hill, 2007.
17
UNIT III TREE AND PROBABILISTIC MODELS 9
Learning with Trees Decision Trees Constructing Decision Trees Classification and
Regression Trees Ensemble Learning Boosting Bagging Different ways to Combine
Classifiers Probability and Learning Data into Probabilities Basic Statistics Gaussian
Mixture Models Nearest Neighbor Methods Unsupervised Learning K means Algorithms
Vector Quantization Self Organizing Feature Map
REFERENCES:
1. Ethem Alpaydin, Introduction to Machine Learning 3e (Adaptive Computation and Machine
Learning Series), Third Edition, MIT Press, 2014
2. Jason Bell, Machine learning Hands on for Developers and Technical Professionals, First
Edition, Wiley, 2014
3. Peter Flach, Machine Learning: The Art and Science of Algorithms that Make Sense of Data,
First Edition, Cambridge University Press, 2012.
4. Stephen Marsland, Machine Learning An Algorithmic Perspective, Second Edition,
Chapman and Hall/CRC Machine Learning and Pattern Recognition Series, 2014.
5. Tom M Mitchell, Machine Learning, First Edition, McGraw Hill Education, 2013.
18
CP5161 DATA STRUCTURES LABORATORY LTPC
0 04 2
OBJECTIVES:
To acquire the knowledge of using advanced tree structures.
To learn the usage of heap structures.
To understand the usage of graph structures and spanning trees.
LIST OF EXPERIMENTS:
Each student has to work individually on assigned lab exercises. Lab sessions could be
scheduled as one contiguous four-hour session per week or two two-hour sessions per week.
There will be about 15 exercises in a semester. It is recommended that all implementations are
carried out in Java. If C or C++ has to be used, then the threads library will be required for
concurrency. Exercises should be designed to cover the following topics:
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, Bellmann Ford Algorithm)
9. Implementation of Matrix Chain Multiplication
10. Activity Selection and Huffman Coding Implementation.
TOTAL: 60 PERIODS
OUTCOMES:
Upon Completion of this course, the students will be able to:
Design and implement basic and advanced data structures extensively.
Design algorithms using graph structures
Design and develop efficient algorithms with minimum complexity using design techniques.
19
UNIT I NETWORK DESIGN 10
Advanced multiplexing Code Division Multiplexing, DWDM and OFDM Shared media
networks Switched networks End to end semantics Connectionless, Connection oriented,
Wireless Scenarios Applications, Quality of Service End to end level and network level
solutions. LAN cabling topologies Ethernet Switches, Routers, Firewalls and L3 switches
Remote Access Technologies and Devices Modems and DSLs SLIP and PPP Core
networks, and distribution networks.
UNIT II WIRELESS NETWORKS 9
IEEE802.16 and WiMAX Security Advanced 802.16 Functionalities Mobile WiMAX -
802.16e Network Infrastructure WLAN Configuration Management Operation Security
IEEE 802.11e and WMM QoS Comparison of WLAN and UMTS Bluetooth Protocol
Stack Security Profiles
UNIT IV 4G NETWORKS 9
LTE Network Architecture and Interfaces FDD Air Interface and Radio Networks
Scheduling Mobility Management and Power Optimization LTE Security Architecture
Interconnection with UMTS and GSM LTE Advanced (3GPPP Release 10) - 4G Networks and
Composite Radio Environment Protocol Boosters Hybrid 4G Wireless Networks Protocols
Green Wireless Networks Physical Layer and Multiple Access Channel Modelling for 4G
Introduction to 5G
20
REFERENCES:
1. Erik Dahlman, Stefan Parkvall, Johan Skold, 4G: LTE/LTE-Advanced for Mobile
Broadband, Academic Press, 2013.
2. Jonathan Rodriguez, Fundamentals of 5G Mobile Networks, Wiley, 2015.
3. Larry Peterson and Bruce Davie, Computer Networks: A Systems Approach, 5th edition,
Morgan Kauffman, 2011
4. Martin Sauter, "From GSM to LTE, An Introduction to Mobile Networks and Mobile
Broadband", Wiley, 2014.
5. Martin Sauter, Beyond 3G - Bringing Networks, Terminals and the Web Together: LTE,
WiMAX, IMS, 4G Devices and the Mobile Web 2.0, Wiley, 2009.
6. Naveen Chilamkurti, Sherali Zeadally, Hakima Chaouchi, Next-Generation Wireless
Technologies, Springer, 2013.
7. Paul Goransson, Chuck Black, Software Defined Networks: A Comprehensive
Approach, Morgan Kauffman, 2014.
8. Savo G Glisic, Advanced Wireless Networks 4G Technologies, John Wiley & Sons,
2007.
9. Thomas D.Nadeau and Ken Gray, SDN Software Defined Networks, OReilly
Publishers, 2013.
10. Ying Dar Lin, Ren-Hung Hwang and Fred Baker, Computer Networks: An Open Source
Approach, McGraw Hill, 2011
21
UNIT IV CYBER SECURITY AND CRYPTOGRAPHY 9
Cyber Forensics- Cyber Forensics and Incidence Response - Security e-Discovery -
Network Forensics - Data Encryption- Satellite Encryption - Password based authenticated
Key establishment Protocols.
REFERENCES:
1. John R.Vacca, Computer and Information Security Handbook, Second Edition, Elsevier
2013.
2. Michael E. Whitman, Herbert J. Mattord, Principal of Information Security, Fourth
Edition, Cengage Learning, 2012.
3. Richard E.Smith, Elementary Information Security, Second Edition, Jones and Bartlett
Learning, 2016
22
UNIT III IoT PROTOCOLS 9
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
REFERENCES:
1. Arshdeep Bahga, Vijay Madisetti, Internet of Things A hands-on approach,
Universities Press, 2015
2. Dieter Uckelmann, Mark Harrison, Michahelles, Florian (Eds), Architecting the
Internet of Things, Springer, 2011.
3. Honbo Zhou, The Internet of Things in the Cloud: A Middleware Perspective, CRC
Press, 2012.
4. Jan Ho ller, Vlasios Tsiatsis , Catherine Mulligan, Stamatis , Karnouskos, Stefan
Avesand. David Boyle, "From Machine-to-Machine to the Internet of Things -
Introduction to a New Age of Intelligence", Elsevier, 2014.
5. Olivier Hersent, David Boswarthick, Omar Elloumi , The Internet of Things Key
applications and Protocols, Wiley, 2012
23
UNIT I INTRODUCTION TO BIG DATA 7
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.
OUTCOMES:
At the end of this course, the students will be able to:
Understand how to leverage the insights from big data analytics
Analyze data by utilizing various statistical and data mining approaches
Perform analytics on real-time streaming data
Understand the various NoSql alternative database models
REFERENCES:
1. Bill Franks, Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
Streams with Advanced Analytics, Wiley and SAS Business Series, 2012.
2. David Loshin, "Big Data Analytics: From Strategic Planning to Enterprise Integration with
Tools, Techniques, NoSQL, and Graph", 2013.
3. Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer, Second Edition,
2007.
4. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today's Businesses", Wiley,
2013.
5. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging World of
Polyglot Persistence", Addison-Wesley Professional, 2012.
6. Richard Cotton, "Learning R A Step-by-step Function Guide to Data Analysis, , OReilly
Media, 2013.
24
CP5261 DATA ANALYTICS LABORATORY L T P C
0 0 4 2
OBJECTIVES:
To implement Map Reduce programs for processing big data
To realize storage of big data using H base, Mongo DB
To analyse big data using linear models
To analyse big data using machine learning techniques such as SVM / Decision tree
classification and clustering
LIST OF EXPERIMENTS
Hadoop
1. Install, configure and run Hadoop and HDFS
2. Implement word count / frequency programs using MapReduce
3. Implement an MR program that processes a weather dataset
R
4. Implement Linear and logistic Regression
5. Implement SVM / Decision tree classification techniques
6. Implement clustering techniques
7. Visualize data using any plotting framework
8. Implement an application that stores big data in Hbase / MongoDB / Pig
using Hadoop / R.
TOTAL: 60 PERIODS
OUTCOMES:
Upon Completion of this course, the students will be able to:
Process big data using Hadoop framework
Build and apply linear and logistic regression models
Perform data analysis with machine learning methods
Perform graphical data analysis
26
You have to provide a complete list of 4 week
th
Collection of 6%
Journal references you will be using- Based on ( the list of standard
papers in the your objective -Search various digital papers and reason for
topic in the libraries and Google Scholar selection)
context of the When picking papers to read - try to:
objective Pick papers that are related to each
collect 20 & other in some ways and/or that are in
then filter the same field so that you can write a
meaningful survey out of them,
Favour papers from well-known
journals and conferences,
Favour first or foundational papers
in the field (as indicated in other
peoples survey paper),
Favour more recent papers,
Pick a recent survey of the field so you
can quickly gain an overview,
Find relationships with respect to each
other and to your topic area
(classification scheme/categorization)
Mark in the hard copy of papers
whether complete work or
section/sections of the paper are being
considered
27
Reading and Repeat Reading Paper Process 6th week 8%
notes for ( the table given
next5 papers should indicate your
understanding of the
paper and the
evaluation is based on
your conclusions
about each paper)
Reading and Repeat Reading Paper Process 7th week 8%
notes for final ( the table given
5 papers should indicate your
understanding of the
paper and the
evaluation is based on
your conclusions
about each paper)
Draft outline Prepare a draft Outline, your survey goals, 8th week 8%
1 and Linking along with a classification / categorization ( this component will
papers diagram be evaluated based
on the linking and
classification among
the papers)
Abstract Prepare a draft abstract and give a 9th week 6%
presentation (Clarity, purpose and
conclusion)
6% Presentation &
Viva Voce
Introduction Write an introduction and background 10th week 5%
Background sections ( clarity)
Sections of Write the sections of your paper based on 11thweek 10%
the paper the classification / categorization diagram in (this component will
keeping with the goals of your survey be evaluated based
on the linking and
classification among
the papers)
Your Write your conclusions and future work 12th week 5% ( conclusions
conclusions clarity and your ideas)
Final Draft Complete the final draft of your paper 13th week 10% (formatting,
English, Clarity and
linking)
4% Plagiarism Check
Report
Seminar A brief 15 slides on your paper 14th & 15th 10%
week (based on
presentation and
Viva-voce)
TOTAL: 30 PERIODS
28
IF5191 ADVANCED DATABASES L T P C
3 0 0 3
OBJECTIVES:
To understand the design of databases.
To acquire knowledge on parallel and distributed databases and its applications.
To study the usage and applications of Object Oriented and Intelligent databases.
To understand the emerging databases like Mobile, XML, Cloud and Big Data
29
REFERENCES:
1. C.J.Date, A.Kannan, S.Swamynathan, An Introduction to Database Systems,
Eighth Edition, Pearson Education, 2006.
2. Carlo Zaniolo, Stefano Ceri, Christos Faloutsos, Richard T.Snodgrass,
V.S.Subrahmanian, Roberto Zicari, Advanced Database Systems, Morgan
Kaufmann publishers,2006.
3. Henry F Korth, Abraham Silberschatz, S. Sudharshan, Database System Concepts,
Sixth Edition, McGraw Hill, 2011.
4. R. Elmasri, S.B. Navathe, Fundamentals of Database Systems, Sixth Edition,
Pearson Education/Addison Wesley, 2010.
5. Vijay Kumar, Mobile Database Systems, John Wiley & Sons, 2006.
30
UNIT IV LOGIC PROGRAMMING 9
Relational Logic Programming- Syntax- Basics- Facts- Rules- Syntax- Operational
Semantics- Relational logic programs and SQL operations- Logic Programming- Syntax-
Operational semantics- Data Structures-Meta-tools: Backtracking optimization (cuts); Unify;
Meta-circular interpreters- The Origins of Prolog- Elements- of Prolog-Deficiencies of Prolog-
Applications of Logic Programming.
REFERENCES:
1. Ghezzi, Programming Languages, 3rd Edition, John Wiley, 2008
2. John C. Mitchell, Concepts in Programming Languages, Cambridge University
Press, 2004.
3. Louden, Programming Languages, 3rd Edition, 2012.
4. Ravi Sethi, Programming Languages: Concepts and Constructs, 2nd Edition,
Addison Wesley, 1996.
5. Robert .W. Sebesta, Concepts of Programming Languages, 10th Edition, Pearson
Education, 2002.
31
UNIT II IMAGE ENHANCEMENT AND RESTORATION 9
Image Transforms -Discrete and Fast Fourier Transform and Discrete Cosine Transform
,Spatial Domain - Gray level Transformations Histogram Processing Spatial Filtering
Smoothing and Sharpening. Frequency Domain: Filtering in Frequency Domain
Smoothing and Sharpening filters Homomorphic Filtering., Noise models, Constrained
and Unconstrained restoration models.
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of this course, a students should be able to:
Design and implement algorithms for image processing applications that
incorporates different concepts of medical Image Processing
Familiar with the use of MATLAB and its equivalent open source tools
Critically analyze different approaches to image processing applications
Explore the possibility of applying Image processing concepts in various
applications
REFERENCES:
1. Alasdair McAndrew, Introduction to Digital Image Processing with Matlab,
Cengage Learning 2011,India
2. Anil J Jain, Fundamentals of Digital Image Processing, PHI, 2006.
3. Kavyan Najarian and Robert Splerstor, Biomedical signals and Image
processing,CRC Taylor and Francis, New York, 2006
4. Rafael C.Gonzalez and Richard E.Woods, Digital Image Processing, Third
Edition, Pearson Education, 2008, New Delhi
5. S.Sridhar, Digital Image Processing, Oxford University Press, 2011
32
CP5091 WEB ENGINEERING L T P C
3 0 0 3
OBJECTIVES:
Understand the characteristics of web applications
Learn to Model web applications
Be aware of Systematic design methods
Be familiar with the testing techniques for web applications
UNIT I INTRODUCTION TO WEB ENGINEERING 9
Motivation, Categories of Web Applications, Characteristics of Web Applications.
Requirements of Engineering in Web Applications- Web Engineering-Components of Web
Engineering-Web Engineering Process-Communication-Planning.
33
OUTCOMES:
Upon completion of this course, the students should be able to:
Explain the characteristics of web applications.
Model web applications.
Design web applications.
Test web applications.
REFERENCES:
1. Chris Bates, Web Programming: Building Internet Applications, Third Edition, Wiley
India Edition, 2007.
2. Gerti Kappel, Birgit Proll, Web Engineering, John Wiley and Sons Ltd, 2006.
3. Guy W. Lecky-Thompson, Web Programming, Cengage Learning, 2008.
4. John Paul Mueller, Web Development with Microsoft Visual Studio 2005, Wiley
Dream tech, 2006.
5. Roger S. Pressman, David Lowe, Web Engineering, Tata McGraw Hill Publication,
2007.
OBJECTIVES:
To understand the concepts of virtualization and virtual machines
To gain expertise in server, network and storage virtualization.
To understand and deploy practical virtualization solutions and enterprise solutions
To gain knowledge on the concept of virtualization that is fundamental to cloud computing
To understand the various issues in cloud computing
To be able to set up a private cloud
To understand the security issues in the grid and the cloud environment
UNIT I VIRTUALIZATION 9
Basics of Virtual Machines - Process Virtual Machines System Virtual Machines Emulation
Interpretation Binary Translation - Taxonomy of Virtual Machines. Virtualization Management
Virtualization Hardware Maximization Architectures Virtualization Management Storage
Virtualization Network Virtualization
34
UNIT III CLOUD PLATFORM ARCHITECTURE 9
Cloud deployment models: public, private, hybrid, community Categories of cloud computing:
Everything as a service: Infrastructure, platform, software- A Generic Cloud Architecture Design
Layered cloud Architectural Development Virtualization Support and Disaster Recovery
Architectural Design Challenges - Public Cloud Platforms : GAE,AWS Inter-cloud Resource
Management
UNIT IV PROGRAMMING MODEL 9
Introduction to Hadoop Framework - Mapreduce, Input splitting, map and reduce functions,
specifying input and output parameters, configuring and running a job Developing Map Reduce
Applications - Design of Hadoop file system Setting up Hadoop Cluster - Cloud Software
Environments -Eucalyptus, Open Nebula, Open Stack, Nimbus
REFERENCES:
1. Danielle Ruest, Nelson Ruest, Virtualization: A Beginners Guide, McGraw-Hill Osborne
Media, 2009.
2. Jim Smith, Ravi Nair , "Virtual Machines: Versatile Platforms for Systems and Processes",
Elsevier/Morgan Kaufmann, 2005
3. John W.Rittinghouse and James F.Ransome, "Cloud Computing: Implementation,
Management, and Security", CRC Press, 2010.
4. Kai Hwang, Geoffrey C Fox, Jack G Dongarra, "Distributed and Cloud Computing, From
Parallel Processing to the Internet of Things", Morgan Kaufmann Publishers, 2012.
5. Tim Mather, Subra Kumaraswamy, and Shahed Latif ,"Cloud Security and Privacy", OReilly
Media, Inc.,2009.
6. Toby Velte, Anthony Velte, Robert Elsenpeter, "Cloud Computing, A Practical Approach",
McGraw-Hill Osborne Media, 2009.
7. Tom White, "Hadoop: The Definitive Guide", Yahoo Press, 2012.
35
MP5291 REAL TIME SYSTEMS L T P C
3 0 0 3
OBJECTIVES:
To learn real time operating system concepts, the associated issues & Techniques.
To understand design and synchronization problems in Real Time System.
To explore the concepts of real time databases.
To understand the evaluation techniques present in Real Time System.
36
REFERENCES:
1. C.M. Krishna, Kang G. Shin, Real-Time Systems, McGraw-Hill International Editions,
1997
2. Philip.A.Laplante, Real Time System Design and Analysis, Prentice Hall of India, 3rd
Edition, 2004
3. Rajib Mall, Real-time systems: theory and practice, Pearson Education, 2009
4. R.J.A Buhur, D.L Bailey, An Introduction to Real-Time Systems, Prentice Hall
International, 1999
5. Stuart Bennett, Real Time Computer Control-An Introduction, Prentice Hall of India,
1998
6. Allen Burns, Andy Wellings, Real Time Systems and Programming Languages,
Pearson Education, 2003.
37
UNIT IV HCI IN PERVASIVE COMPUTING 9
Prototype for Application Migration - Prototype for Multimodalities - HumanComputer
Interface in Pervasive Environments - HCI Service and Interaction Migration - Context-
Driven HCI Service Selection - Interaction Service Selection Overview - User Devices -
Service-Oriented Middleware Support - User History and Preference - Context Manager -
Local Service Matching - Global Combination - Effective Region - User Active Scope -
Service Combination Selection Algorithm
38
CP5002 PARALLEL PROGRAMMING PARADIGMS L T P C
3 0 0 3
OBJECTIVES:
To familiarize the issues in parallel computing.
To describe distributed memory programming using MPI.
To understand shared memory paradigm with Pthreads and with OpenMP.
To learn the GPU based parallel programming using OpenCL.
39
REFERENCES:
1. A. Munshi, B. Gaster, T. G. Mattson, J. Fung, and D. Ginsburg, OpenCL
programming guide, Addison Wesley, 2011
2. M. J. Quinn, Parallel programming in C with MPI and OpenMP, Tata McGraw Hill,
2003.
3. Peter S. Pacheco, An introduction to parallel programming, Morgan Kaufmann,
2011.
4. Rob Farber, CUDA application design and development, Morgan Haufmann, 2011.
5. W. Gropp, E. Lusk, and A. Skjellum, Using MPI: Portable parallel programming with
the message passing interface, Second Edition, MIT Press, 1999
L T P C
CP5094 INFORMATION RETRIEVAL TECHNIQUES
3 0 0 3
OBJECTIVES:
To understand the basics of information retrieval with pertinence to modeling, query
operations and indexing
To get an understanding of machine learning techniques for text classification and clustering.
To understand the various applications of information retrieval giving emphasis to multimedia
IR, web search
To understand the concepts of digital libraries
UNIT II MODELING 9
Taxonomy and Characterization of IR Models Boolean Model Vector Model - Term Weighting
Scoring and Ranking Language Models Set Theoretic Models - Probabilistic Models
Algebraic Models Structured Text Retrieval Models Models for Browsing
40
UNIT V SEARCHING THE WEB 9
Searching the Web Structure of the Web IR and web search Static and Dynamic Ranking
Web Crawling and Indexing Link Analysis - XML Retrieval Multimedia IR: Models and
Languages Indexing and Searching Parallel and Distributed IR Digital Libraries
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of this course, the students should be able to:
Build an Information Retrieval system using the available tools.
Identify and design the various components of an Information Retrieval system.
Apply machine learning techniques to text classification and clustering which is used for
efficient Information Retrieval.
Design an efficient search engine and analyze the Web content structure.
REFERENCES:
1. Christopher D. Manning, Prabhakar Raghavan, Hinrich Schutze, Introduction to
Information Retrieval, Cambridge University Press, First South Asian Edition, 2008.
2. Implementing and Evaluating Search Engines, The MIT Press, Cambridge,
Massachusetts London, England, 2010
3. Ricardo Baeza Yates, Berthier Ribeiro Neto, Modern Information Retrieval: The
concepts and Technology behind Search (ACM Press Books), Second Edition, 2011.
4. Stefan Buttcher, Charles L. A. Clarke, Gordon V. Cormack, Information Retrieval
UNIT II 8
Object-Oriented Paradigm -Design Principles. Data-Centered Software Architecture: Repository
Architecture, Blackboard Architecture. Hierarchical Architecture Main-Subroutine, Master-Slave,
Layered, Virtual Machine. Interaction-Oriented Software Architectures: Model-View-Controller
(MVC), Presentation-Abstraction-Control (PAC ).
41
UNIT III 9
Distributed Architecture: Client-Server, Middleware, Multi-tiers, Broker Architecture
MOM,CORBA Message Broker Architecture- Service-Oriented Architecture (SOA), SOAP, UDDI,
SOA Implementation in Web Services, Grid/cloud Service Computing. Heterogeneous
Architecture- Methodology of Architecture Decision, Quality Attributes.
UNIT IV 9
Architecture of User Interfaces containers, case study-web service. Product Line Architectures -
methodologies, processes and tools. Software Reuse and Product Lines -Product Line Analysis,
Design and implementation, configuration Models. Model Driven Architectures (MDA) why MDA-
Model transformation and software architecture, SOA and MDA. Eclipse modeling framework.
UNIT V 9
Aspect Oriented Architectures- AOP in UML,AOP tools, Architectural aspects and middleware
Selection of Architectures, Evaluation of Architecture Designs, Case Study: Online Computer
Vendor, order processing, manufacture &shipping inventory, supply chain cloud service
Management, semantic web services
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of this course, the students should be able to:
Understand the need of software architecture for sustainable dynamic systems.
Have a sound knowledge on design principles and to apply for large scale systems
Design architectures for distributed heterogeneous systems
Have good knowledge on service oriented and model driven architectures and the
aspect oriented architecture.
Have a working knowledge to develop appropriate architectures through various
case studies.
REFERENCES :
1. Essentials of software Architecture , Ion Gorton, Second Edition, Springer-verlag, 2011
2. Software Architecture Design Illuminated, Kai Qian Jones and Bartlett Publishers
Canada, 2010
42
UNIT I OVERVIEW OF PERFORMANCE EVALUATION 9
Need for Performance Evaluation in Computer Systems Overview of Performance Evaluation
Methods Introduction to Queuing Probability Review Generating Random Variables for
Simulation Sample Paths, Convergence and Averages Littles Law and other Operational
Laws Modification for Closed Systems.
REFERENCES:
1. K. S. Trivedi, Probability and Statistics with Reliability, Queueing and Computer Science
Applications, John Wiley and Sons, 2001.
2. Krishna Kant, Introduction to Computer System Performance Evaluation, McGraw-Hill,
1992.
3. Lieven Eeckhout, Computer Architecture Performance Evaluation Methods, Morgan and
Claypool Publishers, 2010.
4. Mor Harchol - Balter, Performance Modeling and Design of Computer Systems
Queueing Theory in Action, Cambridge University Press, 2013.
5. Paul J. Fortier and Howard E. Michel, Computer Systems Performance Evaluation and
Prediction, Elsevier, 2003.
6. Raj Jain, The Art of Computer Systems Performance Analysis: Techniques for
Experimental Design, Measurement, Simulation and Modeling, Wiley-Interscience, 1991.
43
CP5004 LANGUAGE TECHNOLOGIES L T P C
3 0 0 3
OBJECTIVES:
To learn the fundamentals of natural language processing
To appreciate the use of CFG and PCFG in NLP
To understand the role of semantics and pragmatics
UNIT I INTRODUCTION 9
Words - Regular Expressions and Automata - Words and Transducers - N-grams - Part-of-
Speech Tagging - Hidden Markov and Maximum Entropy Models.
UNIT II SPEECH 9
Speech Phonetics - Speech Synthesis - Automatic Speech Recognition - Speech
Recognition: - Advanced Topics - Computational Phonology.
UNIT V APPLICATIONS 9
Information Extraction - Question Answering and Summarization - Dialogue and
Conversational Agents - Machine Translation.
TOTAL :45 PERIODS
OUTCOMES:
Upon completion of this course, the students should be able to:
To tag a given text with basic Language features
To design an innovative application using NLP components
To implement a rule based system to tackle morphology/syntax of a language
To design a tag set to be used for statistical processing for real-time applications
To compare and contrast use of different statistical approaches for different types of
NLP applications.
REFERENCES:
1. Breck Baldwin, "Language Processing with Java and LingPipe Cookbook", Atlantic
Publisher, 2015.
2. Daniel Jurafsky, "Speech and Language Processing: An Introduction to Natural
Language Processing, Computational Linguistics and Speech", Pearson Publication,
2014.
3. Nitin Indurkhya and Fred J. Damerau, "Handbook of Natural Language Processing",
Second Edition, Chapman and Hall/CRC Press, 2010.
4. Richard M Reese, "Natural Language Processing with Java", OReilly Media, 2015.
5. Steven Bird, Ewan Klein and Edward Loper, -"Natural Language Processing with
Python", First Edition, OReilly Media, 2009.
44
CP5095 COMPUTER VISION LTPC
3 003
OBJECTIVES:
To review image processing techniques for computer vision.
To understand shape and region analysis.
To understand Hough Transform and its applications to detect lines, circles, ellipses.
To understand three-dimensional image analysis techniques.
To understand motion analysis.
To study some applications of computer vision algorithms.
UNIT I IMAGE PROCESSING FOUNDATIONS 9
Review of image processing techniques classical filtering operations thresholding techniques
edge detection techniques corner and interest point detection mathematical morphology
texture.
UNIT II SHAPES AND REGIONS 9
Binary shape analysis connectedness object labeling and counting size filtering distance
functions skeletons and thinning deformable shape analysis boundary tracking procedures
active contours shape models and shape recognition centroidal profiles handling occlusion
boundary length measures boundary descriptors chain codes Fourier descriptors region
descriptors moments.
UNIT III HOUGH TRANSFORM 9
Line detection Hough Transform (HT) for line detection foot-of-normal method line
localization line fitting RANSAC for straight line detection HT based circular object detection
accurate center location speed problem ellipse detection Case study: Human Iris location
hole detection generalized Hough Transform (GHT) spatial matched filtering GHT for
ellipse detection object location GHT for feature collation.
UNIT IV 3D VISION AND MOTION 9
Methods for 3D vision projection schemes shape from shading photometric stereo shape
from texture shape from focus active range finding surface representations point-based
representation volumetric representations 3D object recognition 3D reconstruction
introduction to motion triangulation bundle adjustment translational alignment parametric
motion spline-based motion optical flow layered motion.
UNIT V APPLICATIONS 9
Application: Photo album Face detection Face recognition Eigen faces Active appearance
and 3D shape models of faces Application: Surveillance foreground-background separation
particle filters Chamfer matching, tracking, and occlusion combining views from multiple
cameras human gait analysis Application: In-vehicle vision system: locating roadway road
markings identifying road signs locating pedestrians.
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of this course, the students should be able to
Implement fundamental image processing techniques required for computer vision.
Perform shape analysis.
Implement boundary tracking techniques.
Apply chain codes and other region descriptors.
Apply Hough Transform for line, circle, and ellipse detections.
Apply 3D vision techniques.
Implement motion related techniques.
Develop applications using computer vision techniques.
45
REFERENCES:
1. D. L. Baggio et al., Mastering OpenCV with Practical Computer Vision Projects, Packt
Publishing, 2012.
2. E. R. Davies, Computer & Machine Vision, Fourth Edition, Academic Press, 2012.
3. Jan Erik Solem, Programming Computer Vision with Python: Tools and algorithms for
analyzing images, O'Reilly Media, 2012.
4. Mark Nixon and Alberto S. Aquado, Feature Extraction & Image Processing for Computer
Vision, Third Edition, Academic Press, 2012.
5. R. Szeliski, Computer Vision: Algorithms and Applications, Springer 2011.
6. Simon J. D. Prince, Computer Vision: Models, Learning, and Inference, Cambridge
University Press, 2012.
46
UNIT V SPEECH SYNTHESIS 9
Attributes Formant Speech Synthesis Concatenative Speech Synthesis Prosodic
Modification of Speech Source-filter Models for Prosody Modification Evaluation of TTS
Systems.
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of this course, the students should be able to
Identify the various temporal, spectral and cepstral features required for identifying
speech units phoneme, syllable and word
Determine and apply Mel-frequency cepstral coefficients for processing all types of
signals
Justify the use of formant and concatenative approaches to speech synthesis
Identify the apt approach of speech synthesis depending on the language to be
processed
Determine the various encoding techniques for representing speech.
REFERENCES:
1. Joseph Mariani, Language and Speech Processing, Wiley, 2009.
2. Lawrence Rabiner and Biing-Hwang Juang, Fundamentals of Speech Recognition,
Prentice Hall Signal Processing Series, 1993.
3. Sadaoki Furui, Digital Speech Processing: Synthesis, and Recognition, Second
Edition, (Signal Processing and Communications), Marcel Dekker, 2000.
4. Thomas F.Quatieri, Discrete-Time Speech Signal Processing, Pearson Education,
2002.
5. Xuedong Huang, Alex Acero, Hsiao-Wuen Hon, Spoken Language Processing A
guide to Theory, Algorithm and System Development, Prentice Hall PTR, 2001.
47
UNIT III SYSTEM TEST CATEGORIES 10
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.
REFERENCES:
1. Software Testing And Quality Assurance-Theory and Practice, Kshirasagar Nak
Priyadarshi Tripathy, John Wiley & Sons Inc,2008
2. Software Quality Engineering: Testing, Quality Assurance, and Quantifiable
Improvement, Jeff Tian, John Wiley & Sons, Inc., Hoboken, New Jersey. 2005.
3. Software Quality Assurance - From Theory to Implementation, Daniel Galin,
Pearson Education Ltd UK, 2004
4. Software Quality Assurance, Milind Limaye, TMH ,New Delhi, 2011
48
CP5006 FORMAL MODELS OF SOFTWARE SYSTEMS L T P C
3 0 0 3
OBJECTIVES:
To understand the goals, complexity of software systems, the role of Specification
activities and qualities to control complexity.
To understand the fundamentals of abstraction and formal systems
To learn fundamentals of logic reasoning- Propositional Logic, temporal logic and
apply to models systems
To understand formal specification models based on set theory, calculus and
algebra and apply to a case study
To learn Z, Object Z and B Specification languages with case studies.
49
UNIT V FORMAL LANGUAGES 9
The Z Notation, abstractions in Z, Representational Abstraction, Types, Relations and
Functions, Sequences, Bags. Free Types-Schemas, Operational Abstraction -Operations
Schema Decorators, Generic Functions, Proving Properties from Z specifications,
Consistency of Operations. Additional Features in Z. Case Study: An Automated Billing
System. The Object-Z Specification Language- Basic Structure of an Object-Z,
Specification. Parameterized Class, Object-Orientation, composition of Operations-Parallel
Communication Operator, Nondeterministic Choice Operator, and Environment Enrichment.
The B-Method -Abstract Machine Notation (AMN), Structure of a B Specification, arrays,
statements. Structured Specifications, Case Study- A Ticketing System in a Parking.
REFERENCES:
1 Mathematical Logic for computer science ,second edition, M.Ben-Ari ,Springer,2003.
2 Logic in Computer Science- modeling and reasoning about systems, 2nd Edition,
Cambridge University Press, 2004.
3 Specification of Software Systems, V.S. Alagar, K. Periyasamy, David Grises and
Fred B Schneider, Springer Verlag London, 2011
4 The ways Z: Practical programming with formal methods, Jonathan Jacky,
Cambridge University Press,1996.
5 Using Z-Specification Refinement and Proof,Jim Woodcock and Jim Devies Prentice
Hall, 1996
6 Z: An introduction to formal methods, Second Edition, Antoi Diller, Wiley, 1994.
50
UNIT I EMBEDDED PROCESSORS 9
Embedded Computers - Characteristics of Embedded Computing Applications - Challenges in
Embedded Computing System Design - Embedded System Design Process- Formalism for
System Design - Structural Description - Behavioural Description - ARM Processor - Intel ATOM
Processor.
UNIT II EMBEDDED COMPUTING PLATFORM 9
CPU Bus Configuration - Memory Devices and Interfacing - Input/Output Devices and Interfacing -
System Design - Development and Debugging Emulator Simulator - JTAG Design Example
Alarm Clock - Analysis and Optimization of Performance - Power and Program Size.
UNIT III EMBEDDED NETWORK ENIVIRONMENT 9
Distributed Embedded Architecture - Hardware And Software Architectures - Networks for
Embedded Systems - I2C - CAN Bus - SHARC Link Supports Ethernet Myrinet Internet -
Network-based Design - Communication Analysis - System Performance Analysis - Hardware
Platform Design - Allocation and Scheduling - Design Example - Elevator Controller.
UNIT IV REAL-TIME CHARACTERISTICS 9
Clock Driven Approach - Weighted Round Robin Approach - Priority Driven Approach - Dynamic
versus Static Systems - Effective Release Times and Deadlines - Optimality of the Earliest
Deadline First (EDF) Algorithm - Challenges in Validating Timing Constraints in Priority Driven
Systems - Off-Line versus On-Line Scheduling.
UNIT V SYSTEM DESIGN TECHNIQUES 9
Design Methodologies - Requirement Analysis Specification - System Analysis and Architecture
Design - Quality Assurance - Design Examples - Telephone PBX - Ink jet printer - Personal Digital
Assistants - Set-Top Boxes.
TOTAL: 45 PERIODS
OUTCOME:
Upon completion of the course, the students should be able to
Understand different architectures of embedded processor, microcontroller and peripheral
devices. Interface memory and peripherals with embedded systems.
Work with embedded network environment.
Understand challenges in Real time operating systems.
Design and analyze applications on embedded systems.
REFERENCES:
1. Adrian McEwen, Hakim Cassimally, "Designing the Internet of Things" Wiley Publication, First
edition, 2013
2. Andrew N Sloss, D. Symes, C. Wright, Arm system developers guide, Morgan
Kauffman/Elsevier, 2006.
3. ArshdeepBahga, Vijay Madisetti, " Internet of Things: A Hands-on-Approach" VPT First
Edition, 2014
4. C. M. Krishna and K. G. Shin, Real-Time Systems , McGraw-Hill, 1997
5. Frank Vahid and Tony Givargis, Embedded System Design: A Unified Hardware/Software
Introduction, John Wiley & Sons.
6. Jane.W.S. Liu, Real-Time systems, Pearson Education Asia.
7. Michael J. Pont, Embedded C, Pearson Education , 2007.
8. Muhammad Ali Mazidi , SarmadNaimi , SepehrNaimi, "The AVR Microcontroller and
Embedded Systems: Using Assembly and C" Pearson Education, First edition, 2014
9. Steve Heath, Embedded SystemDesign , Elsevier, 2005
10. Wayne Wolf, Computers as Components:Principles of Embedded Computer System
Design, Elsevier, 2006.
51
CP5074 SOCIAL NETWORK ANALYSIS L T P C
3 0 0 3
OBJECTIVES:
To understand the components of the social network.
To model and visualize the social network.
To mine the users in the social network.
To understand the evolution of the social network.
To know the applications in real time systems.
UNIT I INTRODUCTION 9
Introduction to Web - Limitations of current Web Development of Semantic Web
Emergence of the Social Web Statistical Properties of Social Networks -Network analysis -
Development of Social Network Analysis - Key concepts and measures in network analysis -
Discussion networks - Blogs and online communities - Web-based networks.
UNIT IV EVOLUTION 9
Evolution in Social Networks Framework - Tracing Smoothly Evolving Communities -
Models and Algorithms for Social Influence Analysis - Influence Related Statistics - Social
Similarity and Influence - Influence Maximization in Viral Marketing - Algorithms and
Systems for Expert Location in Social Networks - Expert Location without Graph Constraints
- with Score Propagation Expert Team Formation - Link Prediction in Social Networks -
Feature based Link Prediction Bayesian Probabilistic Models - Probabilistic Relational
Models.
UNIT V APPLICATIONS 9
A Learning Based Approach for Real Time Emotion Classification of Tweets, A New
Linguistic Approach to Assess the Opinion of Users in Social Network Environments,
Explaining Scientific and Technical Emergence Forecasting, Social Network Analysis for
Biometric Template Protection
TOTAL : 45 PERIODS
52
OUTCOMES:
Upon Completion of the course, the students should be able to
Work on the internals components of the social network
Model and visualize the social network
Mine the behaviour of the users in the social network
Predict the possible next outcome of the social network
Apply social network in real time applications
REFERENCES:
1. Ajith Abraham, Aboul Ella Hassanien, Vclav Snel, Computational Social
Network Analysis: Trends, Tools and Research Advances, Springer, 2012
2. Borko Furht, Handbook of Social Network Technologies and Applications,
Springer, 1st edition, 2011
3. Charu C. Aggarwal, Social Network Data Analytics, Springer; 2014
4. Giles, Mark Smith, John Yen, Advances in Social Network Mining and Analysis,
Springer, 2010.
5. Guandong Xu , Yanchun Zhang and Lin Li, Web Mining and Social Networking
Techniques and applications, Springer, 1st edition, 2012
6. Peter Mika, Social Networks and the Semantic Web, Springer, 1st edition, 2007.
7. Przemyslaw Kazienko, Nitesh Chawla,Applications of Social Media and Social
Network Analysis, Springer,2015
UNIT I INTRODUCTION 9
Introduction to algorithm - Newton's method - optimization algorithm - No-Free-Lunch
Theorems - Nature-Inspired Mataheuristics -Analysis of Algorithms -Nature Inspires
Algorithms -Parameter tuning and parameter control.
53
UNIT IV SWARM OPTIMIZATION AND FIREFLY ALGORITHM 9
Swarm intelligence - PSO algorithm - accelerated PSO - implementation - convergence
analysis - binary PSO - The Firefly algorithm - algorithm analysis - implementation - varients-
Ant colony optimization toward feature selection.
54
UNIT II EARLY AND LOOP OPTIMIZATIONS 9
Importance of Code Optimization Early Optimizations: Constant-Expression Evaluation -
Scalar Replacement of Aggregates - Algebraic Simplifications and Re-association - Value
Numbering - Copy Propagation - Sparse Conditional Constant Propagation. Redundancy
Elimination: Common - Subexpression Elimination - Loop-Invariant Code Motion - Partial-
Redundancy Elimination - Redundancy Elimination and Reassociation - Code Hoisting.
Loop Optimizations: Induction Variable Optimizations - Unnecessary Bounds Checking
Elimination.
UNIT III PROCEDURE OPTIMIZATION AND SCHEDULING 9
Procedure Optimizations: Tail-Call Optimization and Tail-Recursion Elimination - Procedure
Integration - In-Line Expansion - Leaf-Routine Optimization and Shrink Wrapping. Code
Scheduling: Instruction Scheduling - Speculative Loads and Boosting - Speculative
Scheduling - Software Pipelining - Trace Scheduling - Percolation Scheduling. Control-Flow
and Low-Level Optimizations : Unreachable-Code Elimination - Straightening - If
Simplifications - Loop Simplifications -Loop Inversion Un-switching - Branch Optimizations
- Tail Merging or Cross Jumping - Conditional Moves - Dead-Code Elimination - Branch
Prediction - Machine Idioms and Instruction Combining.
UNIT IV INTER PROCEDURAL OPTIMIZATION 9
Symbol table Runtime Support - Interprocedural Analysis and Optimization:
Interprocedural Control Flow Analysis - The Call Graph - Interprocedural Data-Flow Analysis
- Interprocedural Constant Propagation - Interprocedural Alias Analysis - Interprocedural
Optimizations - Interprocedural Register Allocation - Aggregation of Global References.
55
CP5009 DATA VISUALIZATION TECHNIQUES L T P C
3 0 0 3
OBJECTIVES:
To develop skills to both design and critique visualizations.
To introduce visual perception and core skills for visual analysis.
To understand visualization for time-series analysis.
To understand visualization for ranking analysis.
To understand visualization for deviation analysis.
To understand visualization for distribution analysis.
To understand visualization for correlation analysis.
To understand visualization for multivariate analysis.
To understand issues and best practices in information dashboard design.
56
REFERENCES:
1. Ben Fry, "Visualizing data: Exploring and explaining data with the processing
environment", O'Reilly, 2008.
2. Edward R. Tufte, "The visual display of quantitative information", Second Edition,
Graphics Press, 2001.
3. Evan Stubbs, "The value of business analytics: Identifying the path to profitability",
Wiley, 2011.
4. Gert H. N. Laursen and Jesper Thorlund, "Business Analytics for Managers: Taking
business intelligence beyond reporting", Wiley, 2010.
5. Nathan Yau, "Data Points: Visualization that means something", Wiley, 2013.
6. Stephen Few, "Information dashboard design: Displaying data for at-a-glance
monitoring", second edition, Analytics Press, 2013.
7. Stephen Few, "Now you see it: Simple Visualization techniques for quantitative
analysis", Analytics Press, 2009.
8. Tamara Munzner, Visualization Analysis and Design, AK Peters Visualization Series,
CRC Press, Nov. 2014
57
UNIT V APPLICATION DEVELOPMENT WITH FPGAS 9
Case Studies of FPGA Applications System on a Programmable Chip (SoPC) Designs.
TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, the students should be able to:
Identify the need for reconfigurable architectures.
Discuss the architecture of FPGAs.
Point out the salient features of different reconfigurable architectures.
Build basic modules using any HDL.
Develop applications using any HDL and appropriate tools.
Design and build an SoPC for a particular application.
REFERENCES:
1. Christophe Bobda, Introduction to Reconfigurable Computing Architectures, Algorithms
and Applications, Springer, 2010.
2. Maya B. Gokhale and Paul S. Graham, Reconfigurable Computing: Accelerating
Computation with Field-Programmable Gate Arrays, Springer, 2005.
3. FPGA Frontiers: New Applications in Reconfigurable Computing, 2017, Nicole Hemsoth,
Timothy Prickett Morgan, Next Platform.
4. Reconfigurable Computing: From FPGAs to Hardware/Software Codesign 2011 Edition
by Joao Cardoso (Editor), Michael Hbne, Springer
5. Scott Hauck and Andre Dehon (Eds.), Reconfigurable Computing The Theory and
Practice of FPGA-Based Computation, Elsevier / Morgan Kaufmann, 2008.
UNIT I INTRODUCTION 5
Introduction to mobile applications Embedded systems - Market and business drivers
for mobile applications Publishing and delivery of mobile applications Requirements
gathering and validation for mobile applications.
58
UNIT III ADVANCED DESIGN 8
Designing applications with multimedia and web access capabilities Integration with
GPS and social media networking applications Accessing applications hosted in a cloud
computing environment Design patterns for mobile applications.
UNIT IV ANDROID 12
Introduction Establishing the development environment Android architecture
Activities and views Interacting with UI Persisting data using SQLite Packaging and
deployment Interaction with server side applications Using Google Maps, GPS and
Wifi Integration with social media applications.
UNIT V IOS 12
Introduction to Objective C iOS features UI implementation Touch frameworks
Data persistence using Core Data and SQLite Location aware applications using Core
Location and Map Kit Integrating calendar and address book with social media
application Using Wifi - iPhone marketplace.
TOTAL :45 PERIODS
OUTCOMES:
Upon completion of the course, the students should be able to:
Describe the requirements for mobile applications.
Explain the challenges in mobile application design and development.
Develop design for mobile applications for specific requirements.
Implement the design using Android SDK.
Implement the design using Objective C and iOS.
Deploy mobile applications in Android and iPhone marketplace for distribution.
REFERENCES:
1. Charlie Collins, Michael Galpin and Matthias Kappler, Android in Practice,
DreamTech, 2012.
2. David Mark, Jack Nutting, Jeff LaMarche and Frederic Olsson, Beginning iOS 6
Development: Exploring the iOS SDK, Apress, 2013.
3. http://developer.android.com/develop/index.html.
4. James Dovey and Ash Furrow, Beginning Objective C, Apress, 2012.
5. Jeff McWherter and Scott Gowell, "Professional Mobile Application Development",
Wrox,2012.
6. Reto Meier, PProfessional android Development, Wiley-India Edition, 2012.
59
UNIT I INTRODUCTION AND FUNDAMENTALS 9
Fundamentals of genes , genomics , molecular evolution genomic technologies
beginning of bioinformatics - genetic data sequence data formats secondary database
examples data retrival systems genome browsers.
OUTCOMES:
Upon Completion of the course, the students should be able to:
Deploy the genomics technologies in Bioinformatics.
Able to distinct efficient algorithm and issues.
Deploy the replication and molecular clocks in bioinformatics.
Work on assemble genomes and sequences.
Use the Microarray technologies for genome expression.
REFERENCES:
1. Ion Mandoiu and Alexander Zelikovsky , Computational Methods for Next Generation
Sequencing Data Analysis Wiley series 2016.
2. Istvan Miklos,Renyi Institutue, Introduction to algorithms in bioinformatics,Springer
2016
3. Philip Compeau and Pavel pevzner, Bioinformatics Algorithms: An Active
Learning Approach Second edition volume I , Cousera, 2015.
4. Supratim Choudhuri, Bioinformatics For Beginners, Elsevier, 2014.
60
CP5076 INFORMATION STORAGE MANAGEMENT L T P C
3 0 0 3
OBJECTIVES:
To understand the storage architecture and available technologies.
To learn to establish & manage datacenter.
To learn security aspects of storage & data center.
UNIT I STORAGE TECHNOLOGY 9
Review data creation and the amount of data being created and understand the value of
data to a business, challenges in data storage and data management, Solutions available
for data storage, Core elements of a data center infrastructure, role of each element in
supporting business activities.
UNIT II STORAGE SYSTEMS ARCHITECTURE 9
Hardware and software components of the host environment, Key protocols and concepts
used by each component ,Physical and logical components of a connectivity environment
,Major physical components of a disk drive and their function, logical constructs of a
physical disk, access characteristics, and performance Implications, Concept of RAID and
its components, Different RAID levels and their suitability for different application
environments: RAID 0, RAID 1, RAID 3, RAID 4, RAID 5, RAID 0+1, RAID 1+0, RAID 6,
Compare and contrast integrated and modular storage systems ,Iligh-level architecture and
working of an intelligent storage system.
TOTAL : 45 PERIODS
61
OUTCOMES:
Upon l completion of this course, a student should be able to:
Select from various storage technologies to suit for required application.
Apply security measures to safeguard storage & farm.
Analyse QoS on Storage.
REFERENCES:
1. EMC Corporation, "Information Storage and Management: Storing, Managing, and
Protecting Digital Information", Wiley, India, 2010
2. Marc Farley, Building Storage Networks, Tata McGraw Hill ,Osborne, 2001.
3. Robert Spalding, Storage Networks: The Complete Reference, Tata McGraw Hill ,
Osborne, 2003.
62