MCN Syllabus 2017 PDF

M.
TECH COMPUTER NETWORKING
CODE: MTCE-17-102
SUBJECT NAME: RESOURCE MANAGEMENT IN COMPUTER SYSTEMS
NO OF CREDITS: 4
M.TECH SEMESTER I SESSIONAL: 25
L P THEORY EXAM: 75
4 0 TOTAL: 100
NOTE: Question paper has two parts. Part-1 has 10 questions each of 2 marks. It covers the
entire syllabus. Attempt any four questions out of six from Part-2.
Course Objectives:
1. To get familiar the students about basic as well as advanced concepts in operating
systems
2. To introduce all the types of operating system, architectures and basic operation.
3. To study the detail of various components of operating systems viz. process management,
memory management, file management, disk management, I/O management
Unit I : Operating System Introduction

Need of OS, Evolution of OS, Types of OS - Simple Batch, Multi programmed, multiuser,
multitasking, multiprocessing, Distributed Systems, Real-Time Systems, Embedded OS.
Functions, Resource types, nature of resources, components of resource management. Interrupt-
driven operations for OS, Hardware protection to implement multiprogramming/multitasking.
Unit II : OS Architecture
General operations, system calls, system program, system generation program, general structure:
monolithic, layered architecture, Virtual Machines, Microkernel, ExoKernel, Hybrid.
Unit III : Process management

Process Lifecycle, Implementation of process, Context switching, process switching, schedulers,
processes operations, introduction to multithreading.
Process Scheduling: Scheduling levels, scheduling types, scheduling goals, scheduling

algorithms: FCFS, Priority, Round Robin, HRRN, Virtual RR, Multi-level Queue, multi-level
feedback, fare share, lottery.
Unit IV : Process Synchronization

Concurrent process, Critical Section Problem, Semaphores, Critical regions, Monitors, message
passing system.
Deadlocks: Deadlock Prevention, Deadlock Avoidance, Deadlock Detection and Recovery.
Unit V : Memory Management

Basic concepts, Contiguous Allocation, Buddy system, Non-contiguous, Paging, page table
structure, Segmentation.
Virtual Memory Management: need of VM, principal of locality, Demand Paging, VM system
with TLB, Page Replacement Algorithm: FIFO, Optimal, LRU, Second Chance, Clock, NRU,
and NFU. Thrashing.
Unit VI : File System Interface

Types of files, Access methods, Directory Structure, Protection, File System Structure,
Allocation methods, Free-space Management.
Disk management: Need of disk scheduling, disk scheduling criteria, disk scheduling algorithm.
Unit VII
I/O Management - I/O Systems: I/O Hardware, I/O software, types of I/O, kernel I/O
subsystems.
Course Outcomes:
a. The students will be able to understand the need and evolution of operating systems
b. Knowledge of batch systems, multiprogrammed systems, multiuser systems, multitasking
systems, multiprocessing systems, distributed systems, real-time systems
c. General operation of operating systems
d. Study of process life cycle, process scheduling, process synchronization, deadlocks
e. Study of memory allocation schemes, virtual memory
f. Study of file allocation methods and implementation of file systems
g. Study of implementation of I/O systems
MAPPING OF COURSE OBJECTIVES AND COURSE OUTCOMES:
Course Outcomes ------->
a b c d e F g H
1 √
Objectives ----
Course
2 √ √
>
3 √ √ √ √
REFERENCES
1. William Stallings: Operating Systems, PHI, Latest Edition.

2. A.S. Tanenbaum: Modern Operating Systems, Latest edition Pearson/PHI.
3. Dhamdhere: Operating System Concepts, TMH.
M.TECH COMPUTER NETWORKING
CODE: MTCN-17-101
SUBJECT NAME: DATA COMMUNICATION NETWORKS
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To make students familiar with concepts of Data Communication, Line Encoding

Schemes, Multiplexing techniques, Modulation methods.
2. To introduce B-ISDN and ATM, Optical Transmission, Network techniques, Signaling
principles
3. To make students familiar with concept of broadband network performance, traffic
management aspects
4. To make students familiar with ATM traffic parameters and transfer capabilities, Quality
of service
5. To make students familiar with ATM ATM switching: matrix type, central memory, ring
type switching element.
6. To make students familiar with Switching networks
7. To make students familiar with ATM transmission
8. To introduce concept of Multi-Protocol Label Switching (MPLS)
9. To introduce concept of Ad-hoc Network Concepts
Introduction:
Data Communication: Data transmission, Parallel Transmission, Serial Transmission, Line Encoding
Schemes: Unipolar, Polar, Bipolar, Multiplexing techniques: TDM, FDM, Modulation methods:
AM, FM, PM, Pulse Code Modulation. Spread spectrum, Concepts of layering, TCP/IP and ISO’s
OSI reference model. Transmission media.
Data Link Layer
Error detection and correction, Data link control - Flow and Error control - Sliding
window protocol - ARQ schemes, HDLC protocol - Point to Point Protocol, Multiple Access
Techniques - Random Access, Controlled Access, Logical Link Control (LLC) and Medium
Access Sub-layer functions - LAN standards - IEEE 802.3 (CSMA/CD) - Fast Ethernet - Giga
Bit Ethernet, IEEE 802.4 (Token Bus), IEEE 802.5 (Token Ring), IEEE 802.11 (Wireless LAN).
Network Layer
Inter-networking- Subnetting, Supernetting and Masking , Class full and Classless addressing.
Routing - Link state and Distance Vector Routing - Congestion control algorithms - Network
Layer Protocols - ARP, RARP, IPv4, ICMP and IPv6. Unicast Routing and Multicast Routing
techniques.
Transport Layer
Processes to Processes Delivery - Transmission Control Protocol (TCP) - User Datagram
Protocol, Stream Control Transmission Protocol (SCTP) - Data Traffic - Congestion Control and
Quality of Service - Techniques to improve QOS - Integrated Services - Differentiated Services,
QoS in switched networks.
Session, Presentation And Application Layers
Services, Network security - Security Cryptography, Message confidentiality, message integrity,
message authentication, Digital Signature, Entity Authentication, Key Management, Application
layer- DNS, E-mail (SMTP), FTP, HTTP, Voice over IP.
Course Outcomes:
a. The students will be able to understand basic terminology used in database systems.
b. The students will be familiar with the basic concepts and the applications of database
systems.
c. The students will be able to understand role of Database administrator in DBMS.
d. The students will be able to understand various data model like Hierarchical model,
Network Model, Relational model, E-R model.
e. The students will be familiar with relational database theory and be able to write
relational algebra expressions for query.
f. The students will be able to understand the logical design guidelines for databases,
including the E-R method and normalization approach.
g. The students will be familiar with database storage structure and access techniques like
file and page organization, indexing methods like B-tree and hashing.
h. The students will be familiar with basic issues of transaction processing and concurrency
control.
i. The students will be able to understand serializability and also its various protocols to
maintain it.
j. The students will be able to choose the database management system suitable for a
specific project and knows its structure and functions.
k. The students will be able to know the SQL language clauses and functions and can write
optimal queries in SQL.
l. The students will be able to understand various storage mechanisms.
m. The students will be also understand how to retrieve data manipulate data using SQL.
a b C d e f g h i j k l M n o P
1 √ √ √ √ √
2 √ √ √ √
Course Objectives ---->
3 √
4 √
5 √
6 √
7 √
8 √
9 √
REFERENCES
1. Forouzan, Data Communications and Networking, TMH, 4 th Edition, 2006.

2. William Stallings, Data and Computer Communications, PHI, 7 th Edition, 2003.
3. S.Tanenbaum, Computer Networks, 4 th Edition, Pearson Education Asia Inc., 2004.
4. Leon-Garcia, Widjaja, Communication Networks, Fundamental Concepts and Key
Architecture, TMH, 2 nd Edition, 2004.

CODE: MTCE-17-122
SUBJECT NAME: ANALYSIS AND DESIGN OF ALGORITHMS
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. Introducing students with mathematical preliminaries required to analyze and design

computer algorithms.
2. Introducing to the student advanced data structures required to design efficient computer
algorithms
3. Familiarizing students with specific algorithms for a number of important computational
problems like sorting, searching, and graphs, etc.
4. Use various techniques for efficient algorithm design (divide-and-conquer, greedy,
dynamic programming, backtracking and branch and bound algorithms) and are able to
apply them while designing algorithms.
5. Introducing the concept of NP-complete problems and different techniques to deal with
them. Know the concepts of tractable and intractable problems and the classes P, NP and
NP-complete problems.
Unit 1: Analyzing Algorithms & Problems

Introduction to algorithms, Time and Space Complexity, Basic elements of data structures like
linked lists, stacks and queues, trees, graphs, recursion. Different types of sorting algorithms and
their complexities
Unit 2: Dynamic Sets, Searching and Graphs

Introduction, Array, amortized time analysis, red black trees, hashing, heaps, dynamic
equivalence relations and union-find programs, priority queues with decrease key operations,
traversing graphs, DFS, strongly connected components, biconnected complaints, minimum
spanning tree algo., single source shortest paths, all pair shortest paths
Unit 3: Greedy and Dynamic Methods
Intro. to greedy and dynamic methods, their algorithms, and comparative study
Unit 4: Backtracking and Branch – and – Bound

General backtracking and Branch and Bound Methods, 8 queen, sum of subset, graph coloring,
Hamilton cycles, 0/1 knapsack problem
Unit 5: NP – Hard and NP Complete problems

Basic Concepts, cooks theorem, NP – Hard graph problems, NP hard Scheduling.
Unit 6: Parallel Algorithms

Intro., parallelism, PRAM and other models, some simple PRAM algorithms, handling write
conflicts, Merging and Sorting, Finding Connected Components.
Unit 7: Approximation Algorithms

Intro., Absolute Approximation, e-approximation, polynomial time approximation schemes, fully
polynomial time approximation schemes. String matching algorithms
Course Outcomes:
a. Able to analyze and compare complexity for different types of algorithms for different
types of problems.
b. Apply mathematical preliminaries to the analyses and design stages of different types of
algorithms.
c. Choose among different types of data structures the best one for different types of
problems.
d. Recognize the general principles and good algorithm design techniques for developing
efficient computer algorithms.
e. Familiarizing students with specific algorithms for a number of important computational
problems like sorting, searching, and graphs, etc.
f. Decide on the suitability of a specific algorithm design technique for a given problem.
g. Design efficient algorithms for new situations, using as building blocks the techniques
learned.
h. Apply algorithm design techniques to solve certain NP-complete problems.
Course Outcome
a b c d e f g h i
1
√ √ √
√ √
2
√
Course
3
Objective
4
√ √
√
REFERENCES
1. Fundamental of Computer algorithms, Ellis Horowitz and Sartaj Sahni, 1978, Galgotia Publ.,
2. Introduction To Algorithms, Thomas H Cormen, Charles E Leiserson And Ronald L Rivest:
1990, TMH
3. The Design and Analysis of Computer Algorithm, Aho A.V. Hopcroft J.E., 1974, Addison
Wesley.
4. Algorithms-The Construction, Proof and Analysis of Programs, Berlion, P.Bizard, P., 1986.
Johan Wiley & Sons, Writing Efficient Programs, Bentley, J.L., PHI
5. Introduction to Design and Analysis of Algorithm, Goodman, S.E. & Hedetnieni, 1997, MGH.
CODE: MTCE-17-103
SUBJECT NAME: MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

(ELECTIVE –I)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives
To subject aims to educate the students about
1. Need for formal communication with the computing machines and requirement for
creation of formal languages
2. Various components of grammars relating to design of meaningful sentences in formal
languages
3. Classification & hierarchy of grammars on the basis of their production systems
4. Tools associated with various types of grammars ( 0, 1, 2 and 3) and their usage for
recognition of corresponding types of languages
5. Ambiguities and possible defects in Context free grammars and their removal
6. Need for standard (normal) forms of grammar
7. Concept of algorithm and its association with Turing Machine
8. Designing Turing machines for various languages and integer computing
9. Various extensions of Turing machines
10. Decidable and non decidable properties of various types of languages
11. Concept of recursive and recursively enumerable languages
12. Computability and its association with primitive recursive and µ recursive functions
Unit 1: Finite Automata and Regular Languages

Deterministic and non-deterministic Finite Automata, Equivalence of Finite Automata (FA),
Equivalence of NDFA and DFA, Myhill-Nerode Theorem and minimization of FA, FA with null
moves, FA with outputs: Moore and mealy Machines, Equivalence of Moore and Mealy
machines, Regular Expressions, Regular languages and FA, Arden theorem: Equivalence of FA
and Regular Expressions, Closure properties of regular sets, Pumping Lemma for Regular Sets,
Applications of the pumping lemma.
Unit 2: Chomsky classification of Grammars
Unrestricted languages, Context sensitive languages, Context free languages and regular
languages, Relation between classes of languages, Parse trees, Ambiguity in CFG, Reduced
forms, Removal of useless Symbols and unit production, Chomsky Normal Form (CNF),
Griebach Normal Form (GNF), Closure properties of CFL, Pumping lemma for CFG,
Applications of CFG.
Unit 3: Pushdown Automata and Turing machines

Basic Structure of PDA, Acceptance by PDA, PDA and Context Free Languages, Design of
PDA corresponding to a grammar, LL(k) parsing, bottom up and top down parser design, LBA,
Basic structure and working of Turing Machine, Nondeterministic and deterministic Turing
Machine, Role of TM as language recognizer, computer for integers and enumerator and
associated design problems, Space and time complexity of TM, binary coding of TM, Universal
Turing Machine, halting problem of TM, Decision problems and Rice’s Theorem.
Unit 4: Undecidability
Recursive and recursive enumerable languages, Post Correspondence Problem, Primitive
recursive functions.
Unit 5: Advancements in Automata Theory

Multitrack and Multitape TM, Post machine, Design of Post machine, Cellular Automata.
Course Outcomes
After the completion of the course, the students will be to able to

