School of Engineering & Technology Syllabi and Course ... M. Tech CSE Networking .pdf · Faculty of Engineering & Technology M.Tech. in Computer Science & Engineering (Network Engineering)

School of Engineering & Technology

Syllabi and Course Structure

Computer Science and Engineering

(M.Tech. in Network Engineering)

Academic Programmes

July, 2013

Faculty of Engineering & Technology

M.Tech. in Computer Science & Engineering (Network Engineering)

Course Structure First Semester

FIRST SEMESTER

yr Sub Code Sub Name L T P C

I M11001 Advanced Topics in Algorithm Design 4 0 0 4

M11002 Advanced Software Engineering 4 0 0 4

M11003 Advanced Operating Systems 4 0 0 4

M111** Elective – I 3 0 0 3

M111** Elective – II 3 0 0 3

M11004 Advanced Topics in Algorithms Lab 0 0 4 2

M11005 Advanced Software Engineering Lab 0 0 4 2

M11006 Seminar 0 0 2 1

TOTAL 20 0 10 23

Second Semester

SECOND SEMESTER

Sub Code Sub Name L T P C

M12007 Network Management 4 0 0 4

M12008 Network Protocol & programming 4 0 0 4 M12009 Advance Computer Network 4 0 0 4 G11007 Research Methodology & Technical communication 3 0 0 3 M121**/M11106

Elective –III 3 0 0 3

M121** Elective –IV 3 0 0 3

M12010 Advance technology lab 0 0 4 2

M12011 Elective Lab 0 0 4 2

M12012 Project 0 0 4 2

TOTAL 21 0 12 27

Third Semester

THIRD SEMESTER II M13002 Dissertation-I 0 0 0 20

TOTAL 3 0 0 20

Fourth Semester

FOURTH SEMESTER

M14002 Dissertation-II 0 0 0 20

TOTAL 0 0 0 20


M.Tech. in Computer Science & Engineering (Network Engineering)

Proposed ELECTIVE Theory Subjects:

Code Elective: I Code Elective: II Code Elective: III Code Elective: IV M11104

Information system security

M11105

Mobile computing M11106

Digital Image Processing

M12111

Distributed and Cloud computing

M11101

Advance Data Communication network

M11103

Optical network M12109

Neural Network M12112

Grid computing

M11110

Geographic Information system

M11112

Information Theory & coding

M12103

Pattern Reorganization

M12113

Web engineering

M111

11 Parallel computation and application

M111

07

Secure

Communication and

VPN

M12110

Artificial Intelligence and Expert system

M12114

Network flow & Traffic Engineering


M.Tech. in Computer Science & Engineering (Network Engineering) Semester I Contact Hours (L-T-P): 4-0-0

M11001- Advanced Topics in Algorithm Design: Course Outlines Advanced Data Structure: Graph, B-tree, binomial heaps and, Fibbonacci heap.

Graph Algorithms: Single source shortest paths-Belman-Ford algorithm, Dijkistra algorithm, all pairs

shortest path and matrix multiplication, Floyad-Warshall alhm, Johnson algorithm for parse graph,

maximum flow-Ford-Fulkusonmethod and maximum bipartite matching.

Linear Programming: The simplex algorithm and duality.

Number Theoretic Algorithm: GCD, modular arithmetic, solving modular linear equation and Chinese

remainder theorem.

NP Completeness: Polynomial time, polynomial time verification, NP completeness and

reducibility, Cook’s theorem, NP complete problems-clique problem, vertex cover problem,

approximation algorithms-vertex cover problem, set covering problem, traveling salesman

problem.

Probabilistic Algorithms: Numerical probabilistic algorithm, Monte-Carlo algorithm and Las-Vegas

algorithm.

Parallel Algorithms: Model for parallel computation, basic techniques, work and efficiency,

parallel evaluation of expressions, parallel sorting networks and parallel sorting.

Suggested Books

1. Cormen T.H., Leiserson C.E., Rivest R.L., Introduction to Algorithms , Prentice Hall of

India

2. Brassad G. & Bratley P., Fundamentals of Algorithmics , Prentice Hall of India

3. Basse S., Computer Algorithms - Introduction to Design and Analysis , Addison Wesley



M11002- Advanced Software Engineering: Course Outlines

Introduction to Software Engineering: Software Engineering Processes, Project Management concept,

Project Effort estimation, LOC and function point based estimates, Requirement Analysis and

Specifications, Formal Requirements, Specifications, Socio-technical Systems, Dependability, Critical

Systems Specification, Formal Specification. Analysis Modeling, Elements of Analysis Model.

Design Concepts and Principles: Fundamental issues in Software Design, Effective Modular Design,

cohesion and coupling. Architectural Design, Distributed Systems Architecture, Application

Architectures, Real-time Systems, User Interface Design, Component Level Design, Modeling

Language(UML)

Software Development Methodologies: Iterative Software Development, Software Reuse,

CBSE, Critical Systems Development Software Evolution. Verification and Validation, Software

Testing, Software Testing Principles, Alternative Paradigms: Extreme Programming, Agile Software

Engineering, Principles behind Agile method, Agile method and Project Management.

Object Oriented Software Engineering: Software Process Improvement, Software Economics,

Software Quality, Software Metrics, Software Maintenance, Risk management, Requirement

Engineering, Object oriented concepts and principles, OO Analysis, OO Design, OO Testing

Advanced Software Engineering Process: Formal Methods, Basic concepts, Mathematical

Preliminaries, Clean room Software Engineering, Component Based Software Engineering,

Client/Server Software Engineering, Web Engineering, Reengineering

Suggested Books:

1. Software Engineering, Ian Sommerville, 8th Edition, Addison-Wesley,2006.

2. Software Engineering: A Practitioner's Approach, 6/e, Roger S Pressman,McGraw Hill, 2005.

3. K.K Aggarwal & Yogesh Singh,” Software Engineering”, 3rd Edition, New Age

International, 2007



M11003- Advanced Operating Systems: Course Outlines

Operating System: Definition, Operating System as Resource Manager. Types of Operating Systems:

Simple Batch Processing, Multi-programmed Batch Processing, Time Sharing, Personal Computer

systems, Parallel, Distributed and Real Time Operating Systems. Operating System Components,

