M.tech. (Final Syllabi With SUBJECT CODES)

(Form : MP 06 (i)
(Clause 9.5.1)
Motilal Nehru National Institute of Technology Allahabad

Course Structure of M.Tech. (Computer Science & Engineering)
I - Semester :
Subject Mid Sem. End Sem. Total
Subject Name L T P Credits TA
Code Exam. Exam Marks
CS2101 Research
4 4 20 20 60 100
Methodology
CS2151 Programming
6 4 50 00 50 100
Lab-1
CS21XX Elective – I 4 4 20 20 60 100
CS21XX Elective – II 4 4 20 20 60 100
CS21XX Elective – III 4 4 20 20 60 100
Total Credits = 20
II - Semester :
Subject Mid Sem. End Sem. Total
Subject Name L T P Credits TA
CS2251 Programming 6 4 50 00 50 100

Lab.-2
CS2201 Advance 4 4 20 20 60 100

Computer
Architecture
CS22XX Elective – IV 4 4 20 20 60 100
CS22XX Elective – V 4 4 20 20 60 100
CS22XX Elective – VI 4 4 20 20 60 100
Total Credits = 20
III – Semester
Subject Subject Name Credits Total Marks
Code
CS2391 Thesis/Project 16 100
CS2392 Colloquim/Term Project 4 100
Total Credits = 20
IV – Semester

Code
Total Credits = 20
Note : The distribution of thesis evaluation marks will be as follows :
1. Supervisor(s) evaluation component : 60%
2. Oral Board evaluation component : 40%

(Form : MP 06 (i)
(Clause 9.5.1)
Course Structure of M.Tech. (Software Engineering)

I - Semester :
Sunject Subject Name L T P Credits TA Mid Sem. End Sem. Total

CS2101 Research 4 4 20 20 60 100

Methodology
CS2151 Programming 6 4 50 00 50 100

Lab-1
CS21XX Elective – I 4 20 20 60 100
CS21XX Elective – II 4 20 20 60 100
CS21XX Elective – III 4 20 20 60 100
Total Credits = 20
II - Semester :
Subject Subject Name L T P Credits TA Mid Sem. End Sem. Total
CS2251 Programming 6 4 50 00 50 100

Lab.-2
CS2202 Cloud Computing 4 4 20 20 60 100
CS22XX Elective – IV 4 4 20 20 60 100
CS22XX Elective – V 4 4 20 20 60 100
CS22XX Elective – VI 4 4 20 20 60 100

Total Credits = 20
III – Semester
Code
Total Credits = 20
IV – Semester
Code
Total Credits = 20

(Form : MP 06 (i)
(Clause 9.5.1)
Course Structure of M.Tech. (Information Security)

I - Semester :
CS2101 Research 4 4 20 20 60 100

Methdology
CS2151 Programming 6 4 50 00 50 100

Lab-1
CS21XX Elective – I 6 4 20 20 60 100
CS21XX Elective – II 4 4 20 20 60 100
CS21XX Elective – III 4 4 20 20 60 100
Total Credits = 20
II - Semester :
CS2251 Programming 6 4 50 00 50 100

Lab.-2
CS2203 Secure E- 4 4 20 20 60 100

Commerce
CS22XX Elective – IV 4 4 20 20 60 100
CS22XX Elective – V 4 4 20 20 60 100
CS22XX Elective – VI 4 4 20 20 60 100
Total Credits = 20
III – Semester
Code
Total Credits = 20
IV – Semester
Code
Total Credits = 20

M.Tech. (Computer Science & Engineering)
Elective I
CS2111 Advanced Computer Network
CS2112 Distributed Computing
CS2113 Digital Image Processing
Elective II
CS2114 Advanced Data Modeling
CS2115 Genetic Algorithm & Neural Network
Elective III
CS2116 Real Time & Embedded Systems
CS2117 Data Mining
Elective IV
CS2211 Advanced Algorithms

CS2212 Wireless Sensor Network
CS2213 Fault Tolerant Systems
Elective V
CS2214 Semantic Web

CS2215 Formal Methods
CS2216 Object Oriented Modeling & Design
Elective VI
CS2217 Advanced Database

CS2218 Wireless and Mobile Networks
M.Tech. (Software Engineering)
Elective I

CS2112 Distributed Computing
CS2113 Digital Image Processing
Elective II
CS2115 Genetic Algorithm & Neural Network
CS2119 Decision Support System
Elective III
CS2117 Data Mining
CS2121 Software Metrics, Maintenance & Testing
CS2122 Optimization Techniques
Elective IV
CS2219 Service Oriented Architecture
CS2220 Social Network Analysis
Elective V
CS2214 Semantic Web
CS2222 Information Retrieval
Elective VI
CS2217 Advance Database
CS2223 Advance Software Engineering
M.Tech. (Information Security)
Elective I

CS2113 Multimedia Systems
Elective II
CS2120 Intellectual Property Rights
Elective III
CS2123 Cryptography
CS2124 Network Security
CS2125 Advance Computer Architecture
Elective IV

CS2221 Cloud Computing
Elective V
CS2214 Semantic Web
CS2222 Information Retrieval
Elective VI
CS2217 Advanced Database
CS2224 Forensics & Cyber Crime
Research Methdology
Syllabus
Syllabus for research methodology
Unit I- Objectives and types of research: Motivation and objectives,types of research – Descriptive
vs. Analytical, Applied vs. Fundamental, Quantitative vs. Qualitative, Conceptual vs. Empirical.
Unit II- Research Formulation: Defining and formulating the research problem, selecting the
problem, necessity of defining the problem, importance of literature review in defining a problem,
critical literature review, identifying gap areas from literature review.
Unit III- Experimental design and simulation analysis: Measurement techniques and tools, types of
workloads, workload characterization and techniuqes, porgram execution monitors and accounting
logs, probability theory and statistics, simulation, queuing models.
Unit IV- Report writing and presentation: Structure and components of scientific reports, types of
report, different steps in the preparation of report, layout, structure and language of typical reports,
lllustrations and tables, bibliography, referencing and footnotes, Planning and preparation of
presentation, use of visual aids in presentation.
Unit V- Application of results and ethics: Ethical issues, intellectual property rights and patent law,
trade related aspects of Intellectual Property Rights, reproduction of published material, plagiarism,
citation and acknowledgement.
References:
1. Anthony, M., Graziano, A.M. and Raulin, M.L., 2009. Research Methods: A Process of Inquiry,
Allyn and Bacon.
2. Raj Jain, "The Art of Computer Systems Performance Analysis: Techniques for Experimental
Design, Measurement, Simulation, and Modeling," Wiley- Interscience, New York, NY, April
1991
3. Coley, S.M. and Scheinberg, C. A., 1990, "Proposal Writing", Sage Publications.
4. Day, R.A., 1992.How to Write and Publish a Scientific Paper, Cambridge University Press.
5. Fink, A., 2009. Conducting Research Literature Reviews: From the Internet to Paper. Sage
Publications.
Programming Lab.-1 (6P)
Syllabus
Objectives
To make student learn and polish his/her basics of programming with emphasis on solving real time
problems. Focus is to make the student learn object oriented way of solving problems. The lab will
cover programming of important data structures. Further it also covers programming using system call
interface to write efficient programs.
Outline
UNIT-1: (a) Programming Data Structures using C++: Array, Stack, Queues, Linked Lists, Trees,
Graphs, Searching, Sorting, Binary Trees, AVL trees, Red-Black Trees, B-Trees, Hashing, Dynamic
programming, Backtracking, Branch and Bound.
(b) Learning the use of STL (Standard Template Library) to write generic programs.
UNIT-2: Programming of Inter Process Communication (IPC) either by Posix or System V: Fork, Pipe,
FIFO, Message Queues, Semaphore, Shared Memory
References
1. Fundamentals of Data Structures in C++, by Elis Horowitz, Sartaz Sahni, Dinesh Mehta, Galgotia
2. Data Structures, Algorithms and Applications in C++, by Sartaz Sahni, Mcgraw Hill
3. UNIX Network Programming, Vol.2 (Inter Process Communication), by Richard Stevens, Pearson
4. Resources on WWW for Linux System Programming.
Advanced Computer Networks (4L)
Syllabus
Course Description
The area of computer networking is undergoing rapid development; it’s important to focus not only on what
computer networks are today, but also on why and how they are designed the way they are. The aim of this
course is to provide a sound conceptual foundation to computer networks and its design principles. The focus of
the course is on the protocols, algorithms and tools needed to support the development and delivery of advanced
network services over networks.
Course Outline (to be covered in 40 lectures)

UNIT-1: Review of Networking Concepts. (10)
MAC layer issues, Ethernet 802.3, ARP, IP addressing and Subnetting, NAT and PAT, Variable Length Subnet
Masking, CIDR
UNIT-2: End to End protocols (10)
TCP connection establishment and termination, Sliding window concepts, other issues: wraparound, silly
window syndrome, Nagle’s algorithm, adaptive retransmission, TCP extensions. Congestion and flow control,
Queuing theory, TCP flavors: Tahoe, Reno, New-Reno, TCP-SACK, TCP-RED and TCP-Vegas.Transport
protocol for real time (RTP), Quality of service: Integrated Services, Differentiated services
UNIT-3: Routing and Multicast. (10)
Structure of internet: Autonomous systems, Intra-domain routing: OSPF and RIP, Inter-domain routing: BGP.
Multicasting: Group Management (IGMP), Internet scale multicasting: Reverse path broadcast, MOSPF,
DVMPRP, PIM.
UNIT-4 : Peer to peer and overlay networks. (10)
Concept of overlays, Unstructured Overlays: Gnutella, Concepts of Distributed Hash Table, Structured Overlays:
Chord, CAN, Pastry.
Text Books
1. Computer Networks: A Systems Approach, by Peterson and Davie, 5th Ed. Morgan Kauffman, 2011
2. Computer Networking: Top Down Approach, by Kurose and Ross, 6 th Ed. Pearson, 2011
Reading List
1. V. Paxson. "End-to-end Internet packet dynamics," in IEEE/ACM Transactions on Networking, Vol 7, No 3, June,
1999.
2. W. Stevens, "TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms," RFC2001 .
3. K. Fall and S. Floyd, "Simulation-based comparison of Tahoe, Reno, and SACK TCP," Computer Communication
Review, vol. 26, pp. 5--21, July 1996.
4. L. Brakmo and L. Peterson, "TCP Vegas: End-to-End Congestion Avoidance on a Global Internet," IEEE Journal
on Selected Areas in Communications, 13(8), October 1995, 1465--1480.
5. Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service
for Internet applications.
6. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer
systems.
Distributed Computing (4L)
Syllabus
Course Description
The course covers the fundamental concepts and practical aspects of distributed systems. All major
software development activities are distributed in nature. The applications are inherently getting
distributed. Thus, there is a need to get an insight into Distributed Computing Environment. Students
shall be able to define and identify issues in design of distributed applications. After having undergone
the course, the student shall be able to understand the issues related with design and development of
distributed applications.
Unit I: Introduction to Distributed Computing - Fundamentals, Goals, System Models, Network &
Internetworking, Architectures, Challenges (4)
Unit II: Distributed Communication Paradigms - Message Passing, Remote Procedure Call,
Distributed Shared Memory, Stream Oriented Communication, Multicast Communication (8)
Unit III: Distributed Resource Management - Synchronization, Resource Management, Process

Management (8)
Unit IV: Distributed File Management - Consistency & Replication, Fault-Tolerance, Distributed File
System, Naming (10)
Unit V: Latest Research Paper Topics (10)

Text Books
1. Distributed Operating System – P.K.Sinha, PHI, 2008
2. High performance Cluster computing, Vol. 1, Rajkumar Buyya, Pearson Education, 2008
3. Distributed Systems – Concepts and Design, George Coulouris, Jean Dollimore, Tim Kindberg
and Gordon Blair, Addison Wesley, 2011
Genetic Algorithm and Neural Network (4L)
Syllabus
Course Description
This course introduces various optimization techniques, chiefly genetic algorithms, to optimize
solutions for wide varieties of problems which involve numerical optimization or requires scheduling
under constraints. This course also offers a tinge of Artificial Neural Networks and the concepts of
pareto optimality.
1. An overview of Combinatorial Optimization. Introduction to Genetic Algorithms and theoretical

foundations of Genetic Algorithms. [10]
2. Genetic Algorithms in Optimization, phenomenon of natural evolution, Simulated Annealing and Non-
dominated sorting.[8]
3. Artificial Neural Networks. [7]
4. Industrial and scientific applications of Genetic Algorithms and Evolutionary Computing. [10]
5. Latest Research Paper Topics. [5]
Text Books
1. “Genetic Algorithm in Search, Optimization & Machine Learning”, by David E. Goldberg, Pearson
Education.
2. Introduction to Evolutionary Computing”, by Eiben and Smith, Springer.
3. “An Introduction to Genetic Algorithms”, by M. Mitchell, MIT Press.

Digital Image Processing (4L)
Syllabus
________________________________________________________
Objective
Advanced Digital Image Processing investigates algorithms and techniques for a variety of imaging
applications. Introduction to Digital Image Processing focuses on basic image processing methods.
___________________________________________________________________________
Outline
UNIT I:
Introduction: Examples of fields that use digital image processing, fundamental steps in digital image
processing, components of image processing system.. Digital Image Fundamentals: A simple image
formation model, image sampling and quantization, basic relationships between pixels .Image
enhancement in the spatial domain : Basic gray-level transformation, histogram processing,
enhancement using arithmetic and logic operators, basic spatial filtering, smoothing and sharpening
spatial filters, combining the spatial enhancement methods.
UNIT II:
Image restoration : A model of the image degradation/restoration process, noise models, restoration in
the presence of noise–only spatial filtering, Weiner filtering, constrained least squares filtering,
geometric transforms; Introduction to the Fourier transform and the frequency domain, estimating the
degradation function. Color Image Processing
UNIT III:
Image Compression : Fundamentals, image compression models, error-free compression, lossy

predictive coding, image compression standards.Morphological Image Processing : Preliminaries,
dilation, erosion, open and closing, hit or miss transformation, basic morphologic algorithms.
UNIT IV
Image Segmentation : Detection of discontinuous, edge linking and boundary detection, thresholding,
region–based segmentation. Object Recognition : Patterns and patterns classes, recognition based on
decision–theoretic methods, matching, optimum statistical classifiers, neural networks, structural
methods – matching shape numbers, string matching.
UNIT V:
Latest Research Paper Topics: To be decided by subject coordinator
REFERENCES
1. Digital Image Processing using MATLAB, Gonzales/ Woods/ Eddins, 2nd edition,
Gatesmark Publishing, ISBN 9780982085400.
2. Fundamentals of Digital Image Processing, A K Jain, Prentice Hall, 1989, ISBN 0-13-336165-9.
3 Digital Image Processing Rafael C. González, Richard Richard Eugene Woods, Steven L.
Data Mining (4L)
Syllabus
Course Description
The course's objective is to learn data exploration, and discovery of knowledge using data mining
techniques from different types of data. This also focuses on the using statistical methods for data analysis.

1. Linear regression; review of linear regression, Cross-validation and model selection.
2. Data mining with one and two variables; Kernel smoothing, splines and others; Nonparametric
estimation of density function; Nonparametric estimation of regression curve; Data mining with
multi-variables;; Single-index models, Additive models, Other semi-parametric models.
3. Linear parametric methods: linear correlation analysis, linear regression models; Nonlinear
parametric methods: logistic models, generalized linear regression models.
4. Nonparametric methods: wavelet methods, spline-smoothing, kernel smoothing.
5. Data preprocessing; Mining frequent patterns; Mining frequent patterns, Association, and
correlation; Classification and prediction; cluster Analysis.
6. Application and Trends in Data Mining.
Text Books
1. The Elements of Statistical Learning: Data Mining, Inference, and Prediction , Trevor Hastie, Robert
Tibshirani, Jerome Friedman, Springer-Verlag, 2001.
2. Data Mining: Concepts and Techniques, Jiawei Han and Micheline Kamber, Morgan Kaufmann
Publishers, Third Edition, 2011.
3. Introduction to Data Mining, Pang-Ning Tan, Michael Steinbach and Vipin Kumar, Morgan Kaufmann
Publishers, Second Edition.
4. Data Mining: Practical Machine Learning Tools and Techniques, Ian H. Witten, Eibe Frank, Mark A.
Hall, Morgan Kaufmann Publishers, Third Edition.
Software Metrics, Maintenance & Testing (4L)
Syllabus
Course Description
This course introduces the basics of software measurement theory, software metrics and models for
measurement in software engineering. It also covers the concepts of quality assurance and ethics
required for upholding a quality software. This course also offers a prologue to various types of testing
techniques.
1. Fundamentals of Measurements in Software Engineering, Process & Product Metrics, Software Products
Attributes and Process Management. [11]
2. Software Quality, ISO-CMM-CMMi, Product and Process Quality, SQA, Clean Room Process and Six-
Sigma Principles. [7]
3. Software maintenance, Updates-Upgrades-Patches-Versions, Error Reporting, Customer Support,
Software Reliability-Warranty-Guarantee and Software Documentation. [10]
4. Software Testing Fundamentals, Test Case Design and its Optimization, Different Levels of Testing and
Testing Tools. [9]
Text Books
1. “Metrics and Models in Software Quality Engineering”, by S. H. Kan, Addison-Wesley Professional.
2. “The Art of Software Testing”, by GJ Myers, Wiley.
3. “Software Engineering: A Practitioner’s Approach”, by Roger S. Pressman, McGraw-Hill Higher

Education.
4. “Software Engineering”, by Ian Sommerville, Addison-Wesley.

Decision Support Systems (4L)
Syllabus
Course Description
The objectives of the course includes, introduction of decision support systems, their development
approaches and utilization of DSS capacities to support different types of decisions. The course focuses on
how models, data, and other analytical tools decision makers might use in the reasoned consideration of the
options available to them.

1. Introduction to decision support systems; DSS components; decision making and DSS;
2. DSS software and hardware; developing DSS;
3. DSS models; types of DSS; group DSS; executive information systems;
4. Data mining; artificial intelligence and expert systems;
5. Systems integration and the future of DSS;
Text Books
1. Decision Support Systems For Business Intelligence, V.L. Sauter, John Wiley & Sons, 2011.
2. Decision Support & Business Intelligent Systems, Turban and Efrain , Pearson Education.
3. Decision Support & data Warehouse Systems, Mallach, G. Efrem, Tata McGraw-Hill.
4. Decision Support System for effective planning, Theierauff, J Robert, Prentice Hall.
Advanced Database Systems (4L)
Syllabus
Course Description
Database systems used to provide convenient access to disk-resident data through efficient query processing,
indexing structures, concurrency control, and recovery. This traditional view of database systems has
recently changed due to the emergence of a wide variety of new applications and technologies that include
web applications, sensor networks, location-based services, multimedia, and context-aware systems, and
new hardware that include map flash storage, map reduce environments, and sensor devices. Students will
understand and master relevant concepts and techniques of current databases and processing based on
databases. They will understand the potentials, limitations, and risks inherent in assembling, combining, and
processing huge amounts of heterogeneous data in globally interconnected environments. They will be able
to design such databases and connectivity and relevant methods for combining and enriching data, and work
with concrete examples of such data collection/processing.

1. Modeling data; Recap: ER Model, UML, semantic networks, logic;
2. XML databases; Object relational databases;
3. Temporal databases; Queries and relational operators; Temporal indexes: persistent B-trees;
4. Spatial databases and spatio-temporal databases; Representing space / spatial entities; Queries
and relational operators;
Recap: Spatial indexes: B+ trees, kd trees, R-trees; Spatial Database Management Systems
(SDBMS);
5. Spatio-temporal queries; map reduce /cloud; Data management on cloud;

6. Defining and combining heterogeneous databases, schemas and ontologies;
Text Books
1. A reading list of research papers relevant to above topics may be given to students.
2. Database System Concepts, Avi Silberschatz, Hank Korth, and S.Sudarshan. 6th Ed. McGraw Hill,
2010.
3. Principles of Data and Knowledge Base Systems, Volume 1, J.D. Ullman, Computer Science Press.
4. Spatial Database Systems: Design, Implementation and Project Management; edited by Albert K. W.
Yeung, George Brent Hall.
Optimization Techniques (4L)
Syllabus
______________________________________________________________________________
Objective
This course is intended to provide students with a knowledge that can make them appreciate the use of
various research operations tools in decision making in organizations. At the end of the Course
participants are expected to demonstrate a working knowledge of the various OR /OM tools in making
decisions as well as being able to formulate organizational problems into OR models forseeking
optimal solutions.
_________________________________________________________________________________
Outline
UNIT I
Linear Models: Formulation and Examples, Basic Polyhedral Theory- Convexity, Extreme points,
Supporting hyperplanesetc, Simplex Algorithm- Algebraic and Geometrical approaches, Artificial
variable technique, Duality Theory: Fundamental theorem, Dual simplex method, Primal-dual method,
Sensitivity Analysis, Bounded Variable L.P.P. Transportation Problems: Models and Algorithms.
UNIT II
Network Flows: Shortest path Problem, Max-Flow problem and Min-cost Flow problem, Dynamic
Programming: Principle of optimality, Discrete and continuous models.
UNIT III
Integer Programming: All integer and mixed integer programming problems, cutting planes and branch
and bound algorithms, introduction to the ideas of NP-completeness, travelling salesman and other
related problems.
UNIT IV
Non-linear Programming: General constrained mathematical programming problems, Kuhn-Tucker-

Lagrangian necessary and sufficient conditions, interior point methods, standard algorithms like
feasible direction and gradient projections convergence of the methods, convex programming
problems, quadratic programming
Unit-V
Recent Research Topics from Papers
REFERENCES
1- . G.L. Nemhauser and L.A. Wolsey: Integer and Combinational Optimization.
2- HamdyA.Taha Operations Research 8 edition
3- R.P.Sen Operations Research,Algorithms and Application

Network Security (4L)
Syllabus
Course Description
The course covers the Security Principles and practices include Information System Security
Principles, Information System Security Management, Operating System and Applications Security.
The Topic includes Network Security Fundamentals, Security protocols, security devises,
Cryptographic algorithms and protocols, Communication security and threats and its assessment,
testing and evaluations.

1. Introduction to Information System Security Management , Key security principles, Risk
Management( 6)
2. Operating System and Applications Security: Web browser security, E-mail Security, Web
security, DNS Security, Linux Security, Windows security (10)
3. Network Security: Network Security Protocol, Wireless security, Network Security architecture
(10)
4. Secure Communication: Cryptography protocols and Algorithms. (8)
5. Steganography, digital watermarking (2)
6. Security threats and Response: Intrusion detection system, Intrusion prevention system,
Firewall, honey pots and incidence response. (4)
Text Books
1. Eric Cole, “Network Security Bible”, John Wiley & Sons, 31-Mar-2011.
2. William Stallings, “Cryptography and Network Security”: Principles and Standards”, Prentice
Hall India, 5th Edition, 2007.
3. Charlie Kaufman, Radia Perlman and Mike Speciner, “Network Security: Private
Communication in a public world”, Prentice Hall India, 2nd Edition, 2011.
Multimedia systems (4L)
Syllabus
Course Description
In this course students will study multimedia technologies, both standard and newly developed. Course
coverage will include both theoretical understanding of multimedia technologies, and hands-on
experience with applications and hardware. Topics may include perception, cognition, and
communication issues, multimedia interface standards, multimedia evaluation, digitizing and
manipulating images, voice, and video materials. Courses namely Computer graphics, Operating
System and Computer Networks are prerequisites. A lab course is associated with it to strengthen the
concepts.
Course Outline (To be covered in 40 lectures)

1. Introduction, Multimedia Information, Multimedia Objects, Convergence of Computer,
Communication and Entertainment products, Digital representation (6)
2. Multimedia hardware, Memory & storage devices, Communication devices, Multimedia
software's, presentation tools, tools for object generations, video, sound, image capturing,
authoring tools, card and page based authoring tools (6)
3. Introduction to Text, hypertext & hypermedia, Sound, MIDI, Digital Audio concepts, audio file
formats Sampling Variables, Loss less compression of sound, Audio Capture. (6)
4. Introduction to video& images :Multiple monitors, bitmaps, Vector drawing, Image format
conversion, image compression, JPEG Compression, image & video file formats, animation,
animation file formats. Video representation, Video Compression, color models, MPEG
standards, Video Streaming on net, Video on demand. (6)
5. Introduction to multimedia communications. multimedia over I.P, multimedia Over ATM
Networks, multimedia Data Base, content based retrieval in Digital libraries, multimedia over
wireless networks. Serial port programming and interrupts (6)
6. Latest Research topics (10)
Text Books
1. Fundamental of Multimedia by Li and Drew PHI
2. Principle of Multimedia by Rajan Parekh TMH
3. Multimedia, Making it Work by Tay Vaughan TMH
4. Multimedia communication Fred Hallsal Pearson Education
Cryptography (4L)
Syllabus
Course Description
The course covers the introduction and overview of cryptography, Symmetric key algorithm,
Asymmetric key algorithm, Mathematical foundation of cryptography, Message integrity, message
authentication and authentication protocols. This course also includes Digital Signature Mechanism and
Advanced topics of Cryptography.

1. Introduction: History and overview of cryptography, Probability and randomized algorithms,
Number Theory.
2. Basic symmetric-key encryption: One time pad and stream ciphers, Block ciphers, Attacks on
block ciphers. AES, DES and other symmetric algorithms (9)
3. Public key cryptography: Arithmetic modulo primes, Cryptography using arithmetic modulo
primes, Arithmetic modulo composites, RSA.
4. Message integrity and authentication protocols: definition and applications, Collision resistant
hashing, authenticated encryption: security against active attacks, Digital Signature.
5. Advanced Topics -, ECC, DNA cryptography, quantum cryptography, Digital Watermarking

and Steganography etc.
Text Books
1. Introduction to Modern Cryptography by J. Katz and Y. Lindell.

2. Handbook of Applied Cryptography by A. Menezes, P. Van Oorschot, S. Vanstone
3. Cryptography and Network Security: Principles and Practice – William Stallings
Advance Computer Architecture (4L)
Syllabus
Course Description
This course enables us to understand the more efficient architectures, and makes us understand the
impact of parallelism over simple Von Neumann Architecture. It also gives idea of multi processor,
multi core architectures, as well threading in processor and their simulation environments.
Prerequisites: Digital Logic, Computer Architecture and Organization
Course Outline (40 lectures)
1. Review of Computer Organization and Architecture, RISC-CISC architecture, Instruction Set Principles
and Examples, Memory addressing modes. [10]
2. Advance Pipelining and Instruction level parallelism, Hardware and Software technique for ILP,
Dynamic Instruction Scheduling. [7]
3. Memory Hierarchy, Cache design issues, Virtual memory addressing, memory protection mechanisms,
Multiprocessor memory architecture. [9]
4. Multi Core Architectures: Multi processor systems and interconnection networks, Software and
Hardware multithreading, Case studies. [9]
5. Simulators in Computer Architecture, And Latest Research Paper Topics. [5]
Text Books
1. ACM SIGARCH Computer Architecture News.
2. The WWW Computer Architecture page http://www.cs.wisc.edu/arch.
3. Hennessy J. L., D. Patterson, Computer Architecture – A quantitative Approach, Morgan Kuffman (5/e),
2011.
4. K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, programmability, McGraw Hill

2001.
Advanced Algorithms (4L)
Syllabus
Objective
. Students will develop the necessary skills from both a theoretical perspective as well as applying their
knowledge on various problem sets. Particularly, the course objectives: Develop mathematical skills for
algorithm design, analysis, evaluation and computational cost; Develop the skills to design and
implement efficient programming solutions to various problems;
Outline
UNIT 1 Overview of Divide and Conquer, Greedy and Dynamic Programming strategies.
Basic search and traversal techniques for graphs, Backtracking, Branch and Bound. Point
location Convex hulls and Voronoi diagrams
UNIT II Advanced Algorithms for Graph and Combinatorial Optimization Problems, Shortest
path problems: Single source SP problem, SP tree, Ford’s labelling method, labelling and
scanning method, efficient scanning orders – topological order for acyclic networks, shortest
first search for non-negative networks (Dijkstra), BFS search for general networks, correctness
and analysis of the algorithms;
UNIT III Flows in Networks: Basic concepts, maxflow-mincut theorem, Ford and Fulkerson
augmenting path method, integral flow theorem, maximum capacity augmentation, Edmond-
Karp method, Dinic’s method and its analysis, String processing: String searching and Pattern
matching,
UNIT IV Approximation algorithms for vertex cover, set cover, TSP, knapsack, bin packing
subset- sum problem etc. simple lower bound results.NP-completeness: Informal concepts of
deterministic and nondeterministic algorithms, P and NP, NP-completeness, statement of
Cook’s theorem, some standard NP-complete problems, approximation algorithms.
UNIT V: Latest Research Paper Topics: To be decided by subject coordinator
References:
1- Introduction to Algorithms, third edition

By Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
2- Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne
Wireless Sensor Network (4L)
Syllabus
Course Description
The course covers the fundamental concepts and practical aspects of wireless sensor networks. The
topics include, basic architectural frameworks, including the key building blocks required for
constructing large-scale, energy-efficient sensor networks. The challenges and approaches pertaining to
local and global management strategies are covered – this includes topics on power management,
sensor node localization, time synchronization, and security.

1. Introduction, Revising Physics, Co-ordinate Geometry, Trigonometry, and Graph Theory (6)
2. Architectural framework, Sensing Parameters, Medium Access Control (8)
3. Deployment Issues, Localization, Naming, and Power Management (9)
4. Time Synchronization, Data Aggregation and Routing Issues, Simulator Examples (9)
5. Security Issues (4)
6. Sensor Network Application Case Studies. (4)
Text Books
1. Algorithms for Sensor and Ad Hoc Networks, Advanced Lectures, Lecture Notes in
Computer Science 4621, Editors Dorothea Wagner and Roger Wattenhofer, 2007
2. Fundamentals of Wireless Sensor Networks: Theory and Practice Waltenegus Dargie,
Christian Poellabauer John Wiley & Sons, 2010
3. Ad Hoc and Sensor Networks: Theory and Applications Carlos De Morais Cordeiro,
Dharma Prakash Agrawal World Scientific, 2011
Formal Methods (4L)
Syllabus
Course Description
Formal methods are about rigorous verification of systems. That is, techniques that can help bring about
better confidence in the systems getting developed and used, beyond what pure testing can achieve. This
confidence is brought about, essentially, by analysis in terms of mathematics and logics. This course will provide
the knowledge of some important tools and techniques that have been developed for this purpose, their
foundations (i.e. how and why they work), and their applications to some concrete case studies (protocols and
programs).
1. Formal Specification and Verification of Concurrent and Reactive Systems (10)
2. Formal Specification and Verification of Mobile/Dynamic Systems (10)
3. Model Checking: CTL, LTL (10)
4. Other Miscellaneous Topics: Petri Nets / Stochastic Process Algebra / Probabilistic Automata etc. (10)
Text Books
1. Communication and Concurrency by Robin Milner. Prentice Hall, 1989.

2. Communicating and mobile systems: the π-calculus by Robin Milner. Cambridge University Press 1999.
3. Reactive Systems: Modeling, Specification and Verification, by Luca Aceto .Cambridge University
Press, 2007
4. Logic in Computer Science: Modelling and reasoning about systems 2nd edition, by Michael R A Huth
& Mark D Ryan, Cambridge University Press, 2004.
5. "Model Checking" by E. M. Clarke, O. Grumberg, and D. Peled MIT Press, 2000.
Semantic Web (4L)
Syllabus
Course Description
This course discusses fundamental concepts of information structure, representation, presentation,
as well as information exchange on the World Wide Web. It gives students knowledge of how
semantics of the Web information as well as its metadata is formed, structured and
represented/presented, and how the Web semantics is acquired and organized so that machines can
understand information and assist human being to make better use of the Web information. It gives
and understanding of languages for semantic web, specification of a conceptualization, and
reasoning with ontologies.

1. Introduction to Semantic Web Vision; Metadata and XML Schema.
2. RDF, RDF Schema.
3. Introduction to description logics, Reasoning with description logics.
4. Ontology; Ontology building methodologies.
5. Ontology Languages for the Semantic Web, From RDFS to OWL, OWL, Reasoning with OWL.
Text Books
1. A First Step towards the Semantic Web by Wei Song and Min Zhang, Higher Education Press, 2004.
2. A Semantic Web Primer, Gregoris Antoniou & Frank Van Harmlen, The MIT Press, second edition.
3. The Language of First-Order Logic, Jon Barwise & John Etchemendy, Cambridge University Press,
Third edition.
4. Practical RDF, Powers S., O’Reilly Associates, Inc. Sebastopol, CA, USA 2003.
5. Foundations of Semantic Web Technologies, Pascal Hitzler, Markus Kroetzsch and Sebastian Rudolph,
Chapman & Hall, 2009.
6. The Description Logic Handbook: Theory, Implementation and Applications, Franz Baader, Diego
Calvanese, Deborah McGuinness, Daniele Nardi and Peter Patel-Schneider, Cambridge University Press,
2003.
7. Explorers Guide to the Semantic Web, Thomas Passin, Manning, 2004.
Wireless and Mobile Networks (4L)
Syllabus
Course Description
This course will cover the area of mobile and wireless networking, looking at the unique network
protocol challenges and opportunities presented by wireless communication and host or router mobility.
Although the course will touch on some of the important physical layer properties of wireless
communications, the focus will be on network protocols above the physical layer, with an emphasis on the
media access control, network, and transport protocol layers.

1. Wireless medium access control (MAC) protocols, including MACA, MACAW, and IEEE 802.11. (8)
2. Routing techniques for mobile nodes in the Internet, particularly Mobile IP. Network Mobility (8)
3. Routing techniques in multi-hop wireless ad hoc networks. (8)
4. Effects of mobility and wireless transmissions on reliable transport protocols such as TCP. (8)
5. Application layer for mobile networks. Mobile P2P networks. Context aware mobile networking (8)
Text Books
1. Mobile Communications 2nd Edition by Jochen Schiller, Pearson 2010
2. Ad-hoc Networking by Charles Perkins, Pearson , 2008

Advanced Software Engineering (4L)
Syllabus
Course Description
The course covers the fundamental concepts and practical aspects of software engineering. For assessing
the cost and quality of software under development, measurement of various activities becomes a key
factor. Also major software development activities are component based and distributed in nature. The
applications are inherently getting distributed. Thus, there is a need to get an insight into software
quality, reliability and versioning.
Unit I: Measurements Theory - Fundamentals of measurement, Scope of Software metrics (4)

Unit II: Component Based Development (6)
Unit III: Product & Quality Metrics (6)
Unit IV: Software Quality Assurance (6)
UNIT V: Software Reliability (4)
Unit VI: Distributed Software Design, Nightly/Weekly Builds, Versioning (4)
Unit VII: Latest Research Paper Topics (10)
Text Books
1. Metrics & Models in Software Quality Engineering, S. Kan, Addison-Wesley, 2002
2. Software Engineering: A Practitioner’s Approach, Roger S Pressman, Mc-Graw Hill, 2010
3. Component-Based Software Engineering: Putting the Pieces Together, George T. Heineman,

William T.Councill, Addison-Wesley Professional, 2001
4. Software Engineering: Theory and Practice, Shari Lawrence Pfleeger, Pearson Education India,
2008
Information Retrieval (4L)
Syllabus
Course Description
The course focuses on the basic concepts and methods of information retrieval including capturing,
representing, storing, organizing, and retrieving unstructured or loosely structured information.
Students will learn how effective information search and retrieval is interrelated with the
organization and description of information to be retrieved. Learning the process of indexing and
retrieving text documents. Information retrieval is a critical aspect of Web search engines. This
course will examine the design, implementation, and evaluation of information retrieval systems,
such as Web search engines, as well as new and emerging technologies to build the next generation
of intelligent and personalized search tools and Web information systems.

1. Introduction to information retrieval, Information Retrieval Models; Basic Tokenizing,
Indexing, and Implementation of Vector-Space Retrieval, Performance metrics.
2. Text Representation Models; Query Operations and Languages.
3. Web Search; Search engines; spidering; metacrawlers; directed spidering; link analysis; Social
Networks.
4. Text Categorization; Text Classification; Applications to information filtering and
organization.
5. Language-Model Based Retrieval; Using naive Bayes text classification for ad hoc retrieval.
Improved smoothing for document retrieval.
Text Books
1. Introduction to Information Retrieval, Christopher Manning, Prabhakar Raghavan and Hinrich

Schutze, Cambridge University Press. 2008.
2. Search Engines: Information Retrieval in Practice, W. B. Croft, D. Metzler, and T. Strohman,

Pearson Education, 2009.
3. Modern Information Retrieval, Ricardo Baeza-Yates and Berthier Ribeiro-Neto, Addison-Wesley

Professional; Second edition, 2011.
4. Mining the Web: Discovering Knowledge from Hypertext Data, Soumen Chakrabarti, Morgan-
Kaufmann Publishers, 2003.
5. Managing Gigabytes: Compressing and Indexing Documents and Images, Ian H. Witten, Alistair
Moffat, and Timothy C. Bell, Morgan Kaufmann, Second Edition, 2013.
Forensics and Cyber Crime (4L)
Syllabus
Course Description
The course covers the fundamental concepts of cyber crime and cyber laws to mitigate and prevent
those crimes. The topics include Computer forensics, e-mail forensics, evidence collection,
preservation and investigation using various forensics tools. This course also contains IT laws and
introduction and types of cyber crimes including types of security threats and attacks and its
jurisdiction.

1. Introduction to cyber forensics basics, Types of cyber crime and cyber laws (6)
2. Data and Evidence Recovery, Deleted file recovery, recovery Tools, Forensics Tools (8)
3. Introduction to IT laws and Cyber Crimes, Security Attacks (9)
4. Digital Evidence collection, preservation and investigation (7)
5. Cyber Security, Hardware based security, Software base Security, Incidence response. (6)
6. Methodologies of forensics: Case Studies. (4)
Text Books
1. Amelia Phillips , Bill nelson, Guide to Computer Forensics and Investigations,

2009, Course Technology, Cengage Learning.
2. Eoghan Casey, Digital Evidence and Computer Crime, Third Edition: Forensic
Science, Computers, and the Internet, Elsevier, 2011.
3. Chuck Easttom and Jeff Taylor , Computer Crime, Investigation, and the
Law ,2010 Technology, Cengage Learning.
Cloud Computing (4L)
Syllabus
Course Description
Shortening of product development lifecycle coupled with alignment of the user needs in a shared
manner paved way for cloud computing. It addresses the issues like scalability, large scale data,
high performance computing, automation, response time, rapid prototyping, and rapid time to
production. This effectively addresses the ever shortening cycle of obsolescence, heterogeneity and
rapid changes in requirements.
Unit1: Introduction to distributed and cluster computing, Basics of the emerging cloud
computing paradigm, Cloud Benefits (10)
Unit 2: Virtualization concepts and types, KVM, VM Scheduling (8)
Unit 3: Disaster Recovery, Scaling (6)
Unit 4: Cloud security, Regulatory and compliance issues, VM Security Issues (6)
Unit 5: Latest Research Paper Topics (10)
Text Books
1. Cloud Computing, Michael Miller, Pearson, 2012
2. Cloud Computing: Implementation, Management, and Security, , John Ritting house and James
F.Ransome, CRC Press Taylor and Francis Group, 2009
3. www.linux-kvm.org
4. www.redhat.com/rhecm/rest-rhecm/jcr/repository/.../rh:pdfFile.pdf
Social Network Analysis (4L)
Syllabus
Course Description
This course introduces various techniques to analyse social relationships in terms of network theory,
consisting of nodes and ties between them. In the opening this course aims to introduce the data storage
terminology and file systems that store these networks. Passing through network structure and network
mining techniques this course culminates with latest research topics in the field of social network
analysis. In this course students will learn about the structure and evolution of networks while drawing
knowledge on their organisation, distribution, connection and segmentation.
1. Network data storage: Big Data, Big Tables, PAXOS and CASANDRA. [10]
2. Introduction to GFS: Google File System basics, File Hierarchy, Design and Performance, IBM’s
General Parallel File System. [10]
3. Graph Mining. [5]
4. Social Networks & Their Structural Properties, Study of real-world networks like Facebook, Twitter and
Google. [10]
Text Books
1. “Social Network Analysis: Methods and Applications”, by Stanley Wasserman and Katherine Faust,
Cambridge University Press.
2. “Models and Methods in Social Network Analysis”, by Peter J. Carrington, John Scott and Stanley
Wasserman, Cambridge University Press.
3. “Understanding Social Networks: Theories, Concepts, and Finding”, by Charles Kadushin, Oxford
University Press.
Service Oriented Architecture (4L)
Syllabus
Course Description
The course covers the fundamental concepts and practical aspects of Service Oriented Architecture. The
current software development and delivery model is service oriented in nature. The applications are
inherently getting distributed and shared by multiple clients. Thus, there is a need to get an insight into
service oriented architectures. Students shall be able to define and identify issues in design of service
oriented applications. After having undergone the course, the student shall be able to understand the
issues related with detailed design aspects and standards of SOA.

Unit I: SOA & Cloud Computing : Fundamentals, Technologies, Benefits, Challenges and basic
mechanisms associated with cloud computing, Delivery models - SAS, IAS & PAS, Common Cloud
deployment models and cloud characters, Security threats and mechanisms (06)
Unit II: Introduction and fundamental of SOA, Benefits and Goals, SOA Manifesto, SOA and
network management architecture, Service as web services, Discovery and publishing of web services,
Service roles, Service models, Description of services with WSDL, Messaging with SOAP (08)
Unit III: Exchange patterns of message, Service activity, Coordination, Composition, Types, Activation
and registration process, Business activities, Orchestration, Composition of heterogeneous web services
Choreography, Addressing, Reliable messaging, Correlation, Policies, Notification and eventing (10)
Unit IV: Security threats and mechanisms, Essential techniques, Patterns, Security architecture for
service oriented solutions, Infrastructure, Middleware, Multitenancy concepts (08)
Unit V: Latest Research Paper Topics (08)
Text Books
1. Service Oriented Architecture, Concepts Technology and Design, Thomas Erl, Pearson
Education, 2008
2. SOA in Practice: The Art of Distributed System Design, Nicolai M. Josuttis, O'Reilly, 2007
Intellectual Property Right (4L)
Syllabus
Course Description
The scope of this course to be covered includes: Intellectual property right issues, WIPO treaties,
copyright act 1957, patent act 1970 and trademark act 1999 and their registration and infringement
conditions.
1. Intellectual Property rights: Introduction to IP, Copyright, Related Rights, Trademarks

Geographical Indications, Industrial Design, Patents, WIPO Treaties (8).
2. Copyright Act, 1957: Basic definitions, Registration and Infringement of Copyright, Remedies
and Offences governed under the Copyright Act 1957. (8)
3. Patents Act, 1970: Basic definitions, inventions that can and cannot be patented in India, grant
and infringement, revocation of lapsed patents, miscellaneous rights and duties. (8)
4. Trademarks Act, 1999: Basic definitions (included amended definitions), items that can be
registered under Trademarks Act, registration conditions, duration of trademarks, (8).
5. Cases on intellectual property rights.(8)
Recommended Books & References

1. www.wipo.org
2. W. William Rodolph Cornish, , Intellectual Property: Patents, Copyright,
Trade Marks and Allied Rights, Sweet and Maxwell.
3. William Rodolph Cornish, Cases and materials on intellectual property,
Sweet & Maxwell, 2003 – Law.
4. David I. Bainbridge, Intellectual Property, Pearson Longman, 2006 –
Law.
Object-oriented Modeling and Design (4L)
Syllabus
Course Description
The objective of this course is to learn basic OO analysis and design skills through an elaborate case study.
To use the UML design diagrams and to apply the appropriate design patterns in application development.

UNIT I (10)
Introduction to OOAD – What is OOAD? – What is UML? What are the Unified process(UP) phases, Case
study – the NextGen POS system, Inception-Use case Modeling, Relating Use cases. Elaboration - Domain
Models, Finding conceptual classes and description classes, Associations, Attributes, Domain model refinement
– Finding conceptual class hierarchies, Aggregation and Composition, UML activity diagrams and modeling
UNIT II (10)
System sequence diagrams - Relationship between sequence diagrams and use cases Logical architecture and
UML package diagram, Logical architecture refinement, UML class diagrams, UML interaction diagrams
UNIT III (10)
GRASP: Designing objects with responsibilities – Creator, Information expert, Low Coupling, Controller, High
Cohesion, Designing for visibility, Applying GoF design patterns – adapter, singleton, factory and observer
patterns.
UNIT IV (10)
UML state diagrams and modeling - Operation contracts, Mapping design to code, UML
deployment and component diagrams.
Text Book
1.Craig Larman,"Applying UML and Patterns: An Introduction to object-oriented
Analysis and Design and iterative development”, Third Edition, Pearson Education,
2005
REFERENCES:
1. Mike O’Docherty, “Object-Oriented Analysis & Design: Understanding System
Development with UML 2.0”, John Wiley & Sons, 2005.
2. James W- Cooper, Addison-Wesley, “Java Design Patterns – A Tutorial”, 2000.
3. Micheal Blaha, James Rambaugh, “Object-Oriented Modeling and Design with UML”,
Second Edition, Prentice Hall of India Private Limited, 2007
4. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides,“Design patterns:
Elements of Reusable object-oriented software”, Addison-Wesley, 1995.
5. Object-Oriented Analysis and Design with Applications - Grady Booch et al, 3rd Edition, Pearson, 2007.
Advanced Data Modeling (4L)
Syllabus
Course Description
The objective of this course is to learn basic fundamental techniques of using various data models in
application development. In particular, the focus will be over various ways of developing computer
applications with different kinds of data models.

UNIT I (08)
What is data abstraction, Un-typed Systems, Types and Type Systems, Abstract Data Types, Specifying
Abstract Data Types, Language support for Abstract Data Types.
UNIT II (08)
What is data modeling, The History of Data Modeling , Data Modeling Fundamentals, Entity
Relationship Model, Enhanced Entity Relationship Models, UML, Physical Data Models.
UNIT III (08)

Mathematical Foundation of the Relational Model, Keys and Referential Integrity, Functional
dependencies and normalization, Relational Algebra, Relational Mappings.
UNIT IV (08)
Object Oriented Databases – Introduction, Weakness of RDBMS, Object Oriented Concepts Storing
Objects in Relational Databases, Next Generation Database Systems – Object Oriented Data models,
OODBMS Perspect – Issues in OODBMS, Advantages and Disadvantages of OODBMS, Object Oriented
Database Design, OODBMS Standards and Systems – Object Management Group, Object Database
Standard ODMG, Object Relational DBMS, Comparison of ORDBMS and OODBMS.
UNIT V (08)
XML Fundamentals, XML Schema and DTD document definitions, XSLT transformations and
programming, Parsing XML.
Text Books
1. Ramez Elmasri & Shamkant B.Navathe, “Fundamentals of Database Systems”, Sixth Edition , Pearson
Education , 2010.
2. Peter Rob and Corlos Coronel, “Database Systems – Design, Implementation and Management”,
Thompson Learning, Course Technology, 5th Edition, 2003.
3. Graeme Simsion & Graham Witt, “Data Modeling Essentials, Third Edition”, Morgan Kaufmann
4. David Hunter, Jeff Rafter, Joe Fawcett, and Eric van der Vlist “ Beginning XML Fourth Edition, Wrox
Publications.
5. A Silberschatz, H Korth, S Sudarshan, “Database System and Concepts ”, Fifth Edition, McGraw-Hill
Advance Data Structure and System Programming Lab (6P)
Syllabus
Objectives
To make student learn and polish his/her basics of programming with emphasis on solving real time
problems. Focus is to make the student learn object oriented way of solving problems. The lab will
cover programming of important data structures. Further it also covers programming using system call
interface to write efficient programs.
Outline
UNIT-1: (a) Programming Data Structures using C++: Array, Stack, Queues, Linked Lists, Trees,
Graphs, Searching, Sorting, Binary Trees, AVL trees, Red-Black Trees, B-Trees, Hashing, Dynamic
programming, Backtracking, Branch and Bound.
(b) Learning the use of STL (Standard Template Library) to write generic programs.
UNIT-2: Programming of Inter Process Communication (IPC) either by Posix or System V: Fork, Pipe,
FIFO, Message Queues, Semaphore, Shared Memory
References
5. Fundamentals of Data Structures in C++, by Elis Horowitz, Sartaz Sahni, Dinesh Mehta, Galgotia
6. Data Structures, Algorithms and Applications in C++, by Sartaz Sahni, Mcgraw Hill
7. UNIX Network Programming, Vol.2 (Inter Process Communication), by Richard Stevens, Pearson
8. Resources on WWW for Linux System Programming.
Advance Computer Architecture (4L)
Syllabus
Course Description
This course enables us to understand the more efficient architectures, and makes us understand the
impact of parallelism over simple Von Neumann Architecture. It also gives idea of multi processor,
multi core architectures, as well threading in processor and their simulation environments.
Prerequisites: Digital Logic, Computer Architecture and Organization
Course Outline (40 lectures)
1. Review of Computer Organization and Architecture, RISC-CISC architecture, Instruction Set Principles
and Examples, Memory addressing modes. [10]
2. Advance Pipelining and Instruction level parallelism, Hardware and Software technique for ILP,
Dynamic Instruction Scheduling. [7]
3. Memory Hierarchy, Cache design issues, Virtual memory addressing, memory protection mechanisms,
Multiprocessor memory architecture. [9]
4. Multi Core Architectures: Multi processor systems and interconnection networks, Software and
Hardware multithreading, Case studies. [9]
5. Simulators in Computer Architecture, And Latest Research Paper Topics. [5]
Text Books
1. ACM SIGARCH Computer Architecture News.

2. The WWW Computer Architecture page http://www.cs.wisc.edu/arch.
3. Hennessy J. L., D. Patterson, Computer Architecture – A quantitative Approach, Morgan Kuffman (5/e),
2011.
4. K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, programmability, McGraw Hill
2001.
Cloud Computing (4L)
Syllabus
Course Description
Shortening of product development lifecycle coupled with alignment of the user needs in a shared
manner paved way for cloud computing. It addresses the issues like scalability, large scale data,
high performance computing, automation, response time, rapid prototyping, and rapid time to
production. This effectively addresses the ever shortening cycle of obsolescence, heterogeneity and
rapid changes in requirements.
Unit1: Introduction to distributed and cluster computing, Basics of the emerging cloud
computing paradigm, Cloud Benefits (10)
Unit 2: Virtualization concepts and types, KVM, VM Scheduling (8)
Unit 3: Disaster Recovery, Scaling (6)
Unit 4: Cloud security, Regulatory and compliance issues, VM Security Issues (6)
Unit 5: Latest Research Paper Topics (10)
Text Books
1. Cloud Computing, Michael Miller, Pearson, 2012
2. Cloud Computing: Implementation, Management, and Security, , John Ritting house and James
F.Ransome, CRC Press Taylor and Francis Group, 2009
3. www.linux-kvm.org
4. www.redhat.com/rhecm/rest-rhecm/jcr/repository/.../rh:pdfFile.pdf
Secure E-Commerce (4L)
Syllabus
Course Description
The growth of the Internet continues to have a tremendous influence on business. Companies and
organizations of all types and sizes are rethinking their strategies and how they run their operations.
The course introduces students to a wide range of electronic commerce issues for marketers, as a
foundation for continual learning in the dynamic and secure e-commerce environment.
Course Outline (To be covered in 40 lectures)

1. Introduction to e-Commerce and Network Infrastructure for e-commerce. [6]
2. Basics of User Interface, Web Interface, Transaction Processing, Web 3.0, Game Theory [10]
3. E-commerce Models, e-Advertising & Marketing, Auctions [8]
4. Information Security foundations and E-commerce Security, Electronic Payment Systems,
Electronic Data Exchange, Internet Banking, Mobile Commerce [12]
5. Requirement Analysis of E-commerce Initiatives in different domains [4]
Text Books
1. Introduction to E-commerce by Jeffrey F. Rayport & Bernard J. Jaworski
2. Effortless E-commerce with PHP and MYSQL by Larry Ullman

3. E-Commerce- Strategy technologies and Applications by David Whiteley
4. E-Commerce-Concepts, Models & Strategies by C.S.V. Murthy
5. E-Commerce by Laudon
Programming Lab. -2
Syllabus
Outline
Module1:
Sockets programming; client/server; peer-to-peer; Internet addressing; TCP sockets; UDP sockets; raw sockets.
Finger, DNS, HTTP, and ping clients and servers
Internetwork setup: network topology, wireless internetworking,
Packet Sniffers: Network protocol analyzers, traffic generation.
Introduction to Network Simulation: NS-2, OMNET++
Module 2:
1. HTML/CSS Basics ;
2. PHP ; Introduction, Basics, Data types, Operators, Flow control, Arrays, Array functions, Strings and Regular
expressions, Generators, OOP in PHP -- Classes, Objects, Constructors and Destructors, Access
Modifiers, Methods, Inheritance, Error and Exceptional Handling , File Handling, PEAR, Security
2. Databases; MySQL ; query, transactions
3. I/O, JSON, XML, SESSIONS; Reading from and Writing to files, parsing XML and JSON data, Creating
and Accessing Webservices, Simulating user Login and Logout.
4. Javascript; Syntax Overview, DOM Manipulation, eval, closures, objects, AJAX
5. jQuery; Selectors, DOM Manipulation with jQuery, AJAX with jQuery, Plugins; Other Javascript
Frameworks;
6. The ZEND Framework; Other PHP Frameworks;
7. Server Administration, Virtual Host Setup, Eclipse IDE, XAMPP, Linux
8. Web 2.0; Overview of the technologies involved in building today’s web applications
Text Books
1. W. R. Stevens, UNIX Network Programming, Prentice Hall
2. Beginning PHP5, Apache, and MySQL Web Development,Elizabeth Naramore, Jason Gerner , Yann Le
Scouarnec, Jeremy Stolz, Michael K. Glass, Wrox, 2 edition.
3. PHP for the Web, Larry Ullman, Peachpit Press, Fourth Edition, 2011
4. Programming PHP, Creating Dynamic Web Pages, Kevin Tatroe, Peter MacIntyre, Rasmus Lerdorf,
O'Reilly Media, 3rd Edition, 2013
Fault Tolerant Systems (4L)
Syllabus
Objectives
It covers the concepts of Fault-Tolerant System Design including Reliability, Dependability,
Maintainability, Redundancy, Error Detection, Damage Confinement, and Error Recovery.
Prerequisites: Probability Models.
Syllabus
Unit 1: Basic concepts of Reliability: Failures and faults, Reliability and failure rate, Relation between
reliability & mean time between failure, Maintainability & Availability, reliability of series and parallel
systems, modeling of faults, Mathematical Modeling: random variable, Conditional probability,
markov chain, queuing theory.
Unit 2: Fault Tolerant Design-I: Basic concepts – static, dynamic hybrid, and self purging redundancy,
Sift-out Modular Redundancy (SMR), triple modular redundancy, 5MR reconfiguration, use of error
correcting codes.
Unit 3: Fault Tolerant Design-II: Time redundancy, software redundancy, fail-soft operation, examples
of practical fault tolerant systems.
Unit 4: Information Redundancy, data Replication, Algorithm- Based fault Tolerance, Network
Topologies for Fault Tolerant System, fault- Tolerant routing.
Unit 5: Fault tolerance Testing, Exception – handling, Software Reliability Models, Checkpoints, fault
detection in cryptographic Systems.
References
1. I. koren and C.M. Krishna, fault Tolerant Systems, Morgan- Kaufman 2007.
2. M.L. Shooman, reliability of Computer Systems and networks: fault Tolerance, Analysis, and design, Wiley,
2002, ISBN 0-471-29342-3.
3. D.P. Siewiorek and r.S.Swarz, reliable Computer Systems: design and Evalution, A. K. peters, 1998.
4. Introduction to probability Models by Sheldon M. Ross, Elsevier publication 2010.
REAL-TIME & EMBEDDED SYSTEMS (4L)
Syllabus
Objectives
To make student learn and polish his/her basics of real time & embedded systems with emphasis on
solving real time & embedded problems. Focus is to make the student learn how real time systems
behave and how they are useful for time critical application. Further it also covers hardware description
of embedded systems.
Outline
UNIT-1: Introduction: Applications, different type of real-time systems, reference models. Real-
time Scheduling: Scheduling hierarchies commonly used scheduling approaches, Priority driven
scheduling of periodic tasks.
Unit-2: Scheduling of aperiodic and sporadic tasks: Deferrable server, sporadic servers, constant
utilization, total utilization and weighted fair queue servers, slack stealing approaches.
Unit-3: Resource access control: priority inherited protocol, protocol priority ceiling protocol,
slack based ceiling protocol, multiprocessor priority ceiling protocol. Weakly hard real-time
systems Imprecise computing and (M, K ) Constraints systems.
Unit-4: Embedded System: introduction and applications, design constraints & challenges,
Embedded system Architecture, Introduction to 8051 Microcontroller, block diagram, Addressing
modes, I/O programming.
Unit-5: 8051 Counter / Timer programming, 8051 serial communications, Interfacing, 8051
Interrupts handling.
References
1. Real-time systems by Jane W. S Liu, Pearson education.
2. Foundation of real-time Computing: resource management, Edited by Andrew M.,Tilboge Gray from
Kluwer academic Publisher London.
3. The 8051 Microcontroller And Embedded Systems Using Assembly And C by Mazidi, Pearson education.
4. Embedded System by Raj Kamal, TMH publication.
5. Resources on WWW for Real Time System.

M.tech. (Final Syllabi With SUBJECT CODES)

Uploaded by

Document Information

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

M.tech. (Final Syllabi With SUBJECT CODES)

Uploaded by

Copyright:

Available Formats

(Form : MP 06 (i)

Motilal Nehru National Institute of Technology Allahabad

CS21XX Elective – I 4 4 20 20 60 100

CS21XX Elective – II 4 4 20 20 60 100

CS21XX Elective – III 4 4 20 20 60 100

CS2251 Programming 6 4 50 00 50 100

CS2201 Advance 4 4 20 20 60 100

CS22XX Elective – IV 4 4 20 20 60 100

CS22XX Elective – V 4 4 20 20 60 100

CS22XX Elective – VI 4 4 20 20 60 100

CS2391 Thesis/Project 16 100

CS2392 Colloquim/Term Project 4 100

Subject Subject Name Credits Total Marks

CS2491 Thesis/Project 20 100

Note : The distribution of thesis evaluation marks will be as follows :

1. Supervisor(s) evaluation component : 60%

2. Oral Board evaluation component : 40%

Motilal Nehru National Institute of Technology Allahabad

Course Structure of M.Tech. (Software Engineering)

Sunject Subject Name L T P Credits TA Mid Sem. End Sem. Total

CS2101 Research 4 4 20 20 60 100

CS2151 Programming 6 4 50 00 50 100

CS21XX Elective – I 4 20 20 60 100

CS21XX Elective – II 4 20 20 60 100

CS21XX Elective – III 4 20 20 60 100

CS2251 Programming 6 4 50 00 50 100

CS2202 Cloud Computing 4 4 20 20 60 100

CS22XX Elective – IV 4 4 20 20 60 100

CS22XX Elective – V 4 4 20 20 60 100

CS22XX Elective – VI 4 4 20 20 60 100

CS2391 Thesis/Project 16 100

CS2392 Colloquim/Term Project 4 100

CS2491 Thesis/Project 20 100

Note : The distribution of thesis evaluation marks will be as follows :

1. Supervisor(s) evaluation component : 60%

2. Oral Board evaluation component : 40%

Motilal Nehru National Institute of Technology Allahabad

Course Structure of M.Tech. (Information Security)

CS2101 Research 4 4 20 20 60 100

CS2151 Programming 6 4 50 00 50 100

CS21XX Elective – I 6 4 20 20 60 100

CS21XX Elective – II 4 4 20 20 60 100

CS21XX Elective – III 4 4 20 20 60 100

CS2251 Programming 6 4 50 00 50 100

CS2203 Secure E- 4 4 20 20 60 100

CS22XX Elective – IV 4 4 20 20 60 100

CS22XX Elective – V 4 4 20 20 60 100

CS22XX Elective – VI 4 4 20 20 60 100

CS2391 Thesis/Project 16 100

CS2392 Colloquim/Term Project 4 100

CS2491 Thesis/Project 20 100

Note : The distribution of thesis evaluation marks will be as follows :

1. Supervisor(s) evaluation component : 60%

2. Oral Board evaluation component : 40%

CS2111 Advanced Computer Network

CS2112 Distributed Computing

CS2113 Digital Image Processing

CS2114 Advanced Data Modeling

CS2115 Genetic Algorithm & Neural Network

CS2116 Real Time & Embedded Systems

CS2117 Data Mining

CS2211 Advanced Algorithms

CS2214 Semantic Web

CS2217 Advanced Database