a) Discuss the requirement for formal language to communicate with the computing machine
b) Understand the concept of Terminals, Non terminals, production system and starting sentential
form in relation to formal grammars
c) Classify the languages on the basis of their production system
d) Design the grammar and machines for Regular and context free grammars
e) Remove the defects and ambiguity in Type 2 grammar and convert the grammar to standard
normal forms
f) Design the Turing machines for various languages, integer computing and enumeration
g) Discuss the check the decidability issue relating to various aspects of formal language
h) Check if a given language is recursive/ recursively enumerable/ neither
i) Check if a given function is computable or not
MAPPING OF COURSE OBJECTIVES AND COURSE OUTCOMES
COURSE OUTCOMES---------------.>
a b C d e f g h i
1 √
2 √
Course 3 √ √
Objectives 4 √
5 √
6 √
7 √
8 √
9 √
10 √
11 √
12 √
REFERENCES
1. Formal languages and Automata Theory- C. K. Nagpal, Oxford University Press 2011.
2. “Introduction to automata theory Language and Computation”, J.E. Hopcroft, R. Motwani, J.D.
Ullman, Pearson education.
3. “Theory of computer Science: Automata Language and Computation”, K.L.P Mishra and
Chandrasekaran, Prentice Hall of India.
4. “Introduction to Computer Theory”, D.I.A Cohen, Willey India.
5. “Introduction to Languages and the Theory of Computation”,John C. Martin, Tata McGraw Hill
CODE: MTIT-17-103
SUBJECT NAME: INFORMATION RETRIEVAL SYSTEM (ELECTIVE –I)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To build an understanding of the fundamental concepts of Information Retrieval

2. To familiarize students with the basic taxonomy and terminology of Indices
3. To understand Heap’s Law for estimation and Zipf’s law for modeling distribution of
terms
4. To understand dictionary compression and posting list compression
5. To introduce the scoring , tf-idf weighting and vector space model for scoring
6. To understand cluster pruning and tiered indices
7. To learn the elements of Web Search basics
8. To learn various language models for information retrieval and their types
Unit 1 : Introduction to Information Retrieval

Information retrieval problem, an inverted index, Processing Boolean queries, The extended
Boolean model versus ranked retrieval, an inverted index, Bi-word indexes, Positional indexes,
Combination schemes
Unit 2 : Index construction

Hardware basics, Blocked sort-based indexing, Single-pass in-memory indexing, Distributed
indexing, Dynamic indexing, Other types of indexes
Index compression: Statistical properties of terms in information retrieval, Heaps’ law:
Estimating the number of terms, Zipf’s law: Modeling the distribution of terms, Dictionary
compression, Dictionary as a string, Blocked storage, Postings file compression.
Unit 3 : Scoring, term weighting and the vector space model

Parametric and zone indexes, Weighted zone scoring, Learning weights, The optimal weight,
Term frequency and weighting, Inverse document frequency, Tf-idf weighting, The vector space
model for scoring, Variant tf-idf functions.
Unit 4 : Computing scores in a complete search system
Efficient scoring and ranking, Inexact top K document retrieval, Index elimination, Champion
lists, Static quality scores and ordering, Impact ordering, Cluster pruning, Components of an
information retrieval system, Tiered indexes
Unit 5 : Web search basics

Background and history, Web characteristics, The web graph, Spam, Advertising as the
economic model, The search user experience, User query needs
Crawling, Crawler architecture, DNS resolution, The URL frontier, Link analysis, The Web as a
graph, Anchor text and the web graph, PageRank, Markov chains, The PageRank computation,
Topic-specific PageRank
Unit 6 : Language models for information retrieval

Language models, Finite automata and language models, Types of language models,
Multinomial distributions over words, The query likelihood model, Using query likelihood
language models in IR, Estimating the query generation probability, Language modelling versus
other approaches in IR
Course Outcomes
a) The students will be able to understand basic Information Retrieval Systems.

b) The students will be able to lean how Boolean queries are processed.
c) The students will be able to identify the different types of indices: inverted index, positional
index, bi-word index etc
d) The student will be able to make estimations and model distribution of terms and compressions
e) The students will be able to enumerate various types of indices. And also understand the concept
of efficient storage of indices.
f) The students will be able to learn tf-idf scoring and vector space model scoring for ranking
g) The students will be able to understand Static quality ordering, cluster pruning and tiered indices
h) The students will be able to understand the basic concept of Search Engines their architecture and
various functional components.
i) The students will be able to understand the basic concept of Web crawlers and their architecture
j) The students will be able to understand various language models related to information retrieval
a b c d e f g h i j
1 √
2 √ √
3 √
Course Objectives------
4 √
5 √ √
6 √
7 √ √
8 √
REFERENCES
1. An Introduction to Information Retrieval Christopher D. Manning, Prabhakar

Raghavan, Hinrich Schütze Cambridge University Press
CODE: MTCE-17-113
SUBJECT NAME: AGILE SOFTWARE DEVELOPMENT (ELECTIVE –I)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To learn the fundamental principles and practices associated with each of the agile
development methods, evolutionary development and delivery.
2. To learn from fun hands-on activities in the classroom (or in collaborative groups online)
and also on a course project where students will apply the principles and practices of
agile software development and to understand various agile methodologies.
3. To learn how agile methods are planned and prioritized.
4. To perform estimation in agile by using various methods of estimation.
5. To learn how agile methods scrum is used, including the role of scrum software
development life cycle.
6. To perform in-depth testing into aspects of agile development that are particularly
relevant to each student through detailed discussion sessions.
Unit 1 : Iterative and Evolutionary Development

Key motivations for iterative development, meeting the requirements and challenges iteratively,
Risk driven & client-driven iterative planning, time-box iterative development, Evolutionary &
adaptive development, Evolutionary requirement analysis, incremental & evolutionary delivery.
Unit 2 : Adapting to Agile

Background, overview & definitions, Agile manifesto, Agile principles, Agile Methods-
Extreme Programming, Scrum Development methodology, Crystal family of methodologies,
Rational Unified Process (RUP).
Unit 3 : Agile Planning & Prioritization

Agile application to planning, Success features for Agile planning, velocity, prioritizing story &
themes, Kano model for prioritization, Relative weighing model for prioritization.
Unit 4 : Agile Estimation

Estimation, estimating size with story points, estimating with ideal days & ideal time, ideal day
as a measure of time, techniques for estimating, re-estimation, choosing between story points &
ideal days, Splitting user-stories, estimating user-stories, release plan, updating the release plan.
Unit 5 : Agile Software Development using Scrum

Adaptive scrum, Product backlog, Sprint, Scrum life cycle, Scrum estimation, Scrum Planning,
Working with scrum.
Unit 6 : Agile Testing

Introduction to Agile testing quadrants, test-driven development, unit testing, component
testing, functional testing, story testing, exploratory testing, scenario testing, usability testing,
acceptance testing, performance and load testing, security testing, ility testing, pair testing,
Course outcomes
a. Student will understand fundamental principles and practices associated with each of the
agile development methods, evolutionary development and delivery.
b. Students will understand various agile methodologies and techniques to plan and
prioritize various tasks.
c. Students can perform estimation in agile by using various methods of estimation.
d. Students will understand scrum method of agile, including the role of scrum software
development life cycle.
e. Students will become familiar with various testing concepts.
Mapping of Course Objectives and Course Outcomes
Course Outcomes
a b c d e
1 √
2 √
3 √
Course 4 √
Objectives 5 √ √
6 √
REFERENCES
1. S/w development using Scrum, Succeeding with Agile by Mike Cohn

2. Agile & iterative development- A manager’s Guide Craig Larman.
3. Agile Testing, A Practical Guide for Testers and Agile Teams,Lisa Crispin, Janet Gregory
CODE: MTCE-17-115
SUBJECT NAME: ADVANCED COMPUTER ARCHITECTURE (ELECTIVE –I)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1) Describe the principles of processor design and Classify instruction set architectures.
2) The course focuses on about uni-processor implementation alternatives (single cycle,
multiple-cycle, and pipelined implementations)
3) Special emphasis will be on quantifying design decisions in terms of performance and
cost.
4) It helps to understand the memory hierarchy, the caches, virtual memory, storage
systems.
5) Architectures exploiting instruction-level parallelism (ILP), data-level parallelism (DLP),
thread-level and task-level parallelisms are treated.
6) Furthermore new code generation techniques needed for exploiting ILP will be treated.
7) Investigating modern design structures of Pipelined and Multiprocessors systems.
8) To acquaint with recent computer architectures and I/O devices, as well as driving or
managing these types of advanced hardware. The course focuses on processor design,
pipelining, superscalar, out-of-order execution
Unit I : Introduction and Advanced concepts

Introduction: Evaluation of computers generations of computers – basics of computer
architecture – stored program organization (Von Neumann architecture) – instruction formats
and types – addressing modes –register organization and stack organization.
Advanced concepts: Horizontal and vertical instruction format, microprogramming,
microinstruction sequencing and control; instruction pipeline; parallel processing; problems in
parallel processing; data hazard, control hazard.
Unit II : Parallel Processing

Parallelism in uni processor system – parallel computer structures – architectural classification
schemes, parallel processing applications
Unit III : Memory and I/O systems

Hierarchical Memory structure , Virtual memory systems caches – design methods –
associativememories – input / output system – programmed I/O – DMA and interrupts – I/O
processors.
Unit IV: Principles of pipelining and vector processing

Pipelining: an overlapped parallelism ,instruction and arithmetic pipelines, principles of
designing pipelined processors, vector processing requirements.
Unit V : array processors and multi processors:

SIMD array processors, SIMD interconnection networks - static vd dynamic networks, Mesh-
connected network, Cube connected Network
Functional structures for multi processors , interconnection networks and multiprocessor
operating systems.
Unit VI : Data Flow Computers

Data driven computing, control flow vs data flow, data flow computer architectures- static data
flow computers and dynamic data flow computers.
Course Outcomes
By the end of the course, a student should be able to:
a) Understand the classes of computers, the change in technology and the quantitative
principles of computer design
b) Understand the advanced concepts of computer architecture.
c) Expose the major differentials of RISC and CISC architectural characteristics

d) Comprehend operation of instruction level parallelism in pipelines and the challenges of
ILP.
e) Will know about computer performance, instruction set architecture design and
implementation.
f) Understand the components and operation of a memory hierarchy and the range of
performance issues influencing its design.
g) Design Scheduling and Structuring Code for Parallelism and study of issues related to
VLIW
h) Discuss the large scale multiprocessors and their relevance to the scientific applications
i) Be able to understand an existing software& hardware system and extend the system to
meet evolving requirements.
Mapping of Course Objectives and Course Outcomes
a b C d E F g H i
1 √ √ √ √
2 √ √ √ √ √
3 √ √ √
4 √
5 √
6 √
7 √ √
8 √ √
REFERENCES
1. John P Hayes, Computer architecture and organization, III edition McGraw Hill, 1998.
2. Pipelined and Parallel processor design by Michael J. Fiynn – 1995, Narosa
3. Computer Architecture and parallel Processing” Kai Hwang and A. Briggs International
edition McGraw-Hill.
4. Computer Architecture A quantitative approach 3rd edition John L. Hannessy & David A.
Patteson Morgan Kufmann (An Imprint of Elsevier)
CODE: MTCE-17- 105
SUBJECT NAME: SOFTWARE TESTING (ELECTIVE –I)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives
1. To get familiar the students about basic concepts of software testing and its techniques.
2. To study the concepts of Verification and validation activities.
3. To study in detail the process of performing the black box and white box testing
approaches with examples.
4. To get familiar the students the concept of regression testing.
5. To study about the various testing automation and debugging tools and case studies.
To study the basic and advanced concepts of object oriented testing.
Unit 1 :
Testing terminology and Methodology
Definition of testing, goals, psychology, model for testing, effective testing, limitations of
testing, Importance of Testing, Definition of Failure, faults or bug, error, incident, test case, test
ware, life cycle of bug, bug effects, bug classification, test case design, testing methodology,
development of test strategy, verification, validation, Static testing: Inspection ,Review and
Walkthrough, dynamic testing, testing life cycle model, testing techniques, testing principles,
Testing Metrices.
Unit 2 : Verification and validation

Verification activities, verification of requirements, verification of HL design, verification of
data design, verification of architectural design, verification of UI design, verification of LL
design, introduction to validation activities
Unit 3 : Dynamic testing

White Box testing: Boundary value analysis, equivalence class portioning, state table based
testing, decision table based, error guessing.
Black Box Testing: Logic coverage criteria, basic path testing, graph matrices.
Unit 4 : Validation Testing
Unit testing, drivers , stubs, integration testing, methods, functional testing, system testing,
recovery testing, security testing, stress testing, performance testing, usability testing
Unit 5 : Regression Testing

Objective of regression testing, Regression test process, Regression testing techniques.
Unit 6 : Test Automation and debugging

S/w measurement and testing, testing metrics and tools
Case Study: Testing for Object-oriented and web-based systems
Unit 7 : Object-Oriented Testing

Use-case based testing; Class testing, Testing Exception handling
Course Outcomes:
a. The students will be able to understand the concepts of software testing and its
techniques.
b. Knowledge of verification and validation activities.
c. Study of black box and white box testing techniques.
d. Study the concept of regression testing and its techniques.
e. Study of object oriented testing techniques.
f. Study of case studies and various testing automation and debugging tools.
g. Study of various testing metrics.
a b c d e f g
1 √
2 √
3 √
4 √
5 √
6 √ √ √
REFERENCES
1. G.J Myers, The Art of Software Testing, John Wiley & Sons, 1979
2. Naresh Chauhan, Software Testing Principles and Practices,OXFORD University Press.
CODE: MTCN-17-102
SUBJECT NAME: MOBILE AND WIRELESS COMMUNICATION
NO OF CREDITS: 4
M.TECH SEMESTER II SESSIONAL: 25
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives
1. To introduce the concept of wireless communication along with its history, application,
and market.
2. To make the student familiar with basic terminology like frequency, signals, bandwidth,
signals and spread spectrum etc.
3. To introduce the concept of cellular system and design of cellular system. To make the
students familiar with different handoff strategies.
4. To introduce the MAC and Telecommunication system.
5. To make the student familiar with the wireless LAN including Bluetooth technology.
6. To introduce the concept of Mobile Network layer, IP Packet delivery and adhoc network
routing.
7. To make the student familiar with mobile transport layer along with satellite
communication.
Unit 1: Introduction
Applications, history, market, reference model and overview. Wireless Transmission—
Frequencies, signals, antennas, signal propagation, multiplexing, modulation, spread spectrum.
Unit 2: Cellular System- Concept and Design Fundamentals:

Introduction. Frequency Reuse. Channel Assignment Strategies. Handoff Strategies. Interference
and System Capacity. Trunking and Grade of Service. Improving Coverage & Capacity in
Cellular Systems.
Unit 3: MAC and Telecommunication system:

Specialized MAC, SDMA, FDMA, TDMA- fixed TDM, classical ALOHA, slotted,
ALOHA, CSMA, DAMA, PKMA, reservation TDMA. Collision avoidance, polling
inhibit sense multiple access.('DM A, comparison, CSM- mobile services, architecture radio
interlace, protocol, localization, calling, handover, security, new data services, Introduction to
W'LL.
Unit 4: Wireless LAN

Wireless LAN: IEEE 802.11-System and protocol architecture, physical layer. MAC
layered management. Bluetooth--- User scenarios, physical layer, MAC layer,
networking, security and link management.
Unit 5: Mobile network Layer:

Mobile IP- goals, assumption, requirement, entities, terminology, IP packet delivery, Agent
advertisement and discovery, registration, tunneling, encapsulation, optimization, reverse
tunnelling. DHCP. Adhoc Networks- routing: destination sequence distance vector,
dynamic source routing, hierarchical algorithm, alternative metric.
Unit 6: Mobile Transport Layer and Satellite Systems:

Transport Layer: Traditional TCP, Indirect 'TCP, Snooping 'TCP, Mobile TCP fast
retransmission recovery, transmission/time out freezing, selective retransmission, Transaction
oriented TCP. Satellite Systems: History, Applications, GLO, LLO, MLO, routing, localization ,
handover in satellite system.
Course Outcomes
Upon successful completion of the course, the student will be:
a. Able to understand the concept of wireless communication, its advantages over

traditional wired network communication, different application of wireless
communication system.
b. Familiar with the various terms such as frequencies, signals, multiplexing, modulation
and spread spectrum techniques.
c. Able to understand the concept of cellular system, how cellular systems are designed,
handoff strategies.
d. Able to understand what is system capacity, frequency reuse, requirement of frequency
reuse in wireless networks, improving the coverage and capacity of cellular system.
e. Able to understand and classify different multiplexing strategies.
f. Able to understand and classify different modulation strategies.
g. Differentiate between ALOHA and slotted ALOHA.
h. Familiar with GSM, GSM system architecture, GSM protocol architecture, handover
procedure and security.
i. Familiar to wireless LAN, characteristics and design goals of wireless LAN, architecture
of infrastructure based network.
j. Familiar with IEEE standard 802.11, CSMA/CA access method, fragmentation, MAC
Management, Bluetooth, piconet, scatternet, Bluetooth protocol stack.
k. Able to understand the concept of Mobile IP, its goals and other terminologies. Able to
differentiate between IPV4 and IPV6.
l. Able to understand the concept of adhoc network and differentiate between infrastructure
based and infrastructure less network
m. Familiar with different categories of routing protocols of adhoc network.
n. Familiar with mobile transport layer, TCP, satellite communication, categories, routing
and handover in satellite communication.
a b c d e f G h i j k l m n
1 √ √
2 √
3 √ √ √ √
4 √ √ √ √ √
5 √ √
6 √ √ √
7 √ √
REFERENCES
1. Jochen Schiller," Mobile Communication" , Pcarson Education,2002

2. Lee, " Mobile Cellular Telecommunications" McGRAW- HILL.
3. Wireless Communications : Principles and Practice by Theodore S. Rappaport Prentice Hall India
1996.
4. Wireless Communications : Principles and Practice by Theodore S. Rappaport Pearson 2010.
CODE: MTCE-17-101
SUBJECT NAME: COMPUTER SYSTEM SOFTWARE
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives
1. To apprise students of various programming techniques along with respective merits and
demerits of each technique.
2. To introduce basics terminology and design principles associated with OOPs and
constructs in C++ to support those.
3. To discuss the principles of abstraction and encapsulation with emphasis on silent
functions written by compiler, const-pass-by-reference, issues with friend functions,
handling of pointer-type-variables in copy cotr, static data members and similar c++
constructs.
4. To discuss the principles of inheritance and polymorphism with emphasis on virtual and
non-virtual functions, open and close principle, Liskcov’s substitution principle, virtual
dotr, private inheritance, virtual base classes and similar c++ constructs.
5. To familiarize students with compile time polymorphism and code sharing with c++
templates.
6. To make students understand the difference between error and exception handling with
proper language constructs for the same.
7. To introduce basic UML design notations, static and dynamic models elements for object
oriented system design.
8. To familiarize students with importance of system software with specific emphasis on
language translators.
9. To make students understand the basics of assembly language and design issues of two
pass and single pass assembler.
10. To apprise student of basic compiler, Linker and Loader design issues with data
structures used by these.
Unit I : Introduction to Object oriented Programming and Design:

Programming Techniques- A Survey
Introduction to programming paradigms – unstructured programming, structured,
procedural, and modular programming; drawbacks of structured programming; Object
Oriented programming.
Classes and Objects
Introduction to objects; classes – declaration in C++, abstraction and encapsulation,
creating objects; array of objects; objects as function arguments, scope resolution
operator, static data members; properties of classes and objects.
Functions: advanced concepts
Polymorphism, Function overloading; inline functions; friend functions- Member
functions of a class as friends of another class, Friend Function as a bridge between two
classes; friend classes; recursion – types of recursion: linear, binary, tail recursion
Constructors and Destructors
Constructors – types of constructors: default, user defined, parameterized, copy
constructors, and constructors with default arguments; rules for constructor definition and
usage; destructors -rules for destructor definition and usage.
Inheritance: Extending classes
Introduction to code reuse; containership-aggregation; inheritance – visibility modes,
‘Open Close Principle’(OCP) types of inheritance: multilevel, multiple inheritance;
function overriding – virtual functions, ‘Liskov’s Substitution Principle’ (LSP), pure
virtual functions; roles of constructors and destructors in inheritance; virtual base class –
graph inheritance.
Templates: code sharing (Genericity):
Introduction to code sharing; templates; generic classes; templates with more than one
generic parameter;
Exception handling
Introduction – traditional error handling; exception handling in C++ - ‘try, throw, and
catch blocks’, multiple throw and multiple catch blocks, throwing objects; situations of
usage of exception handling.
Introduction to UML
Introduction – static model, dynamic model; class diagrams – relationship among classes:
composition – association & aggregation, multiplicity, generalization – inheritance,
hierarchy of classes, dependency; use case diagrams; behaviour diagrams: interaction
diagrams – sequence and collaboration diagrams, state chart diagrams, activity diagrams;
implementation diagrams: component and deployment diagrams.
Unit II : System Programming :
Types of software: system software and application software; introduction to system

software: assembler, compiler, interpreter, macro processor, linker, loader, operating
system etc.
Assemblers
Elements of assembly language, assembly process, forward reference problem, design of
a two pass assembler, concept of back patching ; introduction to macros and design of a
macro processor.
Compilers
Introduction to compilation process, programming language grammers, scanning,
parsing, introduction to code optimization.
Loaders and Linkers:
Introduction to loading, linking, and relocation; program relocatability; absolute loaders,
relative loaders, static and dynamic linking – data structures used by loaders and linkers;
link load and go scheme, load link and go scheme of linkage editor.
Course Outcomes
a. The students will be able to decide which programming technique to use in a given
design situation based on the respective merits and demerits.
b. The students will be able to design clean interfaces for the classes using the abstraction
design principle.
c. The students will be able to separate out the interfaces from the implementation during
the class design by applying the abstraction and encapsulation principles.
d. The students will be able to understand the design cost involved for using c++ constructs
like passing parameters by value or by reference, deep copy cotr, silent function writing
by compiler and friend functions.
e. The students will be able to use inheritance correctly for writing “is-a” kind of
relationships based programs and not mere for code reuse.
f. The students will be able to write polymorphic programs with clear understanding of
inheritance of interfaces v/s inheritance of default implementation v/s inheritance of static
implementation.
g. The students will be able to handle issues with multiple inheritance, memory leak issue
for not using virtual dotr, issue with inheritance of non-virtual function.
h. The students will be able to write generic program using c++ templates and handle
runtime issues using exception handling.
i. The student will be able to design software systems using UML notation and models.
j. The students will be able to understand the difference between application software and
system software and importance of language translators.
k. The students will be able to design a two pass assembler for a given ISA architecture.
l. The students will be able to understand the various phases involved in a complier design
and would be able to do lexical, syntactical and semantic analysis of simple programming
instructions.
m. The students will be able to understand program relocatability and c++ linking model.
n. The students will be also understand absolute and relative loaders for loading and running
c++ programs.
a b c d e F g h i j k l m n
1 √
2 √ √ √
3 √ √
4 √ √ √
5 √
6 √
7 √
8 √ √ √
9 √
10 √
REFERENCES
1. A.K.Sharma, Kavita Kapur, “ Introductory Computer Science with C++, Vol. II”,
Dhanpat Rai Publications
2. E. Balagurusamy, “Object Oriented Programming with C++”, TMH.
3. Herbert Schield “The Complete Reference in C++” TMH.
4. Donovan ,”Systems Programming”, Tata McGraw Hill.
5. Dhamdhere,” System Software” Tata McGraw Hill.
CODE: MTCN-17-108
SUBJECT NAME: CRYPTOGRAPHY & NETWORK SECURITY (ELECTIVE II)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. Understand the basic concept of Cryptography and Network Security, their mathematical
models.
2. To understand various types of ciphers, DES, AES, message Authentication, digital
Signature System.
3. To impart knowledge of major issues in network and computer system security, focusing
mainly on threats from malicious software.
4. To understand common attacks on computer networks and methods to detect and
remediate such attacks.
5. To understand the Public Key Cryptosystems and analyze their security.
6. Evaluating information security procedures and practices.
7. To analyze security vulnerabilities on different network layers.
8. To acquire knowledge about network security tools and authentication applications.
9. To study various key management and key distribution schemes.
10. To study various issues in security of MANETS and study various attacks.
11. To provide the students with the competences required for understanding various issues
in security of Wireless Security Networks and also various attacks against security
mechanism and routing.
Unit 1 : Introduction
What is security?, Need of security, Why is security so hard?, various goals of security,
Difference between Vulnerability, Threats, Attacks and control, Security goals, aspects of
security, security services, security attacks
Encryption Techniques Terminology of encryption, Requirement of encryption, cryptography,
cryptanalysis, cryptanalytic attacks, symmetric ciphers: Substitution ciphers, Transposition
ciphers, Data Encryption Standard (DES, Advanced Encryption Standard (AES), location of
encryption devices, key distribution, Public Key Cryptography and RSA, Diffie-Hellman
Key Exchange, Message Authentication and Hash Functions, MD5, SHA
Unit 2 : Network Security
Security services, Message confidentiality, Message integrity, message authentication, digital
signature, entity authentication. Authentication applications: Kerberose 95, X.509
Authentication service, Public key infrastructure. Electronic mail Security: Preety Good
Privacy (PGP), IP Security: IP security overview, IP security architecture, Authentication
header, Encapsulating security Payload, Combining security associations, Key management.
Unit 3 : Security Attacks in MANET

Security issues in MANET, Attacks in MANET: External Attack, Internal attack, Black hole
attack, warm hole attack, grey hole attack, Byzantine attack, Sleep Deprivation attack, Flooding
attack: RREQ flooding attack, Data flooding Attack.
UNIT 4 : Security Attacks in Wireless Sensor Networks

Security issues in WSN, Attacks in WSN : Attack against Security mechanism, Attack against
basic mechanism like routing: Spoofed, altered, or replayed routing , Information , Selective
forwarding , Sinkhole attacks , Sybil attacks , Wormholes, HELLO flood attacks
Course Outcomes
After the completion of this course the student will able to:
a. Understand theory of fundamental cryptography, encryption and decryption algorithms,

b. Build secure systems by use of block ciphers like AES, DES.
c. Have a detailed knowledge about authentication, hash functions and application level
security mechanisms.
d. Analyze and apply cryptography for secure e-Commerce and other secret transactions.
e. To be familiar with network security designs using available secure solutions and
advanced security issues and technologies.
f. To develop basic security enhancements in MANETS.
g. To know how authentication is implemented in wireless systems and understand
authentication protocols and processes.
h. Become familiar with different types of Attacks and their protection mechanisms.
i. Become familiar with various key management and distribution issues.
Course Outcomes
a b c d e f g h i
1 √
2 √
3 √
4 √ √
5 √
6 √
Course 7 √
Objectives 8 √
9 √
10 √
11 √
REFERENCES
1. William Stalling, Cryptography and Network Security, 3 rd Edition. PHI New Delhi
2. William Stalling, Network Security Essentials, 2nd Edition. PHI New Delhi
3. Charles P. Pfleeger, Security in computing, 4th Edition Pearson,, New Delhi
Kazem Sohrary, Wireless sensor newtroks, Technology, Protocols and applications, Wiley Publishers
CODE: MTCN-17-110
SUBJECT NAME: STENOGRAPHY & DIGITAL WATERMARKING (ELECTIVE II)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives
1. The objective of the course is to make students familiar about security, its various
services and differentiation among various types of security.
2. To make students familiar with basic concepts of steganography, its various techniques
and how is it different from cryptography.
3. To make students familiar with basic concepts of Digital watermarking, its various
classical and modern techniques.
4. To make students familiar about current research areas or topics of stenography and
digital water marking on which research is going on.
Unit 1 : Introduction
Difference between Vulnerability, Threats, Attacks and control, Security goals, aspects of
security, security services, security attacks, Kerchoff’s assumption, Difference between
Computer security, Information security, Network Security and Cyber security, security models,
unconditional security, computation security, Computer criminals, Introduction to
steganography, digital water marking.
Unit 2 : Steganography
Introduction to Information hiding , Brief history and applications of information hiding,
Principles of Steganography, Steganography vs cryptography, Steganography terms, Type of
steganography, steganography system, Classic Techniques, Modern Steganography techniques :
Masking and Filtering, algorithms and transformations, least bit insertion, Pure , secret key and
public steganography, Steganalysis.
Unit 3 : Digital Watermarking
Introduction, History and terminology, Classification of watermarking, Steganography vs

watermarking, Basic watermarking principle, categories of watermark, Types of watermarking
algorithms, Survey of current watermarking techniques: Spatial domain watermarking,
Transform domain watermarking, Watermarking applications.
Unit 4 : Advance Topics
Discussion of recent research papers on steganography and digital watermarking.
Course Outcome
By the end of the course, students should be able understand importance of security and its
various security models
a. By the end of the course, students should be able understand the concept of stenography,
its importance and application areas and various stenography techniques by which
security can be provided to data.
b. By the end of the course, students should be able understand the concept of Digital water
marking, its application areas, comparative analysis of various techniques to implement it
c. By the end of the course, students should be able to identify research challenges in the
area of stenography and digital water marking.
Mapping of Corse Objectives with Course Outcomes

Course a b c d
Objective
1    
2  
3  
4 
REFERENCES
1. Stefan Katzenbelsser and Fabien A. P. Petitcolas, “Information hiding techniques for
Steganography and Digital Watermarking”, ARTECH House Publishers, January 2004.
2. Jessica Fridrich, “Steganography in Digital Media: Principles, Algorithms, and Applications”,
Cambridge university press, 2010.
3. Steganography, Abbas Cheddad, Vdm Verlag and Dr. Muller, “Digital Image” Aktienge sells
chaft & Co. Kg, Dec 2009.
4. Ingemar Cox, Matthew Miller,Jeffrey Bloom,Jessica Fridrich and Ton Kalker, “Digital
Watermarking And Steganography”, Morgan Kaufmann Publishers, Nov 2007.
CODE: MTCN-17-112
SUBJECT NAME: CYBER SECURITY (ELECTIVE II)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives
1. The objective of the course is to make students familiar about security, its various
services and differentiation among various types of security.
2. To make students familiar with cyber crime, its various categories and its various
technical aspects.
3. To make students familiar with areas where Actions on cyber are prohibited and their
impact.
4. To make students familiar about various forensic tools and various laws for cyber crime
and policy designed by the government for cyber security.
Unit 1: Introduction
Introduction to Cyber Security, Difference between Computer security, Information security,
Network Security and Cyber security, Cyber security Applications and Principles.
Unit 2: Introduction to Cyber Crimes

Category of Cyber crimes, Technical Aspects of Cyber Crimes: unauthorized access & Hacking,
Trojan, Virus and worm Attacks, E-mail & IRC related crimes: Email spoofing and Spamming,
Email bombing: Sending threatening emails, Defamatory emails, Email frauds, IRC
related, Denial of Service attacks, A distributed denial of service (DoS) attack
Unit 3:Prohibited Actions on Cyber

Pornography, IPR Violations, Cyber Squatting, Cyber Terrorism, Banking/Credit card Related
crimes, Sales and Investment frauds, Defamation (Cyber smearing), Cyber Stacking.
Unit 4:Cyber-Forensics and Cyber Security

Introduction to forensic tools, Evaluation of crime scene and evidence collection, Cyber security
Law and Policies, Cyber security and Federal Government, Policy foundation for Cyber security
Course Outcome
a. By the end of the course, students should be able to understand the importance of
security, basics of cyber security.
b. By the end of the course, students should be able to understand what is cyber crime?,
various attacks and application domain under cyber crime.
c. By the end of the course, students should be able to understand the areas where cyber
crime can be happen and their impacts.
d. By the end of the course, students should be able to know laws, policies initiated by the
government against cyber crime.
Course a b c d
Objective
1    
2   
3  
4 
REFERENCES
1. William Stalling, Cryptography and Network Security, 3rd Edition, PHI New Delhi
2. William Stalling, Network Security Essentials, 2nd Edition, PHI New Delhi
3. Stuart McClure, Hacking Exposed : Network Security Secrets and Solutions.
4. Albert Marcella, Doug Menedez, Cyber Forensics : A Field Manual for collecting, Examinig and
Preserving Evidence of computer Crimes, Second Edition(Information Security)
CODE: MTCE-17-118
SUBJECT NAME: AGENT BASED COMPUTING (ELECTIVE II)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives
1. To teach the students fundamental concepts of agents

2. To explain the taxonomy and applications of software agents
3. To provide a detailed understanding of intelligent software agents
4. To explain the student need and approach for implementing Multi Agent Systems
5. To make the student learn various protocols available for communication in MAS
6. To make the students familiar with Agent Communication Languages
7. To provide an in depth knowledge of mobile agents
8. To discuss various security models of agents
9. To discuss and explain various types of attacks on agent based system and their
respective protection mechanisms
10. To learn an agent based framework : aglets
UNIT I : AGENTS – OVERVIEW

Agent Definition, Origin of Agents, Agent Programming Paradigms, Distinguishing features of
Software agents, Taxonomy of Agents, Applications of Agents
UNIT II :INTELLIGENT SOFTWARE AGENTS

Environments, Intelligent Agents, Agents and Objects, Agents and Expert Systems,Agents as
Intentional Systems,Abstract Architecture for Intelligent Agents, Howe to tell an agent what to
do,Synthesizing agents,securing intelligent agents
UNIT III : MULTI AGENT SYSTEM(MAS)

Need of MAS, Utilities and Preferences, Domain Strategies and Nash Equilibria, Competitive
and Zero-Sum Interactions, The Prisonner’s Dilemma, Dependence Relations in MultiAgent
Systems, Agent Communication Languages.
Cooperative Distributed Problem Solving, task sharing and result sharing, contract net protocol
and its extensions.
UNIT III : MOBILE AGENTS : AGENTS WITH MOBILITY

Need of Mobile Agents, Application areas of Mobile Agents, Mobile Agent migration
process,general framework for agent migration, mobility models, classification of
communication models for mobile agents, taxonomy of attacks and proposed solution for mobile
agent security
UNIT V : SECURITY OF AGENTS & AGENT BASED FRAMEWORKS Agent

Security Issues , Mobile Agents Security , Protecting Agents against Malicious Hosts , Untrusted
Agent , Black Box Security , Authentication for agents.
Study of various agent based frameworks, case study : aglets
Course Outcomes
At the end of the course/session the student would be
a. Acquainted with the basics of software agents

b. Learned the application domain of software agents
c. Have an in depth knowledge of intelligent software agents
d. Learned where and how to use Multi Agent Systems
e. Develop various models for communication between agents using ACLs
f. To apply/ include mobile agents in given distributed systems
g. Become familiar with the various types of attacks in agent systems and their security
mechanisms
Course Outcomes
a b c d e F g
1 
2  
3 
4 
5 
6 
7 
Course 8 
Objectives 9  
10 
REFERENCES
1. Michael Wooldridge, An introduction to multiagent systems , Wiley Publications, ISBN 0-471-4969

I-X, (2nd Edition)
2. Intelligent Software Agents by Richard Murch & Tony Johnson
3. Mobile Agents: Basic Concepts, Mobility Models, and the Tracy Toolkit by Peter Braun and Wilhelm
R. Rossak
4. Bigus & Bigus, " Constructing Intelligent agents with Java ", Wiley, 1997.
5. Bradshaw, " Software Agents ", MIT Press, 2000.
1. Russel, Norvig, "Artificial Intelligence: A Modern Approach", Second Edition, Pearson
Education, 2003.
2. Richard Murch, Tony Johnson, "Intelligent Software Agents", Prentice Hall, 2000.
3. Gerhard Weiss, “Multi Agent Systems – A Modern Approach to Distributed Artificial
Intelligence”, MIT Press, 2000.
CODE: MTCE-17-104
SUBJECT NAME: SOFT COMPUTING (ELECTIVE III)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives
To subject aims to educate the students about

1. Need of soft computing in the context of real life scenarios.
2. Various constituent methodologies underlying in the domain of soft computing.
3. Fundamentals of fuzzy sets and logic
4. Fuzzy logic based control/ expert systems.
5. Inductive logic and need for training in the context of machine learning.
6. Neuron models relating to supervised and unsupervised learning.
7. Training the neurons on given input/output class information.
8. Combining neural and fuzzy paradigms
9. Genetic modeling of a problem
10. Solving a problem with huge state space using genetic modeling and operators
11. Applying soft computing in common domains like IR, Drug design etc.
Unit I : Neural Networks:

History, overview of biological Neuro-system, Mathematical Models of Neurons, ANN
architecture, Learning rules, Learning Paradigms-Supervised, Unsupervised and reinforcement
Learning, ANN training Algorithms-perceptions, Training rules, Delta, Back Propagation
Algorithm, Multilayer Perception Model, Hopfield Networks, Associative Memories,
Applications of Artificial Neural Networks.
Unit II : Fuzzy Logic:

Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical Sets, Membership
Function, Fuzzy rule generation.
Unit III : Operations on Fuzzy Sets:
Compliment, Intersections, Unions, Combinations of Operations, Aggregation Operations.
Unit IV : Fuzzy Arithmetic:

Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals & Numbers, Lattice of
Fuzzy Numbers, Fuzzy Equations.
Unit V : Fuzzy Logic:

Classical Logic, Multivalued Logics, Fuzzy Propositions, Fuzzy Qualifiers,
Linguistic Hedges.
Uncertainty based Information: Information & Uncertainty, Nonspecificity of Fuzzy & Crisp
Sets, Fuzziness of Fuzzy Sets.
Genetic Algorithms, Scope & application areas, solution of 0-1Knapsack problem using GA
Course Outcomes
After the completion of the course, the students will be to able to

j) Discuss the various aspects of uncertainty in real life and inability of conventional
computing to handle them.
k) Relate real life problem contexts to soft computing paradigms tools
l) Design and use fuzzy sets and numbers in the context of various domains.
m) Design fuzzy rule based system for a control application like washing machine.
n) Identify the problems suitable for solution using neural networks
o) Train a perceptron network over a given input/output pattern information.
p) Design a genetic model for a given problem with huge state space.
q) Apply GA tools and solution to a problem to find an amicable solution for the same.
r) Design soft computing models to solve real life problems
Course Outcomes
a b C d e f g h i
1 √ √
2 √ √
3 √
Course 4 √ √
Objectives 5 √ √
6 √
7 √
8 √ √ √ √
9 √ √
10 √ √
11 √
REFERENCES
1. “Fuzzy sets and Fuzzy Logic: Theory and applications”,G.J. Klir,B.Yuan, PHI
2. “Introduction to Fuzzy sets and Fuzzy Logic”, M.Ganesh , PHI
3. “An Introduction to Fuzzy Control”, D Driankov, H Hellendoorn, M Reinfrank,
Narosa Publishing Company
4. “ Neural Networks: A classroom approach”, Satish Kumar , Tata McGraw Hill
5. Haykin S., “Neural Networks-A Comprehensive Foundations”, Prentice-Hall
International, New Jersey, 1999.
6. Anderson J.A., “An Introduction to Neural Networks”, PHI, 1999
CODE: MTCN-17-114
SUBJECT NAME: FUNDAMENTALS OF MIDDLEWARE TECHNOLOGIES