Services, Calls, System Programs, Operating System Structure, Virtual Machines, System Design and

Implementation.

Process Management: Concepts, Scheduling, Operations, Co-operating processes, Inter-process

Communication. Threads: Thread usage, threads in User Space, threads in Kernel, Hybrid

Implementation, Scheduler Activation, Pop-up threads, Multithreading.

CPU Scheduling: Basic Concepts, Scheduling Criteria, Algorithms, Multiple-processor Scheduling,

Real Time Scheduling, Algorithm Evaluation.

Process Synchronization: Critical Section Problem, Synchronization Hardware, Semaphores, Classical

Problem of synchronization, Critical Regions, Monitors. Deadlock: Characteristics, Necessary

Conditions, Prevention, Avoidance, Detection and Recovery.

Memory Management: Logical and Physical Address Space, Swapping. Contiguous Allocation:

Singlepartitioned, Multi-partitioned. Non-contiguous Allocation: Paging, Segmentation, and

Segmentation with Paging. Virtual Memory: Demand Paging, Page Replacement Algorithms, Allocation

of Frames, Thrashing, Demand Segmentation.

File and Directory System: File Concepts, Access Methods, Directory Structure, Protection, File

system Structure, Allocation Methods, Free Space Management, Directory Implementation, Recovery.

Secondary Storage Management: Disk Structure, Dedicated, Shared, Virtual, Sequential Access and

Random Access Devices, Disk Scheduling, Disk Management, Swap-space Management, Disk

Reliability, Stable Storage Management.

Protection and Security: Threats, Intruders, Accidental Data Loss, Cryptography, User authentication,

Attacks from inside the system, Attacks from outside the system, Protection Mechanism, Trusted

Systems, Domain of Protection, Access Matrix, Programs Threats, System Threats.

Distributed systems, topology network types, design strategies. Network operating structure, distributed

operating system, remote services, and design issues. Distributed file system: naming and transparency,

remote file access, Stateful v/s Stateless Service, File Replication.

Distributed co-ordinations: Event Ordering, Mutual Exclusion, Atomicity, Concurrency Control,

Deadlock Handling, Election Algorithms, and Reaching Agreement. Case studies of Unix and MS-DOS

operating system.

Suggested Books

1. Silberschatz and Galvin, "Operating System Concepts", Addison-Wesley publishing, Co.,1999.

2. A. S. Tanenbaum, “Modern Operating Systems”, Pearson Education.

3. H.M. Dietel, “An Introduction to Operating System”, Pearson Education.

4. D. M. Dhamdhere, “Operating Systems – A Concept Based Approach”, Tata McGraw-Hill

5 M. Singhal, N. G. Shivaratri, “Advanced Concepts in Operating Systems”, Tata McGraw

-Hill.

6. William Stallings, “Operating Systems”, Pearson Education



M11004- Advanced Topics in Algorithm Lab: Course Outlines

List of Experiments

1. Write a Program to implement Efficient Matrix Multiplication

2. Write a Program to define the graphs and list all nodes and Links

3. Write a Program to implement the concept of BFS

4. Write a Program to implement the concept of DFS

5. Write a Program to implement the concept of B-tree

6. Write a Program to implement Dijkistra Algorithm

7. Write a Program to implement the concept of Binomial Heap

8. Write a program to find Greatest Common Divisor

9. Write a program using Chinese remainder theorem

10 Write program to solve linear equations

11 Write a program to solve Travelling Salesman problem

12 Write a program to implement Vertex cover problem

13 Write a program to implement all pair shortest path Algorithm



M11005- Advanced Software Engineering Lab: Course Outlines

List of Experiments

Students will Identify Projects they will be working on in this Lab. Once Projects are

Identified then they will work on objectives given for the projects below

1. To perform the user’s view analysis: Use case diagram for

2. To perform the system analysis: Requirement analysis, SRS

3. To perform the function oriented diagram: DFD and Structured chart

4. To perform the user’s view analysis: Use case diagram

5. To draw the structural view diagram: Class diagram, object diagram

6. To draw the behavioral view diagram: Sequence diagram, Collaboration diagram

7. To draw the behavioral view diagram: State-chart diagram, Activity diagram

8. To draw the implementation view diagram: Component diagram.

9. To draw the implementation view diagram: deployment diagram

10. To perform various techniques for testing using manual Testing


M.Tech. in Computer Science & Engineering (Network Engineering) Semester II Contact Hours (L-T-P): 4-0-0

M12007- Network Management: Course Outlines

1. Introduction: Analogy of Telephone Network Management, Data and Telecommunication Network

Distributed computing Environments, TCP/IP-Based Networks: The Internet and Intranets,

Communications Protocols and Standards- Communication Architectures, Protocol Layers and Services;

Case Histories of Networking and Management – The Importance of topology , Filtering Does Not

Reduce Load on Node, Some Common Network Problems; Challenges of Information Technology

Managers, Network Management: Goals, Organization, and Functions- Goal of Network Management,

Network Provisioning, Network Operations and the NOC, Network Installation and Maintenance;

Network and System Management, Network Management System platform, Current Status and Future

of Network Management.

2. Basic Foundations: Standards, Models, and Language: Network Management Standards, Network

Management Model, Organization Model, Information Model – Management Information Trees,

Managed Object Perspectives, Communication Model; ASN.1- Terminology, Symbols, and

Conventions, Objects and Data Types, Object Names, An Example of ASN.1 from ISO 8824; Encoding

Structure; Macros, Functional Model

3. SNMPv1 Network Management: Managed Network: The History of SNMP Management, Internet

Organizations and standards, Internet Documents, The SNMP Model, The Organization Model, System

Overview. The Information Model – Introduction, The Structure of Management Information, Managed

Objects, Management Information Base. The SNMP Communication Model – The SNMP Architecture,

Administrative Model, SNMP Specifications, SNMP Operations, SNMP MIB Group, Functional Model

4. SNMP Management – RMON: Remote Monitoring, RMON SMI and MIB, RMONI1- RMON1

Textual Conventions, RMON1 Groups and Functions, Relationship Between Control and Data Tables,

RMON1 Common and Ethernet Groups, RMON Token Ring Extension Groups, RMON2 – The

RMON2 Management Information Base, RMON2 Conformance Specifications.