(ELECTIVE III)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To apprise students of parallel and distributed computing models and overview of their
evolution leading to concept of cloud computing.
2. To introduce concepts of client/server applications, types of client/server models, types of
architectures, message passing models and development tools available.
3. To discuss the design issues involved in developing different types of server applications
– iterative/connectionless, iterative/connection-oriented, concurrent/connectionless and
concurrent/connection-oriented, transport layer semantics available to develop such
applications.
4. To discuss the concept of middleware need in application development, types of
middleware in vogue – message based, RPC and Distributed object technology (CORBA)
based.
5. To familiarize students with internal architectural, object model and application
development based on CORBA middleware standards.
6. To introduce other distributed object models like RMI/EJB leading all the way to SOA
being designed using web services and REST technologies.
7. To introduce basic concept of cloud computing, types and service layers involved.
8. To familiarize students with importance of virtualization and its types and importance for
cloud computing.
9. To make students understand the basics of commodity clusters and map/reduce
programming technique for cloud based models.
10. To discuss research issues to be explored regarding resource allocation and load
balancing in cloud computing.
UNIT 1: PRINCIPLES OF PARALLEL AND DISTRIBUTED COMPUTING

Eras of Computing , Parallel vs. Distributed Computing , Elements of Parallel Computing ,
Hardware Architectures for Parallel Processing , Levels of Parallelism, Elements of Distributed
Computing, Architectural Styles for Distributed Computing, Technologies for Distributed
Computing , Distributed Object Frameworks , Service Oriented Computing
Unit II: CLIENT/SERVER COMPUTING:

Client Server architecture, mainframe-centric client server computing, downsizing and client
server computing, preserving mainframe applications investment through porting, client server
development tools, advantages of client server computing. Terminology & concepts –
Connectionless v/s Connection oriented, Stateful v/s Stateless, Algorithm & issues in server
design.
Unit III : PRINCIPLES OF MIDDLEWARE

Middleware – Peer to Peer Communication - RPC – MOM middleware -MOM VERSUS RPC-
ONLINE transaction processing - decision support systems - oltp versus, dss - programming
effort, client / server transaction processing - transaction models - tp monitors- Transaction
Monitoring Systems, GROUPWARE - COMPONENTS – Distributed Objects & Distributed
Components, Services and Support, Dynamic Data Exchange (DDE), Object Linking and
Embedding (OLE), Common Object Request Broker Architecture (CORBA). The server:
Detailed server functionality, the network operating system, available platforms, the network
operating system, available platform, the server operating system.
UNIT IV: WEB SERVICES

Web Services Architecture, Web services Architecture and its characteristics, core building
blocks of web services, standards and technologies available for implementing web services, web
services communication, basic steps of implementing web services, developing web services
enabled applications. Core fundamentals of SOAP: SOAP Message Structure, SOAP Encoding ,
SOAP message exchange models, SOAP communication and messaging, SOAP security.
UNIT V : CLOUD COMPUTING FUNDAMENTALS

Cloud Computing definition, private, public and hybrid cloud. Cloud types; IaaS,PaaS, SaaS.
Benefits and challenges of cloud computing, public vs private clouds, role of virtualization in
enabling the cloud; Business Agility: Benefits and challenges to Cloud architecture, Application
availability, performance, security and disaster recovery; next generation Cloud Applications.
Features of Cloud and Grid Platforms, Parallel and Distributed Programming Paradigms,
Programming Support of Google App Engine, Amazon Web Services (AWS) Programming,
Microsoft Azure Programming Support, Emerging Cloud Software Environments, Cloud
Computing and Resource Management, Cloud Architecture and Service Modeling, Middleware
Support for Cloud Resource Management
Course Outcomes:
a. The students will understand the different models of parallel and distributed computing
and essential differences between them.
b. The students will understand the different types of client/server applications and
respective design architectures.
c. The students will understand the design issues involved in server designs under different
situations and transport layer constructs available for the same.
d. The students will be able to design client/server applications for different class of ip-
addresses.
e. The students will understand the concept and importance of middleware layer in
distributed application design and various types of middleware technologies available.
f. The students will be able to write distributed applications based on DOT concepts using
CORBA toolkits.
g. The students will be to understand how distributed objected methodology has evolved
into a service based architecture and how web services and REST API implements the
same.
h. The students will be able to write generic program using JAVA and non-JAVA based
distributed object applications.
i. The student will be able to understand on-demand utility computing phenomenon known
as cloud computing. How this paradigm is different from cluster and grid computing.
j. The students will be able to understand how virtualization layer offers elasticity and
flexibility to cloud computing. What are the different types of virtualization layers in
existence at present?
k. The students will be able to design cloud based applications using map/reduce paradigm
for handing distributed file system based data.
l. The students will be able to understand how computation could be taken to data i.e. in-
situ rather than moving volume of data around.
m. The students will be able to understand many issues involve in cloud computing and
would be able to take up some topics for research activity.
a B c D e F g h i j k l m
1 √
2 √ √
3 √ √
4 √ √
5 √ √
6 √
7 √ √ √
8 √
9 √ √ √
10 √
REFERENCES
1. Distributed Computing, Principles and Applications, M.L.Liu, Pearson Education, 2004.
2. Kai Hwang, Geoffrey C. Fox, Jack J. Dongarra, “Distributed and Cloud Computing: From parallel
processing to IOT” Morgan Kaufmann Publishers; 1 edition [ISBN: 978-0-12-385880], 2012.
3. Building Web Services with Java, Second Edition, S. Graham and others, Pearson Edn., 2008.
CODE: MTCN-17-116
SUBJECT NAME: ROUTING TECHNOLOGIES (ELECTIVE III)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives
The objective of the course is
1. To make students familiar about Internet protocol addressing, protocol stack required for
the communication between entities whose location is far away.
2. To make students familiar about routing algorithms required to transfer information or
data between two entities.
3. The objective of the course is to make students familiar about various routing protocols
and their details required to establish communication between entities.
4. To make students familiar about Mobile Adhoc Networks and various protocols used in
this networks for the purpose of routing data and information.
5. To make students familiar about Wireless Sensor Networks and various protocols used in
this networks for the purpose of routing data and information.
UNIT 1 : Networking and Network Routing

An Introduction: Addressing and Internet Service: An Overview, Network Routing: An
Overview, IP Addressing, On Architectures, Service Architecture, Protocol Stack Architecture,
Router Architecture, Network Topology Architecture.
Routing Algorithms: Shortest Path and Widest Path: Bellman–Ford Algorithm and the Distance
Vector Approach, Dijkstra’s Algorithm, Comparison of the Bellman–Ford Algorithm and
Dijkstra’s Algorithm, Shortest Path Computation with Candidate Path Caching, Widest Path
Computation with Candidate Path Caching, Widest Path Algorithm, k-Shortest Paths Algorithm
UNIT 2 : Routing Protocols

Framework and Principles: Routing Protocol, Routing Algorithm and Routing Information,
Representation and Protocol Messages, Distance Vector Routing Protocol, Link State Routing
Protocol, Path Vector Routing Protocol, Inter domain Routing-Classless Interdomain routing
(CIDR), Interior Gateway routing protocols (IGRP) - Routing Information Protocol (RIP), Open
Shortest Path First (OSPF), Exterior Gateway Routing Protocol (EGRP) - Border
Gateway Protocol (BGP).
U NIT 3 : Routing in Mobile Adhoc Networks

Introduction to Ad hoc Networks – Features/ Characteristics, Types and Applications,
Limitations, Advantages and Disadvantages, Classification of Routing Protocols in Ad hoc
Networks – Proactive Routing Protocols (DSDV, OLSR), Reactive Routing Protocols (DSR,
AODV), Hybrid Routing Protocols (ZRP)
UNIT 4 : Routing in Wireless Sensor Networks (WSNs)

Introduction to WSNs, Routing Challenges in Wireless Sensor Networks, Classification of
Routing protocols: Based on Mode of Functioning and Type of Target Applications, According
to the Participation style of the Nodes Depending on the Network Structure
Course Outcome
By the end of the course, students should be able
a. To understand Internet protocol addressing, protocol stack required for the
communication between entities whose location is far away.
b. To understand routing algorithms required to transfer information or data between two
entities.
c. To understand various routing protocols and their details required to establish
communication between entities
d. To understand Mobile Adhoc Networks and its various protocols used in this networks
for the purpose of routing data and information.
e. To understand Wireless Sensor Networks and various protocols used in this networks for
the purpose of routing data and information.
f.
Course a b c d e
Objective
1     
2    
3 
4 
5 
REFERENCES
1. Deepankar Medhi, Kartikeyan Ramasamy , “Network Routing – Algorithms, Protocols,

Architecture”, Morgan Kauffman Series Publication.
2. Forouzan, Data Communications and Networking, TMH, 4 th Edition, 2006.
3. Subir Kumar Sarkar, T G Basavaraju and C Puttamadappa, “Ad Hoc Mobile Wireless Networks –
Principles, Protocols and Applications”, Auerbach publications
4. Kazem Sohrary, Wireless sensor newtroks, Technology, Protocols and applications,
Wiley Publishers
CODE: MTIT-17-114
SUBJECT NAME: WEB TECHNOLOGIES (ELECTIVE III)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To introduce the concept of essentials on web, client – server communication , internet

protocols, markup language.
2. To make the student familiar with XML, DTD and Document Object Model.
3. To make the student familiar with client side programming using HTML, DHTML,
Javascript.
4. To make the student familiar with server side scripting using JSP, Java servlets, EJB.
5. To make the student familiar with the wireless LAN including Bluetooth technology.
6. To introduce the concept of web services and HTML 5.0.
Unit I: Introduction: Web Essentials

Clients, Servers, and Communication. The Internet-Basic Internet Protocols -The World Wide
Web-HTTP request message-response message-Web Clients, Web Servers, Markup
Languages: HTML: list, table, images, frames, forms, CSS.
Unit II:XML
Introduction, Role of XML, Difference between XML and HTML, XML Tree, XML Syntax,
Elements, Attributes, Validation, XML DTD: Introduction, Using DTD in an XML Document,
Element Type Declaration, Attribute Declaration, Entity Declaration, CDATA, DTD validation,
XML schemes: presenting and using XML; XML DOM: DOM Nodes, Document Node,
Element Node, Text Node, Attribute Node, Manipulating DOM Tree, XML Transformation,
XML Application.
Unit III:Client Side Programming

Java script: Introduction, variables, operators, Control structure, Arrays, Functions, documents,
DOM, forms, statements, functions, objects; events and event handling, Accessing and
Manipulating HTML Elements, Data entry and Validations, DHTML.
Unit IV: Server Side Programming

JSP: Creating simple JSP Pages, templating ,Request time expression,Request & Response
objects, Reading parameter values.
Java Servlets- Architecture -Overview-A Servelet-Generating Dynamic Content-Life Cycle-
Parameter Data-Sessions-Cookies- URL Rewriting-Other Capabilities-Data Storage Servelets
and Concurrency
EJB – Basics of EJB – Types of Beans – Development of Session Beans – Steps – Creating &
Implementing Interfaces – Writing Deployment descriptors – Packaging and deploying bean –
using the bean from a client – Development of stateful session bean. Entity beans – Features
(Basics of developing and using entity beans)
Unit V:
Web services, Design and modeling of web services, Technologies for Implementing web
services, Current applications of advanced web technologies. HTML 5.0, WebGL, SVG, Social
web and related technologies, - Ontology modeling, Languages for representing ontologies on
the web, Rules and inferences,
Course Outcomes
Upon successful completion of the course, the student will be:
a. Able to understand the concept of client server communication over web, Internet
protocols, HTTP, and web server.
b. Able to make a web page using HTML, list, tags, forms, CSS.
c. Familiar with XML, role of XML, syntax and attributes of XML.
d. Able to differentiate between XML and HTML and will be familiar with CDATA, DTD
validation, XML schemes, manipulation of DOM tree, XML Transformation.
e. Able to make the application using XML, XML DTD, XML DOM
f. Able to perform client side programming, validation and event handling using Javascript,
DOM, functions, arrays and objects.
g. Able to perform server side scripting, reading and sending the data from and into the
database using JSP.
h. Familiar with Java Servlets, cookies, Java beans, creation and implementation using EJB,
session beans and entity bean.
i. Able to understand the concept of web services, their desing and modelling, HTML 5.0,
WebGL,SVG.
a b c d e f G h i
1 √ √
2 √ √ √
3 √
4 √ √
5 √
REFERENCES
1. Uttam K. Roy “Web Technologies”, Oxford Publication.

2. Jeffrey C.Jackson, "Web Technologies--A Computer Science Perspective", Pearson
3. XML by Example: Building Ecommerce applications – Sean McGrath,Pearson Education Asia
4. Java Server pages – Larne Pekowsky – Pearson Education Asia
5. JSP: Java server pages – Barry Burd, IDG Books India
6. EJB Design Patterns – Floyd Marinescu
7. Internet & Web Technologies – Raj Kamal, TMH
CODE: MTCN-17-201
SUBJECT NAME: NETWORK MANAGEMENT
NO OF CREDITS: 4
M.TECH SEMESTER III SESSIONAL: 25
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. Understand the basics of Networks.

2. Gain the in hand knowledge of networking commands to manage and setup the LAN.
3. Troubleshoot the problems in the LAN.
4. Become aware of the various Security threats.
5. Need for security and cryptography.
6. How to securely transfer data on network using various cryptographic algorithms.
7. Knowledge about various operating systems including Windows and UNIX.
8. Knowledge about the various UNIX Commands.
9. Be able to write a shell script to perform the various operations.
Unit I : Network Management

Data and Telecommunication Networks, Review of communication protocols and standards,
Review of Network topology (LANs, WANs, MANs) and services, Network Management goals,
organization and functions, Network Management standards and Models.
Unit II : SNMP Management Versions

SNMP VI Network Management-Organization, information models, communication and
functional Models, SNMP Management: V2, V3; SNMP Management RMON; Modification in
SNMPV2, System Architecture and Structure of Management Information, SNMPV2 MIB,
Protocol and its complexity with SNMP. -SNMPV3 Architecture Applications and Management
Information base. SNMPV3 Security Models and access Controls, SNMP Management RMON.
Unit III : Ethernet & Optical Network Management

SONET/SDH, DWDM, MetroEthernet, MPLS/GMPLS, pseudo-wire technologies and their
OAM&P, Telecommunication Management Network, Models Standards, Architecture and its
implementation issues. Network Management tools and Applications. Web based Management
JAVA Management extensions, OSI model and OSI management areas – FCAPS.
Course Outcome:
a) Is able to setup and manage LAN

b) Is able to troubleshoot the network with the help of networking commands.
c) Is able to understand the importance of hardware and software security.
d) Is able to setup firewall and protect the system from various types of attacks.
e) Is able to apply various stream or blocked cryptographic algorithms to securely
transfer data on networks.
f) Deep knowledge of UNIX commands.
g) Is able to write a program in shell script.
Course Outcomes----
Course Objectives-
a B c d E f G
1 √
2 √
3 √
4 √ √
5 √
6 √
7 √
8 √
9 √
REFERENCES
1. Network Management: Principles and Practice by Mani Subramanian

2. Network Management Fundamentals by Alexander Clemm
CODE: MTCN-17-203
SUBJECT NAME: MOBILE ADHOC NETWORKS
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To make the students familiar with wireless network and adhoc network.
2. To introduce the advantages and issues related to mobile adhoc network routing.
3. To make the students familiar with different table driven base protocols for mobile adhoc
networks.
4. To introduce the concept of on demand approach and various protocols related to this
approach.
5. To make the student familiar with the GPS system and introduce the concept of location
based routing.
6. To make the student aware about the quality of service in mobile adhoc environment. To
find out various QoS parameters and how QoS can be achieved in adhoc environment.
7. To introduce the necessity of energyand how to manage the energy of a node and
network in adhoc networks.
8. To make the student aware regarding security aspects in mobile adhoc network.
UNIT I : Introduction
Wireless Networks, Infrastructure and Infrastructure less Wireless Networks, Ad hoc Wireless
Networks, Heterogeneity in Mobile Devices, Types of Ad hoc Mobile Communications,
Challenges Facing Ad hoc Mobile Networks, Issues in Designing a Routing Protocol for Ad Hoc
Wireless Networks, classifications of Routing Protocols: Table Driven Routing Protocols, On-
Demand Routing Protocols.
UNIT II : Table-Driven Ad hoc Routing Protocols