5. Broadband Network Management: Broadband Access Networks and Technologies: Broadband

Access Networks, Broadband Access Technology; HFCT Technology: The Broadband LAN, The Cable

Modem, The Cable Modem Termination System, The HFC Plant, The RF Spectrum for Cable Modem;

Data Over Cable Reference Architecture; HFC Management – Cable Modem and CMTS Management,

HFC Link Management, RF Spectrum Management, DSL Technology; Asymmetric Digital Subscriber

Line Technology – Role of the ADSL Access Network in an Overall Network, ADSL Architecture,

ADSL Channeling Schemes, ADSL Encoding Schemes; ADSL Management – ADSL Network

Management Elements, ADSL Configuration Management, ADSL Fault Management, ADSL

Performance Management, SNMP-Based ADSL Line MIB, MIB Integration with Interfaces Groups in

MIB-2, ADSL Configuration Profiles.

TEXT BOOKS: 1. Mani Subramanian: Network Management- Principles and Practice, 2nd Pearson Education, 2010.

REFERENCE BOOKS: 1. J. Richard Burke: Network management Concepts and Practices: a Hands-On Approach, PHI, 2008.



M12008- Network Protocol & Programming: Course Outlines

Introduction:

Course introduction, network architecture, layering and protocols, OSI architecture, Internet

architecture. Delay, hardware building blocks, Application Programming Interface (API), Encoding,

framing, error detection, Ethernet (802.3), token rings (802.5, FDDI), wireless (802.11). Network

adaptors, Switching and forwarding, circuit switching, packet switching, datagrams,Switching and

forwarding, IP, service model .Routing and forwarding, UDP, TCP

Application Layer Programming:

Application-layer protocols, HTTP,FTP, SMTP,DNS (domain hierarchy, name servers, name resolution)

Sockets Programming:

Socket, UDP client-server, peer-to-peer.TCP sockets. Socket Programming in Java, Cache, CDN, P2P.

Socket options (Broadcasting, multicasting), non-blocking I/O.Non-blocking I/O

Transport Layer Programming:

Reliable transmission (stop-and-wait, sliding window).Finite state machine; Go-back-n and selective

repeat ARQs.TCP flow control.TCP congestion control (additive increase / multiplicative decrease, slow

start, fast retransmit, fast recovery), brief on congestion-avoidance mechanisms

Network Layer Programming:

TCP discussion topics, introduction to link state and distance vector routing algorithm.Link state and

distance vector routing algorithm, hierarchical routing.RIP, OSPF, BGP, multicast routing and mobile IP

Text Books:

1. J. F. Kurose and K. W. Ross, Computer Networking: A Top-Down Approach Featuring the

Internet, Addison-Wesley Publishing, 2nd edition, 2002

2. W. R. Stevens, UNIX Network Programming, Prentice Hall PTR, 2nd edition

Reference Books:

1. D. E. Comer, Computer Networks and Internets, Prentice Hall

2. L. L. Peterson and B. S. Davie, Computer Networks: A Systems Approach, Morgan Kaufmann

Publishers

3. M. J. Donahoo and K. L. Calvert, TCP/IP Sockets in C: Practical Guide for Programmers (The

Practical Guides Series), Morgan Kaufmann Publishers

4. K. L. Calvert and M. J. Donahoo, TCP/IP Sockets in Java: Practical Guide for Programmers (The

Practical Guides Series), Morgan Kaufmann Publishers



M12009-Advanced Computer Network: Course Outlines

HIGH SPEED NETWORKS

Frame Relay Networks - Asynchronous transfer mode - ATM Protocol Architecture, ATM logical

Connection, ATM Cell - ATM Service Categories - AAL.High Speed LANs: Fast Ethernet, Gigabit

Ethernet, Fiber Channel - Wireless LANs: applications, requirements - Architecture of 802.11

CONGESTION AND TRAFFIC MANAGEMENT

Queuing Analysis- Queuing Models - Single Server Queues - Effects of Congestion - congestion Control

- Traffic Management - Congestion Control in Packet Switching Networks - Frame relay Congestion

Control.

TCP AND ATM CONGESTION CONTROL

TCP Flow control - TCP Congestion Control - Retransmission - Timer Management - Exponential RTO

backoff KARN’s Algorithm - Window management - Performance of TCP over ATM.Traffic and

Congestion control in ATM - Requirements - Attributes - Traffic Management Frame work, Traffic

Control - ABR traffic Management - ABR rate control, RM cell formats, ABR Capacity allocations -

GFR traffic management.

INTEGRATED AND DIFFERENTIAL SERVICES

Integrated Services Architecture - Approach, Components, Services- Queuing Discipline, FQ, PS,

BRFQ, GPS, WFQ - Random Early Detection, Differentiated Services

PROTOCOLS FOR QOS SUPPORT

RSVP - Goals & Characteristics, Data Flow, RSVP operations, Protocol Mechanisms - Multiprotocol

Label Switching - Operations, Label Stacking, Protocol details - RTP - Protocol Architecture, Data

Transfer Protocol, RTCP.

TEXT BOOKS:

1.William Stallings,” HIGH SPEED NETWORKS AND INTERNET”, Pearson Education, Second

Edition, 2002.

REFERENCES:

1. Warland & Pravin Varaiya,”HIGH PERFORMANCE COMMUNICATION

NETWORKS”,Jean Hardcourt Asia Pvt. Ltd.,II Edition,2001.

2. Irvan Pepelnjk,Jin Guichard and Jeff Apcar ,”MPLS and VPN architecture “, Cisco Press,

Volume 1 and 2 ,2003.



G11007-Research Methodology & Technical Communication: Course Outlines

Research: Meaning & Purpose, Review of literature, Problem definition/Formulation of research

problem, Research proposal, Variables, Hypothesis, types, construction of hypothesis

Classification of research: Quantitative research: Descriptive Research, Experimental Research

Qualitative research: Observational studies, Historical research, Focus group discussion, Case study

method,

Sources of data collection: Primary and Secondary Data Collection, Sample and Sampling technology,

Non-probability and Probability Sampling

Tools for data collection: Tests, Interview, Observation, Questionnaire/ Schedule, Characteristics of a

good test, Statistics: Descriptive and Inferential Statistics