Destination Sequenced Distance Vector (DSDV), Wireless Routing Protocol (WRP), Cluster
Switch Gateway Routing (CSGR).
On-Demand Ad hoc Routing Protocols:Ad hoc On–Demand Distance Vector Routing
(AODV), Dynamic Source Routing (DSR) ,Temporally Ordered Routing Algorithm (TORA) ,
Signal Stability Routing (SSR) , Location–Aided Routing (LAR) , Power–Aware Routing (PAR)
, Zone Routing Protocol (ZRP).
UNIT III : QoS in Ad hoc Networks
Issues and Challenges in Providing QoS in Ad hoc Wireless Networks , classifications of QoS
Solutions , IntServ, DiffServ, Ticket-Based QoS Routing Protocol, QoS-Enabled Adhoc On-
Demand Distance Vector Routing Protocol.
Energy Management:Need for Energy Management in Ad hoc Wireless Networks –
Classification of Energy Management Schemes – Battery Management Schemes, Transmission
Power Management Schemes, System Power Management Schemes.
UNIT IV : Security in Ad hoc Networks

Network Security requirements, Challenges in security provisioning, Network security attacks,
Key Management in ad hoc network, Security Aware Ad hoc Routing Protocol
Course Outcomes
Upon successful completion of the course, the student will be able to:
a. Identify different types of wireless network and how wireless network is advantageous
over the traditional wired network.Identify various issues related to wireless
communication.
b. Understand the concept of adhoc network and differentiate between infrastructure based
and infrastructure less networks.
c. Understand the concept of routing and issues related to routing in mobile adhoc network.
d. Classify different categories of mobile adhoc network.
e. Understand the concept of table driven approach and various routing protocols available
for table driven approach.
f. Advantages and disadvantages of various routing protocols of proactive routing.
g. Understand the on demand approach. Differentiate various reactive routing protocols
based on their strategies.
h. Understand the concept of GPS and location based routing. What are the advantages and
disadvantages of location based routing .
i. Understand how zone based routing make use of both proactive and reactive approaches.
j. Understand QoS and its parameters. Classify QoS solution, why QoS provision is
difficult in adhoc environment and what are various approaches related to QoS in
MANET.
k. Understand the need of energy management in MANET, What are the various energy
management schemes available in MANET.
l. Understand the concept of security in MANET, requirement of security in adhoc
network.
m. Differentiate different types of security attacks in MANET and various solutions
available in MANET.

a b c d e f G h i j k l m
1 √ √ √
2 √ √
3 √ √ √
4 √ √ √
5 √ √ √
6 √ √
7 √ √
8 √ √ √ √
REFERENCES
1. C. Siva Ram Murthy and B. S. Manoj, ―Ad Hoc Wireless Networks Architectures and
Protocols‖, Prentice Hall, PTR, 2004.
2. C. K. Toh, ―Ad Hoc Mobile Wireless Networks Protocols and Systems‖, Prentice Hall, PTR,
2001.
3. Charles E. Perkins, ―Ad Hoc Networking‖, Addison Wesley, 2000
CODE: MTCN-17-211
SUBJECT NAME: HIGH PERFORMANCE NETWORKS (ELECTIVE IV)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To make the students familiar with High Speed Network technologies.
2. To make students aware of advantages and disadvantages of high speed technologies.
3. Study of techniques available for congestion control traffic management.
4. How to make congestion control in TCP and ATM.
5. To study integrated and differentiated services architecture.
6. Protocols for high speed communication.
UNIT I
Introduction to computer networks - Review of OSI/ISO model – Introduction to high speed
networks - High speed LANs – Fast Ethernet - Switched Fast Ethernet - Gigabit Ethernet –
ISDN, FDDI, Frame relay - operations and layers.
UNIT II
Introduction to SONET – SONET/SDH Layers – SONET Frame Structure – Sonet Physical
Layer. Cell format and Switching Principles – Protocol Architecture – Service categories.
TCP/IP protocol Suite – IP Packet Header – TCP packet header – User services – Protocol
Operation – Connection Establishment – UDP.
UNIT III
Congestion control in Data Networks and Internets – Effects of Congestion – Congestion
Control in Packet Switched Networks. Frame relay Congestion Control – Traffic rate
Management – Congestion Avoidance. ATM Traffic and Congestion Control – Attributes –
Traffic Management Framework – Traffic Control – ABR Traffic Management. TCP Traffic
Control – Flow Control – TCP Congestion Control – Timer Management – Window
Management.
UNIT IV
Introduction to Quality of Service - Integrated Services – Differentiated Services – Protocols for
QoS support - Resource Reservation (RSVP) – Multiprotocol Label Switching (MPLS) – Real-
Time Transport Protocol (RTP).
UNIT V
Introduction to Optical networks – Wavelength division multiplexing (WDM) – Introduction to
broadcast-and-select networks - Switch architectures - channel accessing – Wavelength routed
networks – Switch architectures - Routing and wavelength assignment – virtual topology design–
IP over SONET over ATM over WDM – IP over ATM over WDM – IP over WDM.
Course outcomes:
a. Students will be able to understand basic high speed networks like Frame relay and ATM.
b. Students will be familiar with advantages and disadvantages of high speed network.
c. Students will be aware of congestion control traffic management techniques.
d. Students will be aware of TCP and ATM congestion control techniques.
e. To learn the functionality of integrated and differentiated services architecture.
f. Familiarity with various high speed protocols currently available.
Mapping course objectives and course outcomes:
Course outcomes -------------

a b C d e f
1 
Course 2 
Objectives
3 
4 
5 
6 
REFERENCES
1. William Stallings, “High-Speed Networks and Internets”, Pearson Education, 2nd Edition,
2. 2002. (Unit I, II, III, and IV)
3. Fred Halsall, “Multimedia Communications: Applications, Protocols, and Standards”,
4. Pearson Education Asia, 2001. (Unit I and II)
5. Rajiv Ramaswami and Kumar N. Sivarajan, “Optical Networks: A Practical Perspective”,
6. Morgan Kaufmann (Elsevier Indian Edition), 2nd Edition, 2004. (Unit II and V).
7. C. Siva Ram Murthy and Mohan Gurusamy, “WDM Optical Networks: Concepts, Design
8. and Algorithms”, PHI, 2002. (Unit V)
9. Laon-Garcia and Widjaja, “Communication Networks: Fundamental Concepts and key
10. Architectures”, Tata McGrawHill, 2000.
11. Behrouz A. Forouzan, “Data Communications and Networking”, Tata McGraw-Hill,
12. 2nd edition, 2000.
CODE: MTCN-17-213
SUBJECT NAME: OPTICAL NETWORK DESIGN (ELECTIVE IV)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To make students familiar with SONET and SDH Architecture.
2. To make students familiar with Add Drop Multiplexer.
3. To make students aware of wavelength division multiplexing techniques.
4. To introduce various time division multiplexing techniques.
5. To introduce T-Carrier multiplexed hierarchy.
6. To introduce various frame categories of SONET.
7. To study SONET architecture in detail.
8. To introduce various SONET protection mechanisms.
9. To introduce SDH integration of TDM signals.
10. To study SDH architecture in detail.
11. To introduce various SDH protection mechanisms.
12. To study Wavelength division multiplexing and various techniques.
13. To study about dispersion and compensation in WDM systems.
14. To study about OSNR and OSNR calculation for amplifiers.
15. To study about LDP protocol in detail.

16. Label allocation scheme and routing.
17. To study about label stacking feature.
UNIT I : Introduction to Optical Networking

Introduction SONET/SDH and dense wavelength-division multiplexing (DWDM) , Add/drop
multiplexers (ADMs), DWDM, CWDM, Time-Division Multiplexing, Synchronous TDMs,
Statistical TDMs, Circuit Switched Networks, T-Carrier multiplexed Hierarchy, DS framing, DS
multiframing formats, D4 Superframe, D5 extended superframe, E-Carrier multiplexed
Hierarchy, TDM network elements, and Ethernet switching.
UNIT II : SONET Architectures

SONET integration of TDM signals, SONET electrical and optical signals, SONET Layers,
SONET framing, SONET transport overhead, SONET alarms, multiplexing, virtual tributaries,
SONET network elements, SONET topologies, SONET protection mechanisms, APS, two-fiber
UPSR, DRI, and two-fiber and four-fiber BLSR rings.
UNIT 3 : SDH Architectures

SDH integration of TDM signals, SDH electrical and optical signals, SDH Layers, SDH framing,
SDH higher layer graming, SDH transport overhead, SDH alarms, multiplexing, virtual
containers, SDH network elements, SDH topologies, SDH protection mechanisms, APS, 1+1
protection, 1:1protection, 1:N protection, Unidirection v/s bidirectionsl rings, Path and multiplex
section switching, Subetwork Connection protection rings, DRI, and two-fiber and four-fiber
Multiplex section-shared protection rings.
UNIT 4 : Wavelength-Division Multiplexing

Wavelength-division multiplexing principles, coarse wavelength-division multiplexing, dense
wavelength-division multiplexing, the ITU grid, WDM systems, WDM characteristics,
impairments to transmission, and dispersion and compensation in WDM systems. Optical link
design, factors affecting system design, point-to-point link based on Q-factor and OSNR, OSNR
calculations for fiber amplifiers.
UNIT 5 : Label Distribution Protocols

The Label Distribution Protocol (LDP), Label Spaces, LDP Sessions, and Hello Adjacencies ,
The LDP PDU Format, The LDP Message Format, The LDP Messages, The Multi-Protocol
Label Switching (MPLS) Architecture, Label Allocation Schemes, The Next Hop Label
Forwarding Entry (NHLFE), Explicit Routing, An Example of the Use of the Label Stack,
Schemes for Setting up an LSP
Course Outcome:
a. Students will be familiar with SONET and SDH Architecture.

b. Students will be familiar with Add Drop Multiplexer.
c. Students will be aware of wavelength division multiplexing techniques.
d. Students will be aware of various time division multiplexing techniques.
e. Students will know T-Carrier multiplexed hierarchy.
f. Students will be aware of various frame categories of SONET.
g. Students will be aware of SONET architecture in detail.
h. Students will be aware of various SONET protection mechanisms.
i. Students will come to know how SDH integration of TDM signals is done.
j. Students will come to know about SDH architecture in detail.
k. Students will be aware of various SDH protection mechanisms.
l. Students will be aware of Wavelength division multiplexing and various techniques.
m. Students will learn dispersion and compensation in WDM systems.
n. Students will be aware of OSNR and OSNR calculation for amplifiers.
o. Students will be aware of LDP protocol in detail.
p. Students will learn about Label allocation scheme and routing.
q. Students will learn about label stacking feature.
Mapping of course objectives and course outcomes:
Course outcomes------
Cou a b c d e f g h i j k l m n o p q
rse 1 
2 
Obj
3 
ecti
4 
ves 5 
6 
7 
8 
9 
10 
11 
12 
13 
14 
15 
16 
17 
REFERENCES
1. “Optical Network Design and Implementation (Networking Technology)”, by Vivek Alwayn,

Cisco press
2. “Handbook of Fiber Optic Data Communication”, Third Edition: A Practical Guide to Optical
Networking by Casimer DeCusatis
3. “DWDM Network Designs and Engineering Solutions”, By Ashwin Gumaste, Tony Antony,
Cisco press
CODE: MTIT-17-112
SUBJECT NAME: ADVANCED CLIENT /SERVER COMPUTING (ELECTIVE IV)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To make student familiar with various client - server models.
2. To make the student familiar with Network programming.
3. To introduce with the components used in client server applications.
4. To make the student familiar with client server network.
5. To introduce with the middleware technologies.
6. Student gets familiar with development of client server system.
Unit I: Client/Server Computing

Client Server architecture, mainframe-centric client server computing, downsizing and client
server computing, preserving mainframe applications investment through porting, client server
development tools, advantages of client server computing. Terminology & concepts –
Connectionless v/s Connection oriented, Stateful v/s Stateless, Algorithm & issues in server
design.
Unit II : Components of Client/Server application

The client: services, request for services, RPC, windows services, fax, print services, remote boot
services, other remote services, Utility Services & Other Services, Dynamic Data Exchange
(DDE), Object Linking and Embedding (OLE), Common Object Request Broker Architecture
(CORBA). The server: Detailed server functionality, the network operating system, available
platforms, the network operating system, available platform, the server operating system.
Unit III : Client/Server Network

connectivity, communication interface technology, Interposes communication, wide area
network technologies, network topologies (Token Ring, Ethernet, FDDI, CDDI) network
management, Client-server system development: Software, Client–Server System Hardware:
Network Acquisition, PC-level processing unit, Macintosh, notebooks, pen, UNIX workstation,
x-terminals, server hardware.
Unit IV :
Middleware – Peer to Peer Communication - RPC – MOM middleware -mom versus rpc- online
transaction processing - decision support systems - oltp versus, dss - programming effort, client /
server transaction processing - transaction models - tp monitors- transaction monitoring systems,
groupware - components – Distributed Objects & Distributed Components, Services and
Support, system administration, Availability, Reliability, Serviceability, Software Distribution,
Performance, Network management, Help Disk, Remote Systems Management Security, LAN
and Network Management issues.
Unit V: Client/Server System Development

Training, Training advantages of GUI Application, System Administrator training, Database
Administrator training, End-user training. The future of client server Computing Enabling
Technologies, The transformational system.
Course Outcomes:
a. The students will be aware about the client server computing, Evolution of corporate
computing models.
b. The student will be aware with the algorithm and issues in server design.
c. The student will be familiar with networking programming in java using java.net
package.
d. The student will be able to implement the two way communication between a client and
server.
e. The student will be familiar with utility services, dynamic data exchange, OLE, CORBA,
network operation system and server operating system.
f. The student will be familiar with the inter-process communication, network topology,
network management, client server system hardware and network Acquisition etc.
g. The student will be familiar with peer to peer communication, MOM middleware, online
transaction processing.
h. The student will be aware with client server transaction processing, transaction models,
transaction monitoring system.
i. The student will be familiar with Groupware components, system management security
and network management issues.
j. The student will be familiar with client server system development.
Course
Outcomes
------->
a B c d e f g h i J
1 √ √
2 √ √
3 √
4 √
5 √ √ √
6 √
REFERENCES
1. Patrick Smith & Steave Guengerich, “Client / Server Computing”, PHI

2. Dawna Travis Dewire, “Client/Server Computing”, TMH
3. Java programming with CORBA 3rd Edition, G.Brose, A Vogel and K.Duddy,
4. Wiley-dreamtech, India John wiley and sons
5. Distributed Computing, Principles and applications, M.L.Liu, Pearson Education
6. Client/Server Survival Guide 3rd edition Robert Orfali Dan Harkey and Jeri Edwards, John
Wiley & Sons
CODE: MTCE-17-211
SUBJECT NAME: NATURAL LANGUAGE PROCESSING (ELECTIVE IV)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To introduce the students difference levels/stages of natural language processing.

2. To make the students familiar with applications and open problems of/in NLP and NLU.
3. To introduce concept of Formal languages and grammars: Chomsky hierarchy and
problems associated with them.
4. To introduce the top down and the bottom up parsing approaches and their respective
types of parsers.
5. To introduce concept of grammars for Natural Language (like ATN & RTN) and their
problem such as ambiguity.
6. To make the students familiar with the basic techniques of parsing like CKY, Earley &
Tomita’s algorithms.
7. To introduce the students with Morphology of natural languages by taking examples from
Hindi, English.
8. To make the students familiar with Semantics-knowledge and strategies for semantic
understanding.
9. To make the students familiar with speech recognition and issues associated with it.
10. To introduce the HMM model for speech recognition.
UNIT – I
Introcution to NLP and NLU – Applications of NLP & NLU, open problem, Differences
levels of Language Analysis
UNIT – II
Syntatic processing – Linguistic Background – Outline of English Syntax, Top down &
Bottom up processing, Finite state models and morphological processing.
Grammer for Natural language, Ambiguity Resolution.
UNIT – III
Semantic Introduction – Semantic and logical form, Ambiguity, speech acts and embedded
Sentences, other strategies for Sementic Interpretation.
UNIT – IV
Speech Recognition and Spoken language – Issue in Speech Recognition sound structure,
Signal processing, HMM model, NLP, NLU and speech Recognition.
Course Outcomes:
a. The student will be familiar with difference levels/stages of natural language processing.
b. The student will be able to understand the familiar with applications and open problems
of/in NLP and NLU.
c. The student will be able to understand types of Formal languages and grammars:
Chomsky hierarchy and problems associated with them. They will also be able to resolve
such problems.
d. The student will be familiar with the top down and the bottom up parsing approaches and
their respective types of parsers.
e. The student will be able to write small grammars for simple English sentences.
f. The student will be familiar with parser like CKY, Earley & Tomita’s.
g. The student will be able to do Morphology of words taken from natural languages like
Hindi, English.
h. The student will be familiar with Semantics-knowledge and its importance in
understanding the language sentence. The student will be also be able to write some
simple semantic structures and will be able to use them for semantic analysis.
i. The student will be familiar with speech recognition and issues associated with it. They
will also be familiar with HMM and will be able to apply that for speech recognition.
Course Outcomes--------->
A b c d e f G h i
1 √
2 √
3 √
4 √
5 √
6 √
7 √
8 √
9 √
10 √
REFERENCES
1. James Allen, “Natural Language Understanding”, Pearson education, 2003

2. Rajeev S., Zevarsky, “Speech processing and Recognition , PHI, 2002
CODE: MTCN-17-215
SUBJECT NAME: CLOUD COMPUTING (ELECTIVE V)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To introduce the basic concepts of Cloud Computing, service layers involved, deploy
applications over cloud computing platform, Utility Computing and Elastic Computing .
2. To discuss the various Cloud Technologies: AJAX , web services and software for enterprise
applications.
3. To discuss the cloud data in Relational databases and various filesystems: GFS, HDFS, BigTable,
HBase and Dynamo in cloud.
4. To discuss in detail the Map-Reduce concept, Map-Reduce model in parallel computing and its
application.
5. To introduce the fundamentals of cloud security, its tool and cloud computing security
architecture.
6. To familiarize the students with challenges involved in cloud computing security: Virtualization
security management.
7. To discuss the issues involved in cloud computing while implementing real time application over
cloud.
8. To discuss the issues regarding intercloud environments, QOS, Dependability, data migration,
streaming.
9. To make students understand the basics of cloud middleware, Mobile Computing, Grid
Computing, Sky Computing.
10. To discuss research issues to be explored regarding load balancing, resource optimization,
dynamic resource provisioning in cloud computing.
Unit 1:
Introduction to Cloud Computing, Definition, Characteristics, Components, Cloud provider,
SAAS, PAAS, IAAS and Others, Organizational scenarios of clouds, Administering &
Monitoring cloud services, benefits and limitations, Deploy application over cloud, Comparison
among SAAS, PAAS, IAAS, Cloud computing platforms: Infrastructure as service: Amazon
EC2,Platform as Service: Google App Engine, Microsoft Azure, Utility Computing, Elastic
Computing
Unit 2:
Introduction to Cloud Technologies, Study of Hypervisors Compare SOAP and REST
Webservices, AJAX and mashups-Web services: SOAP and REST, SOAP versus REST,
AJAX: asynchronous 'rich' interfaces, Mashups: user interface services Multitenant software:
Multi-entity support, Multi-schema approach, Multi-tenance using cloud data stores, Data access
control for enterprise applications
Unit 3:
Data in the cloud: Relational databases, Cloud file systems: GFS and HDFS, BigTable, HBase
and Dynamo. Map-Reduce and extensions: Parallel computing, The map-Reduce model, Parallel
efficiency of Map-Reduce, Relational operations using Map-Reduce, Enterprise batch processing
using Map-Reduce, Introduction to cloud development, Example/Application of Mapreduce,
Features and comparisons among GFS,HDFS etc, Map-Reduce model
Unit 4:
Cloud security fundamentals, Vulnerability assessment tool for cloud, Privacy and Security in
cloud Cloud computing security architecture: Architectural Considerations- General Issues,
Trusted Cloud computing, Secure Execution Environments and Communications, Micro-
architectures; Identity Management and Access control-Identity management, Access control,
Autonomic Security Cloud computing security challenges: Virtualization security
management- virtual threats, VM Security Recommendations, VM-Specific Security techniques,
Secure Execution Environments and Communications in cloud.
Unit 5:
Issues in cloud computing, Implementing real time application over cloud platform
Issues in Intercloud environments, QOS Issues in Cloud, Dependability, data migration,
streaming in Cloud. Quality of Service (QoS) monitoring in a Cloud computing environment.
Cloud Middleware. Mobile Cloud Computing. Inter Cloud issues. A grid of clouds, Sky
computing, load balancing, resource optimization, resource dynamic reconfiguration, Monitoring
in Cloud
Course Outcomes:
a. The students will understand the concept of cloud computing with its service layers and
Utility Computing and Elastic Computing .
b. The students will understand deployment of applications over cloud computing platform.
c. The students will be able to understand various Cloud Technologies, web services and
software involved in cloud computing to design enterprise applications.
d. The students will be able to manage cloud data in relational databases and file systems in
cloud computing.
e. The students will understand the concept of Map-Reduce and how Map-Reduce works in
analysis of data in parallel computing .
f. The students will be able to design cloud based applications using map/reduce paradigm
for handing distributed file system based data.
g. The students will be able to understand concept of cloud security, its tool and architecture
of cloud computing security.
h. The students will be able to understand the challenges involved in cloud computing
security and how VMs can be secured in Virtualization security management
i. The students will be able to understand how real time applications can be implemented
over cloud platform.
j. The students will understand how the various issues arise due to Intercloud environments,
QOS, Dependability, data migration and streaming in cloud
k. The student will be able to understand on-demand utility computing phenomenon known
as cloud computing. How this paradigm is different from Mobile cloud computing, grid
computing, sky computing.
l. The students will be able to understand how computation could be taken to data i.e. in-
situ rather than moving volume of data around.
m. The students will be able to understand many issues involve in cloud computing and
would be able to take up some topics for research activity.
a B c d e f g h i j k l m
1 √ √ √
2 √
3 √
4 √ √
5 √
6 √
7 √ √
8 √ √
9 √ √
10 √
REFERENCES
1. Cloud Computing by Judith Hurwitz, R.Bloor, M.Kanfman, F.Halper (Wiley India Edition)
2. Enterprise Cloud Computing by Gautam Shroff,Cambridge
3. Cloud Security by Ronald Krutz and Russell Dean Vines, Wiley-India
4. Google Apps by Scott Granneman,Pearson
5. Cloud Security & Privacy by Tim Malhar, S.Kumaraswammy, S.Latif (SPD,O’REILLY)
6. Cloud Computing : A Practical Approach, Antohy T Velte, et.al McGraw Hill,
7. Cloud Computing Bible by Barrie Sosinsky, Wiley India
CODE: MTCN-17-217
SUBJECT NAME: WIRELESS SENSOR NETWORKS (ELECTIVE V)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To make the student understand the basic concepts of WSN and its distinguishing
features from its successor networks
2. To understand the application domain of WSN
3. To understand the middleware principle and design issues of WSN
4. To understand the operating system design issues of WSN
5. To understand the physical layer protocols and their design issues
6. To discuss the challenges in designing various MAC and routing protocols for WSN
7. To understand the taxonomy of routing protocols of WSN
8. To discuss the transport layer and application layer protocols of WSN
9. To discuss the security mechanism and attacks in WSN
10. To impart the detailed knowledge of IEEE 802.15.4 and Zigbee Security
Unit I : OVERVIEW OF WIRELESS SENSOR NETWORKS

Basic definition and concepts of Wireless Networks, design principles for WSNs, comparison of
MANET & WSN, Architecture and Protocol Stack of WSN, Unique constraints and challenges
of WSNs, Applications of WSNs(Military Applications, Environmental Applications, Health
Applications, Home Applications).
Unit II : MIDDLEWARE & OPERATING SYSTEMS FOR WSN

WSN Middleware Principles, Middleware Architecture, Existing Middleware (Milan,
IrisNET,CLMF,MLM),Operating systems Design Issues, Examples of Operating Systems
Unit III : PHYSICAL & DATA LINK LAYER OF WSN

Physical Layer Technologies & Standards, Channel Coding,Source Coding, PHY Layer
Standards,
Challenges for MAC, Classification of MAC Protocols , Contention free and Contection Based
MAC Protocols.
Unit IV : NETWORK LAYER

Challenges for Routing,Classification of Protocols, Data–Centric and Flat Architecture Protocols
(Flooding,Gossiping,SPIN) Heirarchical protocols ( LEACH,PEGASIS,TEEN,APTEEN ),
Location Based(Unicast, Multicast, GeoCast) and QoS based(Sequential Assignment,SPEED)
Routing Protocols.
Unit V : TRANSPORT & APPLICATION LAYER

Challenges for Transport Layer, RMST Protocol, PSFQ Protocol, CODA Protocol, ESRT
Protocol
Source Coding, Query Processing, Network Management.
Unit VI : SECURITY IN WSN

Challenges of Security in WSN, Security Attacks in WSN, Protocols and Mechanisms for
Security, IEEE 802.15.4 and ZigBee Security
Course Outcomes
At the end of the course/session the student would be
a. Acquainted with the basic concept of WSN

b. Become familiar with the application domain of WSN
c. Learned the middleware architecture of WSN
d. Have a detailed knowledge of the design principles for operating system of WSN
e. Learned the physical and data link layer protocols of WSN
f. Acquainted with the various categories of routing protocols of WSN
g. Become familiar with the transport and application layer protocols available in WSN
h. Become familiar with the various types of attacks in WSN and their security mechanisms
Course Outcomes
a b c d e f g h
1 
2 
3 
Course 4 
Objectives 5  
6 
7  
8 
9  
10 
REFERENCES
1. Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003, ISBN : 0-470-86736-1
2. Holger Karl & Andreas Willig, " Protocols And Architectures for Wireless SensorNetworks" ,
John Wiley, 2005, ISBN : 0-470-09510-5.
3. Ian F. Akyildiz and Mehmet Can Varun ” Wireless Sensor Networks” John Wiley ISBN 978-0-
470-03601-3.
4. Kazem Sohraby, Daniel Minoli, & Taieb Znati, “Wireless Sensor Networks-Technology,
Protocols, And Applications”, John Wiley, 2007, ISBN :978-0-471-74300-2
CODE: MTCN-17-219
SUBJECT NAME: SOA & WEB SERVICES (ELECTIVE V)
NO OF CREDITS: 4
L P THEORY EXAM: 75
4 0 TOTAL: 100
Course Objectives:
1. To apprise students of various roots of service oriented architecture (SOA) along with
characteristics and comparision with client server and distributed internet architecture.
2. To discuss how the components in an SOA interrelate and the Principles of service
orientation.
3. To introduce the service descriptions like messaging with SOAP and message exchange
along with Pattern- coordination,Atomic translation and Business activities.
4. To familiarize students with various service layers.
5. To discuss the service oriented analysis like business-centric SOA and deriving business
services along with service modeling and service oriented design.
6. To make students understand the basics of WSDL and SOAP.
7. To make students understand the basics of SOA platform like SOA support in J2EE and
intoduce the Java API for XML-based web services (JAX-WS),Java architecture for
XML binding(JAXB),java API for XML Registers(JAXR),Java API for XML based
RPC(JAX-RPC).
8. To familiarize students with web services interoperability technologies (WSIT),web
services and web services enhancements (WSE).
9. To discuss the web services architecture and its characteristics along with its core
building block,Standard and technology available for implementing communication .
10. To make students understand the basic steps of implementing Web services and
developing Web services enabled applications along with the various functions of SOAP
.
UNIT I :Roots of SOA
How services encapsulate logic , How Services Relate, How Services Communicate, How
Services are designed, How Services are built, Characteristics of SOA - Comparing SOA to
client-server and distributed internet architectures – Anatomy of SOA- How components in an
SOA interrelate -Principles of service orientation, SOA and object-orientation
UNIT II : Service descriptions