Data Analysis, Report Writing, Results and References,

Thesis Writing and Journal Publications: Writing thesis, Writing journal and conference papers,

IEEE and Harvard style of referencing, Effective presentation, Copyrights, and Avoid plagiarism


M.Tech. in Computer Science & Engineering (Information Security) Semester I Contact Hours (L-T-P): 3-0-0

M11104-Information System Security: Course Outlines

Introduction to Securities: Introduction to security attacks, services and mechanism, Classical

encryption techniques substitution ciphers and transposition ciphers, cryptanalysis, steganography,

Stream and block ciphers. Modern Block Ciphers: Block ciphers principles, Shannon’s theory of

confusion and diffusion, fiestal structure, Data encryption standard (DES), Strength of DES, Idea of

differential cryptanalysis, block cipher modes of operations, Triple DES

Modular Arithmetic: Introduction to group, field, finite field of the form GF(p), modular arithmetic,

prime and relative prime numbers, Extended Euclidean Algorithm, Advanced Encryption Standard

(AES) encryption and decryption Fermat’s and Euler’s theorem, Primality testing, Chinese Remainder

theorem, Discrete Logarithmic Problem, Principals of public key crypto systems, RSA algorithm,

security of RSA

Message Authentication Codes: Authentication requirements, authentication functions, message

authentication code, hash functions, birthday attacks, security of hash functions, Secure

hash algorithm (SHA)

Digital Signatures: Digital Signatures, Elgamal Digital Signature Techniques, Digital signature

standards (DSS), proof of digital signature algorithm

Key Management and distribution: Symmetric key distribution, Diffie-Hellman Key Exchange, Public

key distribution, X.509 Certificates, Public key Infrastructure.

Authentication Applications: Kerberos

Electronic mail security: pretty good privacy (PGP), S/MIME.

IP Security: Architecture, Authentication header, Encapsulating security payloads, combining security

associations, key management. Introduction to Secure Socket Layer, Secure electronic, transaction

(SET).

System Security: Introductory idea of Intrusion, Intrusion detection, Viruses and related threats,

firewalls.

Suggested Books:

1. William Stallings, “Cryptography and Network Security: Principals and Practice”,

Pearson Education.

2. Behrouz A. Frouzan: Cryptography and Network Security, TMH

3. Bruce Schiener, “Applied Cryptography”. John Wiley & Sons

4. Bernard Menezes,” Network Security and Cryptography”, Cengage Learning.

5. Atul Kahate, “Cryptography and Network Security”, TMH



M11101-Advanced Data Communication Network: Course Outlines Module 1: Introduction

Communication Concepts, Transmission Media, Analog Modulation: AM, PM, FM,Sampling Theorem,

Analog Pulse Modulation, Digital Pulse Modulation (PCM), Basic Principles of Switching,