Messaging with SOAP –Message exchange, Patterns – Coordination –Atomic Transactions –
Business activities – Orchestration –Choreography - Service layer abstraction – Application
Service Layer – Business
Service Layer – Orchestration Service Layer
UNIT III : Service oriented analysis

Business-centric SOA – Deriving business services- service
modeling - Service Oriented Design – WSDL basics – SOAP basics – SOA composition
guidelines – Entity-centric business service design – Application service design – Taskcentric
business service design
UNIT IV : SOA platform basics

SOA support in J2EE – Java API for XML-based web services
(JAX-WS) - Java architecture for XML binding (JAXB) – Java API for XML Registries
(JAXR) - Java API for XML based RPC (JAX-RPC)- Web Services Interoperability
Technologies (WSIT) - web services – Web Services Enhancements (WSE)
UNIT V : Web Services Architecture

Web services Architecture and its characteristics, core building blocks of web services, standards
and technologies available for implementing web services, web services communication, basic
steps of implementing web services, developing web services enabled applications. Core
fundamentals of SOAP: SOAP Message Structure, SOAP Encoding , SOAP message exchange
models, SOAP communication and messaging, SOAP security.
Course Outcomes:
a. The students will be able to understand how the services encapsulate logic, How services
relate,How services communicate, How services are designed and How services are
build.
b. The students will be able to familiar to the SOA by the characteristics of SOA and
comparision between SOA to client server and distributed internet architecture.
c. The students will be able to understand the anatomy of SOA and How the components in
SOA is interrelate and the principles of service orientation.
d. The students will be able to understand the service discriptions, how the messaging with
SOAP, How the message exchange, How the patten coordination and atomic transaction
done .
e. The students will be able to familiar with various service layer for example application
service layer,business service layer,Orchestration service layer.
f. The students will be able to decide which service layer is good by familiar of these
service layer.
g. The students will be able to analyzing the service oriented functions.
h. The students will be able to understand that how the business services derive.
i. The student will be able to understand the basics of WSDL and SOAP & SOA and
composition guidelines.1
j. The students will be able to design various services like Entity-centric business service
design, Application service design,Taskcentric business service design.
k. The students will be able to understand the SOA platform basics like which platform
support SOA.
l. The students will be able to understand Java API for XML-based web services (JAX-
WS),Java architecture for XML binding(JAXB),java API for XML
Registers(JAXR),Java API for XML based RPC(JAX-RPC),web services, WSIT,WSE.
m. The students will be able to familiar web services architecture and its characteristics ,core
building block of web services standards and technologies available for implementing
web services, web services communication,basic steps of implementing web services .
n. The students will be able to develop web services enabled applications and also able to
understand the function of SOAP.
a b C d e F g h i j k L M N
1 √ √
2 √
3 √
4 √ √
5 √ √ √
6 √ √
7 √ √
8 √
9 √
10 √ √
REFERENCES
1. Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, and Design”,

Pearson Education, 2005.
2. Thomas Erl, “SOA Principles of Service Design “(The Prentice Hall Service-Oriented
Computing Series from Thomas Erl), 2005.
3. Newcomer, Lomow, “Understanding SOA with Web Services”, Pearson Education,
2005.
M.TECH COMPUTER NETWORKING (OPEN ELECTIVE)
CODE: OEC-2
SUBJECT NAME: CYBER LAWS AND SECURITY
NO OF CREDITS: 3
L P THEORY EXAM: 75
4 0 TOTAL: 100
UNIT-I
History of Information Systems and its Importance, basics, Changing Nature of Information
Systems, Need of Distributed Information Systems, Role of Internet and Web Services,
Information System Threats and attacks, Classification of Threats and Assessing Damages
Security in Mobile and Wireless Computing- Security Challenges in Mobile Devices,
authentication Service Security, Security Implication for organizations, Laptops Security Basic
Principles of Information Security, Confidentiality, Integrity Availability and other terms in
Information Security, Information Classification and their Roles.
UNIT-II
Security Threats to E Commerce, Virtual Organization, Business Transactions on Web, E
Governance and EDI, Concepts in Electronics payment systems, E Cash, Credit/Debit Cards.
Physical Security- Needs, Disaster and Controls, Basic Tenets of Physical Security and Physical
Entry Controls, Access Control- Biometrics, Factors in Biometrics Systems, Benefits, Criteria
for selection of biometrics, Design Issues in Biometric Systems, Interoperability Issues,
Economic and Social Aspects, Legal Challenges
UNIT-III
Model of Cryptographic Systems, Issues in Documents Security, System of Keys, Public Key
Cryptography, Digital Signature, Requirement of Digital Signature System, Finger Prints,
Firewalls, Design and Implementation Issues, Policies Network Security- Basic Concepts,
Dimensions, Perimeter for Network Protection, Network Attacks, Need of Intrusion Monitoring
and Detection, Intrusion Detection Virtual Private Networks- Need, Use of Tunneling with VPN,
Authentication Mechanisms, Types of VPNs and their Usage, Security Concerns in VPN
UNIT-IV
Security metrics- Classification and their benefits Information Security & Law, IPR, Patent
Law, Copyright Law, Legal Issues in Data mIning Security, Building Security into Software Life
Cycle Ethics- Ethical Issues, Issues in Data and Software Privacy Cyber Crime Types &
overview of Cyber Crimes
REFERENCES
1. Godbole,“ Information Systems Security”, Willey

2. Merkov, Breithaupt, “ Information Security”, Pearson Education
3. Yadav, “Foundations of Information Technology”, New Age, Delhi
4. Schou, Shoemaker, “ Information Assurance for the Enterprise”, Tata McGraw Hill
5. Sood,“Cyber Laws Simplified”, Mc Graw Hill
6. Furnell, “Computer Insecurity”, Springer 7. IT Act 2000
CODE: OEC-4
SUBJECT NAME: WEB TECHNOLOGY & INFORMATION RETREIVAL
NO OF CREDITS: 3
L P THEORY EXAM: 75
4 0 TOTAL: 100
Unit 1 Web Server Technology
Web’s Robot global access to information, HTML, HTTP, Accessing a web server, publishing
on web server, secure HTTP, Secure Sockets Layer, WWW Proxies, IIS, Case study of apache
web server.
Unit 2 Web search basics
Background and history,Anatomy of WWW, Web characteristics, Spam, The web graph, The
Web Search Users, search engines, architecture of search engines, search tools, DNS resolution,
The URL frontier, Link analysis, PageRank,
UNIT 3 Web Crawlers
Basics of Web crawling, Various crawling techniques , incremental crawler, parallel crawler,
distributed crawlers, focused crawler, agent based crawler, Hidden web Crawler
Unit 4 Introduction to Information Retrieval
Information retrieval problem, an inverted index, Processing Boolean queries, The extended
Boolean model versus ranked retrieval, an inverted index, Bi-word indexes, Positional indexes,
Combination schemes
Unit 5 Index construction
Hardware basics, Blocked sort-based indexing, Single-pass in-memory indexing, Distributed

indexing, Dynamic indexing, Other types of indexes Index compression: Statistical properties of
terms in information retrieval, Heaps’ law: Estimating the number of terms, Zipf’s law:
Modeling the distribution of terms, Dictionary compression, Dictionary as a string, Blocked
storage, Postings file compression.
CODE: OEC-5
SUBJECT NAME: INTELLECTUAL PROPERTY RIGHTS
NO OF CREDITS: 3
L P THEORY EXAM: 75
4 0 TOTAL: 100
UNIT 1: Introduction to Intellectual Property
Concept of Intellectual Property, Kinds of Intellectual Property, Economic Importance of

Intellectual Property, Indian Theory on Private Property: Constitutional Aspects of Property,
Constitutional Protection of Property and Intellectual Property, Economic Development and
Intellectual Property Rights Protection
UNIT II: Introduction to Patents
Overview, Historical Development, Concepts: Novelty, Utility, Patentable Subject-matter:

Patent Act, 1970- Amendments of 1999, 2000, 2002 and 2005, Pharmaceutical Products and
Process and Patent , Protection, Software Patents, Business Method, Protection of Plant Varieties
and Farmers’ Rights Act, 2001, Patenting of Micro-organism
UNIT III: Procedure of Obtaining of Patents
Concepts of a Patent Application,, Specification: Provisional, Complete, Disclosure Aspects,

Claims: Principal, Dependant, Omnibus, Examination of Application, Opposition of
Application, Sealing of Patents
UNIT IV: Working of Patents – Compulsory License
Commercialization of Inventions: License- Terms of License Agreement, Assignments of

Patents, Revocation of Patents
UNIT V: Infringement
What is Infringement?How is Infringement determined? Who is an Infringer?, Direct,
Contributory and Induced, Defences of Infringement:Research Exemption, Invalidity, Misuse,
Failure to mark, Laches and Estoppel and first sale doctrine
REFERENCES
1. W.R. Cornish, Intellectual Property, Sweet & Maxwell, London (2000)

2. P. Narayana, Patent Law, Wadhwa Publication
3. Merges, Patent Law and Policy: Cases and Materials, 1996
4. Brian C. Reid, A Practical Guide to Patent Law, 2 nd Edition, 1993
5. Brinkhof (Edited), Patent Cases, Wolters Kluwer.
6. Prof. Willem Hoyng & Frank Eijsvogels, Global Patent Litigation, Strategy and
Practice, Wolters Kluwer.
7. Gregory Stobbs, Software Patents Worldwide, Wolters Kluwer.
8. Feroz Ali Khader, The Law of Patents- With a special focus on Pharmaceuticals in
India, Lexis Nexis Butterworths Wadhwa, Nagpur.
9. Sookman, Computer Law, 1996
10. N.S. Gopalakrishnan & T.G. Agitha, Principles of Intellectual Property (2009). Eastern Book
Company, Lucknow.

MCN Syllabus 2017 PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MCN Syllabus 2017 PDF

Uploaded by

Copyright:

Available Formats

M.

TECH COMPUTER NETWORKING

SUBJECT NAME: RESOURCE MANAGEMENT IN COMPUTER SYSTEMS

M.TECH SEMESTER I SESSIONAL: 25

Unit I : Operating System Introduction

Unit III : Process management

Process Scheduling: Scheduling levels, scheduling types, scheduling goals, scheduling

Unit IV : Process Synchronization

Unit V : Memory Management

Unit VI : File System Interface

MAPPING OF COURSE OBJECTIVES AND COURSE OUTCOMES:

Course Outcomes ------->

1. William Stallings: Operating Systems, PHI, Latest Edition.

SUBJECT NAME: DATA COMMUNICATION NETWORKS

M.TECH SEMESTER I SESSIONAL: 25

1. To make students familiar with concepts of Data Communication, Line Encoding

Course Outcomes ------->

1. Forouzan, Data Communications and Networking, TMH, 4 th Edition, 2006.

3. S.Tanenbaum, Computer Networks, 4 th Edition, Pearson Education Asia Inc., 2004.

4. Leon-Garcia, Widjaja, Communication Networks, Fundamental Concepts and Key

Architecture, TMH, 2 nd Edition, 2004.

SUBJECT NAME: ANALYSIS AND DESIGN OF ALGORITHMS

M.TECH SEMESTER I SESSIONAL: 25

1. Introducing students with mathematical preliminaries required to analyze and design

Unit 1: Analyzing Algorithms & Problems

Unit 2: Dynamic Sets, Searching and Graphs

Unit 4: Backtracking and Branch – and – Bound

Unit 5: NP – Hard and NP Complete problems

Unit 6: Parallel Algorithms

Unit 7: Approximation Algorithms

MAPPING OF COURSE OBJECTIVES AND COURSE OUTCOMES:

SUBJECT NAME: MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

M.TECH SEMESTER I SESSIONAL: 25

To subject aims to educate the students about

Unit 1: Finite Automata and Regular Languages

Unit 3: Pushdown Automata and Turing machines

Unit 5: Advancements in Automata Theory

After the completion of the course, the students will be to able to

SUBJECT NAME: INFORMATION RETRIEVAL SYSTEM (ELECTIVE –I)

M.TECH SEMESTER I SESSIONAL: 25

1. To build an understanding of the fundamental concepts of Information Retrieval

Unit 1 : Introduction to Information Retrieval

Unit 2 : Index construction

Unit 3 : Scoring, term weighting and the vector space model

Unit 5 : Web search basics

Unit 6 : Language models for information retrieval

a) The students will be able to understand basic Information Retrieval Systems.

Course Outcomes ------->

1. An Introduction to Information Retrieval Christopher D. Manning, Prabhakar

SUBJECT NAME: AGILE SOFTWARE DEVELOPMENT (ELECTIVE –I)

M.TECH SEMESTER I SESSIONAL: 25

Unit 1 : Iterative and Evolutionary Development

Unit 2 : Adapting to Agile

Unit 3 : Agile Planning & Prioritization

Unit 4 : Agile Estimation

Unit 5 : Agile Software Development using Scrum

Unit 6 : Agile Testing

Mapping of Course Objectives and Course Outcomes

1. S/w development using Scrum, Succeeding with Agile by Mike Cohn

SUBJECT NAME: ADVANCED COMPUTER ARCHITECTURE (ELECTIVE –I)

M.TECH SEMESTER I SESSIONAL: 25

Unit I : Introduction and Advanced concepts

Unit II : Parallel Processing