Multiplexing, Multiple Access, Key Techniques - ASK, FSK, PSK,DPSK, Channel Capacity, Shannon`S

Theorem.Introduction to Network Models - ISO, OSI, SNA, Appletalk and TCP/IP Models, Review of

Physical Layer and Data Link Layers, Review of LAN (IEEE 802.3, 802.5, 802.11b/a/g,FDDI) and WAN

(Frame Relay, ATM, ISDN) Standards.

Module 2: Data Link Layer

Introduction to Data Link Layer, Framing, Error Detection and Correcting Codes, Hamming Code,

Block Codes and Convolution Codes, ARQ Techniques, Transmission Codes, Baudot, EBCDIC and

ASCII Codes, Barcodes, Terminal Handling. ARQ Protocols: Stop & Wait Protocols, Sliding Window

Protocols, Performance and Efficiency, Multi Access Protocols: ALOHA and CSMA.

Module 3: Network Layer

Design Issues, Routing Algorithms: Dijsktra’s, Bellman-Ford, Flooding and Broadcasting, Link State

Routing, Network Layer Protocols: ARP, RARP, Internet Architecture and Addressing, Internetworking,

IPv4, Overview of IPv6, ICMP, Routing Protocols: RIP, OSPF, BGP, IP over ATM, Unicast Routing

Protocols, Multicast Routing Protocols.

Module 4: Transport Layer

Transport Layer: Design Issues, Connection Management, Transmission Control Protocol (TCP), User

Datagram Protocol (UDP), Finite State Machine Model.Application Layer: DNS, SMTP, FTP, WWW,

E-Mail, SNMP, RMON, MIME Case Studies: Study of Various Network Simulators, Network

Performance Analysis Using NS2.

References:

1. Kennedy, “Electronic communication system” - Mc Graw Hill, 1992.

2. Taub & Schilling, “Principles of Communication System” - Mc Graw Hill, 1996.

3. Behurouz & Forozan, “Introduction to Data Communications & Networking”, Mc Graw Hill, 1996.

4. Andrew S. Tanenbaum “Computer Networks”, 4th Edition, Pearson Education, 2008

5. William Stallings, “Data and Computer Communication”, 9th edition, Prentice hall, 2010.

6. William Shay, “Understanding data Communication and Networks”, 2nd Edition, Thomson press,

1994.

7. Fred Halsall, “Data Communication, Computer Networks & Open Systems”, 4th Edition Pearson

Education Asia, 1996.

8. Behrouz A. Forouzan, “TCP/IP Protocol Suit”, TMH, 2000.



M11110-Geographic Information System: Course Outlines

Introducing GIS and spatial data: Definition - maps and spatial information, computer assisted

mapping and map analysis, components of GIS, people and GIS, maps and spatial data, thematic

characteristics of spatial data, other sources of spatial data: census, survey data, air photos, satellite

images, field data. Spatial and attributes data modeling and Management: Data quality and data

standards: Concepts, Definition, Components and assessment of data quality: Spatial entities,

generalization, Raster and Vector spatial data structures, comparison of Vector and Raster Methods ,

Acquisition of spatial data for terrain modeling, Raster and Vector approach to digital terrain modeling,

modeling network , layered approach and object, oriented approach, modeling third and fourth

dimension, problem of data management, database management system - relational database model -

liking spatial and attribute data - GIS database application and development.

Data Input and Editing: Integrated GIS database , Encoding methods of data input: keyboard, manual

digitizing scanning and automatic digitizing methods, electronic data transfer, data editing: methods of

developing and correcting errors in attributes and spatial data: reproduction, transformation and

generalization, edge matching and rubber sheeting, integrated database.

Data Analyzing Operation in GIS: Terminologies, Measurements of lengths, perimeter and

area in GIS, queries, reclassification, buffering and neighborhood functions, integrated data, Raster and

Vector overlay method: point-in-polygon, line-in-polygon and polygon- on-polygon, problems of Raster

and Vector overlays, spatial interpolation, GIS for surface analysis, network analysis: shortest path

problem, travailing problem, location allocation of resources, route tracing.

GIS Modeling for decision support: Models of spatial processes: natural and scale analogue

models , conceptual models, mathematical model, models of physical and environmental processes,

modeling human process, gravity model, problems related to using GIS to model spatial processes.

Maps as output, alternative cartographic outputs, non-cartographic outputs, spatial multimedia,

delivery mechanism, GIS and spatial decision supports, maps as decision tools.

Suggested Books

1. Haywood.L, Comelius.S and S. Carver (1988) An Introduction to Geographical

Information Systems, Addison Wiley Longmont, New York.

2. Burgh P.A (1986) Principles of geographical Information System for Land Resources

Assessment, Clarendon Press, Oxford.

3. Burrough P A 2000 P A McDonnell [2000] Principles of Geographical Information

systems, London: Oxford University Press.



M11111-Parallel Computation and Application: Course Outlines

Introduction to Parallel Computing: Basic concepts about program/process/ thread concurrent

Execution Parallel Execution, granularity, Potential of Parallelism, Need of Parallel Computation, Levels

of parallel processing, Parallel processing Vs. Parallel computing, Dataflow Computing concept,

Applications of parallel processing, Scientific Applications / Image processing, Engineering Application,

Database query / Answering applications, A I Applications, Mathematical simulations and modeling

Classification of Parallel Computers: Types of Classification, Flynn’s/ Handler classification, UMA /

NUMA /COMA, Loosely coupled / tightly coupled, Classification based grain size and Instruction level

parallelism.

Parallel Computer Architecture: Introduction to various computer architecture, Pipeline processing,·

Vector / Array processing, VLIW and Super scalar architecture, Associative architecture, Multithreaded

architecture

Performance Evaluation: Introduction to performance evaluation, Metric of Parallel overhead, Law

Speedup, Measurement Tools.

References:



M11105-Mobile Computing: Course Outlines

Overview of Mobile Computing: Iits applications, Radio Communication, Mobile Computing

Architecture, Mobile System Networks, Data Dissemination, Mobility Management,

Introduction to Cellular network: components, Architecture, Call set-up, Frequency Reuse and Co-

channel cell, Cell Design, Interference, Channel assignment, Hand Off;

Cellular Network Standards: Digital cellular communication, Multiple Access Techniques: FDMA,

TDMA, CDMA. GSM: System Architecture, Mobile services & features, Protocols, Radio interface,

Handover, GSM Channels, Localization and calling, User validation; General Packet Radio Service;

Introduction to CDMA based systems; Spread spectrum in CDMA systems; coding methods in CDMA;

IS-95

Wireless LAN: Wireless LAN (Wi-Fi) Architecture and protocol layers; WAP Architecture; Bluetooth

Architecture: Layers, Security in Bluetooth;

Mobile Ad-hoc and Sensor Networks: Introduction, MANET, Routing in MANET‟s Wireless

Sensor Networks, Applications; Mobile Devices: Mobile Agent, Application Server, Gateways,

Portals, Service Discovery, Device Management,

Support for Mobility: Mobile IP: Architecture, Packet delivery and Hand over Management, Location

Management, Registration, Tunneling and Encapsulation, Route optimization, DHCP.

Mobile Transport Layer: Conventional TCP/IP transport protocols, Indirect TCP, Snooping TCP,

Mobile TCP

Suggested Books

1 Jochen Schiller, “Mobile Communications”, Second Edition, Pearson Education, 2004.

2. Raj Kamal, “Mobile Computing”, Oxford Higher Education, 2008.

3. Sipra DasBit, Biplab K. Sikdar, “Mobile Computing”, PHI, 2009.

4. William C.Y.Lee, “Mobile Cellular Telecommunications”, Second Edition, (Tata McGraw- Hill),

2006.



M11103-Optical Network: Course Outlines

1. Introduction: Three generations of Digital Transport Networks; A brief introduction to WDM and

TDM; The Optical Marketplace; Wireless Optical Systems; Key Optical Nodes; Other Key Terms;

Evolution of Optical Systems; Key attributes of Optical Fiber.

2. Telecommunications Infrastructure: The Local Connections; The Backbone Connections; The

Digital Multiplexing Hierarchy; The Digital Signaling Hierarchies; T1 / DS1 and T3 / DS3; The

Layered Protocol Model in the Transport Network; considerations for Interworking Layer1, Layer 2,

and Layer 3 Networks.

3. Characteristics of Optical Fiber: The Basics; The Wavelength; The Basic Components; Structure of

the Fiber; Fiber Types; Key Performance Properties of Fiber; Attenuation; Amplifier Spontaneous

Emission; Chromatic Dispersion; Lasers.

4. Timing and Synchronization: Timing and Synchronization in Digital Networks; Effect of a Timing

error; The Clocking Signal; Types of Timing in Networks; Timing Variations; Methods of Clock

Exchange; Distribution of Timing Using SONET and DS1; Timing Downstream Devices; Building

Integrated Timing Supply; Synchronization Status Messages and Timing Loops.

5. SONET and SDH: Introduction; The SONET Multiplexing Hierarchy; SONET and SDH Multiplexing

Structure; The SONET / SDH Frame Structure; SONET and SDH Functional Components; SONET and

SDH Problem Detection; Locating and Adjusting Payload with Pointers; Virtual Tributaries in more

detail; Virtual Tributaries in Virtual Containers; The Overhead Bytes; SONET and SDH Concatenation.

TEXT BOOKS:

1. Uyless Black: Optical Networks, Pearson Education Asia, 2002.

REFERENCE BOOKS:

1. Rajiv Ramaswami and Kumar N.Sivaranjan: Optical Networks - A Practical Perspective, Morgan

Kaufuann, 2000.

2. Paul E.Green Jr.: Fiber Optic Network, Prentice Hall, 1993.

3. Jeff Hecht: Understanding Fiber Optics, 4th Edition, PHI 1999.



M11112-Information Theory & Coding: Course Outlines

Information theory – Concept of amount of information -units, Entropy -marginal, conditional and joint

entropies -relation among entropies Mutual information, information rate, channel capacity, redundancy

and efficiency of channels.

Discrete channels – Symmetric channels, Binary Symmetric Channel, Binary Erasure Channel,

Cascaded channels, repetition of symbols, Binary unsymmetric channel, Shannon theorem. Continuous

channels – Capacity of band limited Gaussian channels, Shannon-Hartley theorem, Trade off between

band width and signal to noise ratio, Capacity of a channel with infinite band width, Optimum

modulation system.

Source coding – Encoding techniques, Purpose of encoding, Instantaneous codes, Construction of

instantaneous codes, Kraft’s inequality, Coding efficiency and redundancy, Noiseless coding theorem.

Construction of basic source codes – Shannon-Fano algorithm, Huffman coding, Arithmetic coding, ZIP

coding.

Codes for error detection and correction – Parity check coding, Linear block codes, Error detecting and

correcting capabilities, Generator and Parity check matrices, Standard array and Syndrome decoding,

Hamming codes, Encoding and decoding of systematic and unsystematic codes. Cyclic codes –

Generator polynomial, Generator and Parity check matrices, Encoding of cyclic codes, Syndrome

computation and error detection, Decoding of cyclic codes, BCH codes, RS codes, Burst error

correction.

Convolutional codes – Encoding- State, Tree and Trellis diagrams, Maximum likelihood decoding of

convolutional codes -Viterby algorithm, Sequential decoding -Stack algorithm. Interleaving techniques –

Block and convolutional interleaving, Coding and interleaving applied to CD digital audio system -

CIRC encoding and decoding, interpolation and muting. ARQ – Types of ARQ, Performance of ARQ,

Probability of error and throughput.



M11107-Secure Communication and VPN: Course Outlines

Module 1: Introduction to Communication Security

Threats and Solutions, Technical Threats to Communication Security, Authentication,

Confidentiality, Integrity, Biometric Access Tools, Foot Printing, Internet Foot Printing, Port

Scanning.

Module 2: Windows Security

Windows Security Features, Windows Firewalls, Remote Connectivity and VoIP Hacking,

PBX Hacking, Voice Mail Hacking.

Module 3: VPN

Introduction to VPN, Types of VPN: Access VPN, Intranet VPN, Extranet VPN, VPN

Protocols, Layer 2 Tunneling Protocol, Internet Protocol Security, Internet Key Exchange

(IKE) Protocol, VPN Hacking, Voice over IP Attack.

Module 4: VPN & Firewalls

Secure VPN Technologies, Trusted VPN Technologies, VPN/Firewall Architecture,

VPN/Firewall Security Policy, Advanced Security Policy and System Management Hybrid

VPN Technologies, Site-to-Site VPN Design, Remote Access VPN Design.

References:

1. Ruixi Yuan and Timothy Strayer W., “Virtual Private Networks: Technologies and

Solutions”, Addison-Wesly, 2001.

2. Thaddeus Fortenberry, “Windows 2000 Virtual Private Networking”, Macmillan

Technical Pub, 2007.

3. Roger J. Sutton, “Secure Communications: Applications and Management”, WILEY,

2002.

4. Don J. Torrieri, “Principles of secure communication systems”, 2nd Eedition, Artech

House Publishers, 1992.

5. Stuart McClure, Joel Scambray, George Kurtz, “Hacking exposed 6: network security

secrets & solutions”, McGraw-Hill, 6th Edition, 2009.

6. William R. Cheswick, Steven M. Bellovin, Aviel D. Rubin, “Firewalls and Internet

security: repelling the wily hacker”, 2nd Edition, Addison-Wesley Professional, 2003.

7. Stallings W, “Data and Computer Communications”, 9th Edition, Pearson Education

India, 2010.


M.Tech. in Computer Science & Engineering (Information Security) Semester II Contact Hours (L-T-P): 3-0-0

M11106-Digital Image Processing: Course Outlines

Fundamentals Of Image Processing

Introduction, Elements of visual perception, Steps in Image Processing Systems, Image Acquisition,

Sampling and Quantization, Pixel Relationships, Colour Fundamentals and Models,

File Formats. Introduction to the Mathematical tools.

Image Enhancement and Restoration

Spatial Domain Gray level Transformations Histogram Processing Spatial Filtering, Smoothing and

Sharpening. Frequency Domain: Filtering in Frequency Domain, DFT, FFT, DCT, Smoothing and

Sharpening filters, Homomorphic Filtering., Noise models, Constrained and Unconstrained restoration

models.

Image Segmentation and Feature Analysis

Detection of Discontinuities, Edge Operators, Edge Linking and Boundary Detection, Thresholding,

Region Based Segmentation, Motion Segmentation, Feature Analysis and Extraction.

Multi Resolution Analysis and Compressions

Multi Resolution Analysis: Image Pyramids – Multi resolution expansion – Wavelet Transforms,

Fast Wavelet transforms, Wavelet Packets. Image Compression: Fundamentals, Models, Elements of

Information Theory, Error Free Compression, Lossy Compression, Compression Standards

JPEG/MPEG.

Applications of Image Processing

Representation and Description, Image Recognition, Image Understanding, Image Classification,

Video Motion Analysis, Image Fusion, Steganography, Colour Image Processing.

Suggested Books:

1. Digital Image Processing - Dr. S.Sridhar Oxford University Press



M12109-Neural Network: Course Outlines

Introduction to artificial neural networks : Biological neural networks, Pattern analysis tasks:

Classification, Regression, Clustering, Computational models of neurons, Structures of neural

networks, Learning principles

Linear models for regression and classification : Polynomial curve fitting, Bayesian curve

fitting, Linear basis function models, Bias-variance decomposition, Bayesian linear regression,

Least squares for classification, Logistic regression for classification, Bayesian logistic

regression for classification

Feed forward neural networks : Pattern classification using perceptron, Multilayer feed

forward neural networks (MLFFNNs), Pattern classification and regression using MLFFNNs,

Error back propagation learning, Fast learning methods: Conjugate gradient method, Auto

associative neural networks, Bayesian neural networks

Radial basis function networks: Regularization theory,RBF networks for function

approximation,RBF networks for pattern classification

Kernel methods for pattern analysis: Statistical learning theory, Support vector machines for

pattern classification, Support vector regression for function approximation, Relevance vector

machines for classification and regression

Self-organizing maps: Pattern clustering, Topological mapping, Kohonen’s self-organizing

map, Feedback neural networks: Pattern storage and retrieval, Hopfield model, Boltzmann

machine, recurrent neural networks

Suggested books:

1. B.Yegnanarayana, Artificial Neural Networks, Prentice Hall of India, 1999

2. Satish Kumar, Neural Networks – A Classroom Approach, Tata McGraw-Hill, 2003

3. S.Haykin, Neural Networks – A Comprehensive Foundation, Prentice Hall, 1998

4. C.M.Bishop, Pattern Recognition and Machine Learning, Springer,



M12103-Pattern Recognition: Course Outlines

Introduction and mathematical preliminaries - What is pattern recognition?, Clustering vs.

Classification; Applications; Linear Algebra, vector spaces, probability theory, estimation

techniques.

Classification: Bayes decision rule, Error probability, Error rate, Minimum distance

classifier, Mahalanobis distance; K-NN Classifier, Linear discriminant functions and Non-

linear decision boundaries.

Fisher’s LDA, Single and Multilayer perceptron, training set and test sets, standardization

and normalization.

Clustering: Different distance functions and similarity measures, Minimum within cluster

distance criterion, K-means clustering, single linkage and complete linkage clustering, MST,

medoids, DBSCAN, Visualization of datasets, existence of unique clusters or no clusters.

Feature selection: Problem statement and Uses, Probabilistic separability based criterion

functions, interclass distance based criterion functions, Branch and bound algorithm,

sequential forward/backward selection algorithms, (l,r) algorithm.

Feature Extraction: PCA, Kernel PCA.

Recent advances in PR: Structural PR, SVMs, FCM, Soft-computing and Neuro-fuzzy.

Books & References:

PREREQUISITES

Vector spaces and Linear Algebra; Algorithms.

Probability theory; Statistics.

REFERENCES

1. R.O.Duda, P.E.Hart and D.G.Stork, Pattern Classification, John Wiley, 2001.

2. Statistical pattern Recognition; K. Fukunaga; Academic Press, 2000.

3. S.Theodoridis and K.Koutroumbas, Pattern Recognition, 4th Ed., Academic

Press, 2009.

4. C.M.Bishop, Pattern Recognition and Machine Learning, Springer, 2006.



M12110-Artificial Intelligence and Expert System: Course Outlines Overview of Artificial Intelligence: Definition & Importance of AI.

Knowledge: General Concepts: Introduction, Definition and Importance of Knowledge, Knowledge-

Based Systems, And Representation of Knowledge, Knowledge Organization, Knowledge Manipulation,

And Acquisition of Knowledge.

LISP and Other AI Programming Languages: Introduction to LISP : Syntax and Numeric Function,

Basic List Manipulation Functions in LISP, Functions, Predicates and Conditionals, Input, Output and

Local Variables, Iteration and Recursion, Property Lists and Arrays, Miscellaneous Topics, PROLOG

and Other AI Programming Languages.

Knowledge Representation: Introduction, Syntax and Semantics for Propositional logic, Syntax and

Semantics for FOPL, Properties of Wffs, Conversion to Clausal Form, Inference Rules, The Resolution

Principle, No deductive Inference Methods, Representations Using Rules.

Knowledge Organization and Management: Introduction, Indexing and Retrieval Techniques,

Integrating Knowledge in Memory, Memory Organization Systems.

Expert Systems Architectures: Introduction, Rule Based System Architecture, Non-Production System

Architecture, Dealing with uncertainty, Knowledge Acquisition and Validation, Knowledge System

Building Tools.

Text Book:

1. Dan W. Patterson - Introduction to Artificial Intelligence and Expert Systems, PHI, New Delhi,

2006.

Reference Books:

1. E. Rich & K. Knight - Artificial Intelligence, 2/e, TMH, New Delhi, 2005.

2. P.H. Winston - Artificial Intelligence, 3/e, Pearson Edition, New Delhi, 2006.

3. D.W. Rolston,- Principles of AI & Expert System Development, TMH, New Delhi



M12111-Distributed and Cloud Computing: Course Outlines

Introduction to Parallel and Distributed Systems, goals, hardware concepts, software concepts, client

server model; communication, layered protocols, remote procedure call, objective invocation, message

& stream oriented communication; processes, threads, clients, servers; naming entities, mobile and

unreferenced entities. Clock synchronization , algorithms, transaction; consistency and replication,

data-centric & client-centric models, protocols; fault tolerance, process resilience, reliable client-server

& group Communication, commit, recovery; security ,channels, access, security control; distributed

object-based systems explanation and comparison ;distributed file systems (SUN, CODA) and

comparison; distributed document-based system and coordination-based systems, multimedia systems,

Parallel Programming Languages and Algorithms.

Suggested reference materials:

1. Andrew S. Tanenbaum, marten van steen “Distributed Systems Principals and Paradigms” Pearson

Edu.

2. George Coulouris, Jean Dollimore, Tim Kindberg “Distributed Systems Concepts and Design”

Pearson Edu.

3. Joel M. Crichlow “ An Introduction to Distributed & Parallel Computing” 2nd ed. PHI.

4. M. Sasikumar, Dinesh Shikhare P Ravi Prakash "Introduction to parallel Processing" PHI

5. Andrew S. Tanenbaum "Distributed Operating System"TMH



M12112-Grid Computing: Course Outlines

Grid Computing: values and risks – History of Grid computing, Grid computing model and protocols,

Overview and types of Grids.

Desktop Grids : Background, Definition, Challenges, Technology, Suitability, Grid server and practical

uses, Clusters and Cluster Grids, HPC Grids, Scientific in sight, Application and Architecture, HPC

application, Development Environment and HPC Grids, Data Grids, Alternatives to Data Grid, Data

Grid architecture.

The open Grid services Architecture, Analogy, Evolution, Overview, Building on the OGSA platform,

Implementing OGSA based Grids, Creating and Managing services, Services and the Grid, Service

Discovery, Tools and Toolkits, Universal Description Discovery and Integration

Desktop Supercomputing, Parallel Computing, Parallel Programming Paradigms, Problems of Current

parallel Programming Paradigms, Desktop Supercomputing Programming Paradigms, Parallelizing

Existing Applications, Grid Enabling Software Applications, Needs of the Grid users, methods of Grid

Deployment, Requirements for Grid enabling Software, Grid Enabling Software Applications.

Application integration, Application classification, Grid requirements, Integrating applications with

Middleware platforms, Grid enabling Network services, Managing Grid environments, Managing Grids,

Management reporting, Monitoring, Data catalogs and replica management, Portals, Different

application areas of Grid computing.

Suggested Books:

1. Ahmar Abbas, “Grid Computing: A Practical Guide to Technology and Applications”,

Firewall Media, 2004.

2. Joshy Joseph and Craig Fellenstein, “Grid Computing”, Pearson Education, 2001.

3. Ian Foster and Carl Kesselman, “Grid Blue Print for New Computing Infrastructure”,

Morgan Kaufmann, 2000.

4. Fran Berman, Geoffrey Fox and Anthony J. G. Hey, “Grid Computing: Making the Global

Infrastructure a Reality”, Willy Publisher, 2001



M12113-Web Engineering: Course Outlines

Module 1: Introduction to WWW, HTML & XML

History and Evolution of Internet, WWW, Client Server Model, Internetworking, HTTP, Internet and

Intranet, Internet Address, Address Space, Internet Protocols, DNS, FTP, SMTP, Telnet, Internet Tools.

HTML Tags, Links, Lists, Frames, Forms, Special Tags, Cascading Style Sheets, Java Script Variables

& Data Types, Statements, Operators & Message Boxes, Linking HTML Forms with Java Script,

Overview of XML and SGML, XML Development Goal, Structure of XML Document, XML Parser,

XML Entities.

Module 2: Servlet & JSP

Introduction to Servlet, Servlet Life Cycle, HTTP Servlet Class, Request Interface, Response Interface,

Handling Servlet, JDBC Drivers, APIs and Techniques. Overview of JSP, Scripting Elements, JSP

Expressions, Scriplets, Declarations, Predefined Variables, Structuring Generated Servlet in JSP Pages,

Including Files and Applets in JSP Documents.

Module 3: EJB

Introduction to EJB, Java Beans, Types of Beans, Session Beans, Context and Naming Convention,

Creating Beans for Web Application, Deploying Beans.

Module 4: Web Security

Web Security Concepts, HTTP Authentication, Application Types, Security Implementation, Retrieving

Authentication Information, Security in Servlet, Form Based Custom Authorization, Retrieving SSL

Authentication.

References:

1. Deitel & Nieto “Internet and World Wide Web – How to program”, 4th Edition, Pearson Education

Asia, 2007.

2. Evan Bayross, “HTML, DHTML, Java Script, Perl, CGI”, BPB.

3. Sean McGrath “XML by Example: Building E-commerce applications”, Pearson Education Asia,

1998.

4. Hans Bergsten, “Java Server pages”, 3rd Edition, O’Reilly media, 2003.

5. Barry Burd “JSP: Java server pages”, IDG Books India, 2001.

6. Ed Roman “Mastering Enterprise Java Beans and the Java 2 Platforms”, 3rd Edition, Enterprise

Edition, 2004.



M12114-Network Flow and Traffic Engineering: Course Outlines

Module 1: Introduction

Network Flow Problems, Network Representations, Network Transformations, Complexity Analysis,

Developing Polynomial Time Algorithms, Search Algorithms, Flow Decomposition Algorithms.

Module 2: Shortest Path Algorithms

Shortest Paths: Label Setting Algorithms – Dijstra’s Algorithm, Dial’s Implementation, Heap

Implementation, Radix Heap Implementation. Shortest Paths : Label Correcting Algorithms – Generic Label

Correcting Algorithms, Special Implementations of the Modified Label Correcting Algorithm, Detecting

Negative Cycles, All Pairs Shortest Path Problem, Minimum Cost–to–Time Ratio Cycle Problem.

Module 3: Maximum and Minimum Flow Algorithms

Maximum Flows: Generic Augmenting Path Algorithm, Labeling Algorithm and Max- Flow Min–Cut

Theorem, Capacity Scaling Algorithm, Distance Labels and Layered Networks, Generic Pre Flow Push

Algorithm, FIFO Pre Flow Push Algorithm, Flows in Unit Capacity Networks, Flows in Bipartite Networks,

Flows in Planar Undirected Networks. Minimum Cost Flows: Optimality Conditions, Cycle Canceling

Algorithm and the Integrity Property, Successive Shortest Path Algorithm, Primal–Dual Algorithm, Out–of

Kilter Algorithm, Capacity Scaling Algorithm, Cost Scaling Algorithm, Minimum Mean Cycle Canceling

Algorithm.

Module 4: Trees And Forest

Minimum Spanning Trees, Kruskal’s Algorithm, Prim’s Algorithm, Sollin’s Algorithm, Convex Cost Flows,

Pseudo Polynomial Time Algorithm, Polynomial Time Algorithm Generalized Flows, Augmented Forest

Structures, Determining Potentials and Flows for an Augmented Forest Structure, Generalized Network

Simplex Algorithm.

References:

1. Ravindra K. Ahuja, Thomas L. Magnanti, James B.Orlin, “Network Flows – Theory, Algorithms and

Applications”, 1st Edition, Prentice Hall, 1993.

2. Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali, “Linear Programming and Network Flows”, 4th

Edition, John Wiley & Sons, 2009.

3. Gunther Ruhe, Kluwer, “Algorithmic Aspects of Flows in Networks”, Academic Publishers Group, 1991.

4. Michael W. Lucas, “Network Flow Analysis”, No Starch Press, 2010.

5. Alexander Engau, Vdm Verlag Dr. Muller, “Semi-Simultaneous Flows in Multiple Networks”,

Aktiengesellschaft & Co. Kg, 2008.