Sathyabama University: Jeppiaar Nagar, Rajiv Gandhi Salai, Chennai - 119

SATHYABAMA UNIVERSITY
(Established under section 3 of UGC Act, 1956)
Jeppiaar Nagar, Rajiv Gandhi Salai, Chennai - 119.
SYLLABUS
MASTER OF ENGINEERING PROGRAMME
IN
COMPUTER SCIENCE AND ENGINEERING
(4 SEMESTERS)
REGULATIONS 2010
FACULTY OF COMPUTER SCIENCE AND ENGINEERING
REGULATIONS 2010
Effective from the academic year 2010-2011 and applicable to the students admitted to the Master of Engineering
/ Technology / Architecture /Science (Four Semesters)
1.
Structure of Programme
1.1
1.2
2.
Every Programme will have a curriculum with syllabi consisting of theory and practical such as:
(i)
General core courses like Mathematics
(ii)
Core course of Engineering / Technology/Architecture / Science
(iii)
Elective course for specialization in related fields
(iv)
Workshop practice, Computer Practice, laboratory Work, Industrial Training, Seminar

Presentation, Project Work, Educational Tours, Camps etc.
Each semester curriculum shall normally have a blend of lecture course not exceeding 7 and practical
course not exceeding 4.
1.3 The medium of instruction, examinations and project report will be English.
Duration of the Programme
A student is normally expected to complete the M.E/M.Tech./M.Arch/M.Sc Programme in 4 semesters but in
any case not more than 8 consecutive semesters from the time of commencement of the course. The
Head of the Department shall ensure that every teacher imparts instruction as per the number of hours specified
in the syllabus and that the teacher teaches the full content of the specified syllabus for the course being
taught.
3.
Requirements for Completion of a Semester

A candidate who has fulfilled the following conditions shall be deemed to have satisfied the requirement for
completion of a semester.
4.
3.1
He/She secures not less than 90% of overall attendance in that semester.
3.2
Candidates who do not have the requisite attendance for the semester will not be permitted to
write the University Exams.
Examinations
The examinations shall normally be conducted between October and December during the odd semesters and
between March and May in the even semesters. The maximum marks for each theory and practical course
(including the project work and Viva Voce examination in the Fourth Semester) shall be 100 with the following
breakup.
(i)
(ii)
Theory Courses
Internal Assessment :
20 Marks
University Exams
80 Marks
Practical courses
Internal Assessment :
- -
University Exams
100 Marks
M.E(COMPUTER SCIENCE AND ENGINEERING)
REGULATIONS 2010
5.
6.
Passing requirements
(i)
A candidate who secures not less than 50% of total marks prescribed for the course (For all courses
including Theory, Practicals and Project work) with a minimum of 40 marks out of 80 in the University
Theory Examinations, shall be declared to have passed in the Examination.
(ii)
If a candidate fails to secure a Pass in a particular course, it is mandatory that he/she shall reappear
for the examination in that course during the next semester when examination is conducted in that
course. However the Internal Assessment marks obtained by the candidate in the first attempt shall
be retained and considered valid for all subsequent attempts.
Eligibility for the Award of Degree

A student shall be declared to be eligible for the award of the M.E/M.Tech./M.Arch./M.Sc degree provided the
student has successfully completed the course requirements and has passed all the prescribed examinations in
all the 4 semesters within the maximum period specified in clause 2.
7.
Award of Credits and Grades

All assessments of a course will be done on absolute marks basis. However, for the purpose of reporting the
performance of a candidate, Letter Grades will be awarded as per the range of total marks (out of 100) obtained
by the candidate as given below:
RANGE OF MARKS FOR GRADES

Range of Marks
Grade
Grade Points (GP)
90-100
A++
10
80-89
A+
70-79
B++
60-69
B+
50-59
00-49
ABSENT
CUMULATIVE GRADE POINT AVERAGE CALCULATION

The CGPA calculation on a 10 scale basis is used to describe the overall performance of a student in
all courses from first semester to the last semester. F and W grades will be excluded for calculating GPA
and CGPA.
CGPA =
i C i GP i
i Ci
where Ci - Credits for the subject

GP i - Grade Point for the subject
i - Sum of all subjects successfully cleared during all the semesters
ii
REGULATIONS 2010
8.
Classification of the Degree Awarded

1
A candidate who qualifies for the award of the Degree having passed the examination in all the
courses of all the semesters in his/her first appearance within a maximum period of 4 consecutive
semesters after commencement of study securing a CGPA not less than 9.0 shall be declared to
have passed the examination in First Class Exemplary.
2.
courses of all the semesters in his/her first appearance within a maximum period of 4 consecutive
semesters after commencement of study, securing a CGPA not less than 7.5 shall be declared to
have passed the examination in First Class with Distinction.
3.
courses of all the semesters within a maximum period of 4 consecutive semesters after
commencement of study securing a CGPA not less than 6.0 shall be declared to have passed
the examination in First Class.
All other candidates who qualify for the award of the Degree having passed the examination in all
the courses of all the 4 semesters within a maximum period of 8 consecutive semesters after his/her
commencement of study securing a CGPA not less than 5.0 shall be declared to have passed
the examination in Second Class.
A candidate who is absent in semester examination in a course/project work after having registered
for the same, shall be considered to have appeared in that examination for the purpose of
classification of degree. For all the above mentioned classification of Degree, the break of study
during the programme, will be counted for the purpose of classification of degree.
A candidate can apply for revaluation of his/her semester examination answer paper in a theory
course, within 1 week from the declaration of results, on payment of a prescribed fee along with
prescribed application to the Controller of Examinations through the Head of Department. The
Controller of Examination will arrange for the revaluation and the result will be intimated to the
candidate concerned through the Head of the Department. Revaluation is not permitted for practical
courses and for project work.
Final Degree is awarded based on the following :

CGPA 9.0
First Class - Exemplary
CGPA 7.50 < 9.0
First Class with Distinction
CGPA 6.00 < 7.50
First Class
CGPA 5.00 < 6.00
Second Class
Minimum CGPA requirements for award of Degree is 5.0 CGPA.

9.
Discipline
Every student is required to observe disciplined and decorous behaviour both inside and outside the University
and not to indulge in any activity which will tend to bring down the prestige of the University. If a student
indulges in malpractice in any of the University theory / practical examination, he/she shall be liable for punitive
action as prescribed by the University from time to time.
10.
Revision of Regulations and Curriculum

The University may revise, amend or change the regulations, scheme of examinations and syllabi from time to
time, if found necessary.
iii
REGULATIONS 2010
M.E - COMPUTER SCIENCE AND ENGINEERING

REGULATIONS 2010 - CURRICULUM
SEMESTER I
Sl .No. SUBJECT CODE
SUBJECT TITLE
Page No.
THEORY
1
SMTX5009
Advanced Optimization Techniques
SCSX5001
Advanced Data Structures & Algorithms
SCSX5002
Compiler Design
SCSX5003
Computer Networks & Protocols
SCSX5004
Advanced Computer Architecture
SCSX6501
Advanced Data Structures Laboratory
PRACTICAL
6
TOTAL CREDITS : 19
SEMESTER II
Sl.No.
SUBJECT CODE
SUBJECT TITLE
Page No.
THEORY
1
SCSX5005
Advanced Databases
SCSX5006
Advanced Operating System
SCSX5007
Object Oriented Software Engineering
Elective - I
Elective - II
Operating System Laboratory
PRACTICAL
6
SCSX6502
TOTAL CREDITS : 18
SEMESTER III
Sl.No. SUBJECT CODE
SUBJECT TITLE
Page No.
THEORY
1
SCSX5008
Data Mining & Warehousing
10
SCSX5009
Computational Intelligence Tools
11
SCSX5010
Web Technology
12
Elective - III
Elective - IV
Web Technology Laboratory
PRACTICAL
6
SCSX6503
13
TOTAL CREDITS : 18
iv
REGULATIONS 2010
SEMESTER IV
Sl.No. SUBJECT CODE
1
S31XPROJ
SUBJECT TITLE
Project Viva Voce
30
15
TOTAL CREDITS : 15
TOTAL COURSE CREDITS : 70
LIST OF ELECTIVES
Sl.No. SUBJECT CODE
SUBJECT TITLE
Page No.
SCSX5011
Network Security
14
SCSX5012
Software Architecture
15
SCSX5013
Natural Language Processing
16
SCSX5014
Network Management System
17
SCSX5015
Agent Based Intelligent Systems
18
SCSX5016
Machine Learning
19
SCSX5017
Ethical Hacking & Digital Forensics
20
SCSX5018
Grid Computing
21
SCSX5019
Performance Evaluation of Systems and Networks
22
10
SCSX5020
Knowledge Engineering
23
11
SCSX5021
Digital Image Processing
24
12
SCSX5022
Virtualization Techniques
25
13
SCSX5023
Service Oriented Architecture
26
14
SCSX5024
Cloud Computing
27
15
SCSX5025
Multicore Architecture
28
16
SCSX5026
Mobile & Pervasive Computing
29
17
SCSX5027
Software Quality Assurance & Testing
30
18
SCSX5028
Software Project Management
31
19
SMTX5008
Mathematical Foundations For Computer Science
32
20
SECX5079
Wireless Sensor Networks
33
21
SECX5080
High Performance Networks
34
L Lecture hours; T Tutorial hours; P Practical hours; C Credits
REGULATIONS 2010
SMTX5009
ADVANCED OPTIMIZATION TECHNIQUES
Credits
Total Marks
100
UNIT I INTRODUCTION TO OPTIMIZATION
10 hrs.
Formulation of optimization problem- Classification - Bounded Variable problems- Bounded

variable simplex algorithm-Integer Programming- Gomory All Integer cutting plane Method-Gomory Mixed Integer
Method-Branch and Bound Method .
UNIT II NON LINEAR PROGRAMMING
10 hrs.
Introduction Unconstrained and Constrained Optimization- Kuhn Tucker conditions- Relative Maximum and
Minimum values- Method of Lagrangian Multipliers- Hessian Matrix- Quadratic programming- Wolfes Modified Simplex
Method Problems
UNIT III DYNAMIC PROGRAMMING
10 hrs.
Recursive relationship - Solution to recursive equation - Dynamic Programming Algorithm - Principle of Optimality
- Maximum and minimum values - Solution of LPP by Dynamic Programming - Multi stage problem.
UNIT IV QUEUEING NETWORKS
10 hrs.
Introduction to concept of queueing Models - Single Server - Multiple server Models - Problems - Pollaczek
theorem. Theoritical concepts of Open queueing networks (Theory) - Closed Queueing Networks (Theory) - Queues
in series (Theory).
UNIT V DECISION ANALYSIS & SIMULATION
10 hrs.
Introduction to Decision Making process Elements Decision making under uncertainity Maximin and Maximac
criteria - Hurwicz criterion Laplace criterion Minimax Regret criterion Decision tree analysis- Problems
Discrete Even Simulation Monte Carlo Simulation Stochastic Simulation Applications to Queueing systems.
REFERENCE BOOKS:
1.
2.
3.
4.
5.
6.
Hamdy Taha, Operation Research , PHI, 5th Edition., 1995

Hiller& Liberman, Introduction to Operation Research, McGraw Hill 5th Editionn., 2001
Ravindran,Phillips&Solberg, Operations Research : Principles and Practice, Wiley India Lts , 2nd Edition., 2007
Mital K.V. and Mohan. C, Optimization Methods in O.R and System Analysis, New Age International Publishers.
Sharma .S.D, Operations Research, Kedarnath Ramnath& Co, 2002
Gupta. P.K and Man Mohan Problems in Operations Research, Sultan Chand and Sons,7th Edition, 1995
UNIVERSITY EXAM QUESTION PAPER PATTERN

Max. Marks : 80
PART A : 6 questions of 5 marks each without choice
PART B : 2 questions from each unit of internal choice, each carrying 10 marks
Exam Duration : 3 hrs.

30 marks
50 marks
REGULATIONS 2010
SCSX5001
ADVANCED DATA STRUCTURES AND

ALGORITHMS
Credits
Total Marks
100
UNIT I INTRODUCTION TO ALGORITHMS
10 hrs.
Role of Algorithms in computing- Analyzing algorithm- Designing algorithm- Asymptotic Notations- Summations
-Formulas and properties- Recurrences.
SORTING TECHNIQUES
Heapsort Quicksort-Radix sort- Bucket sort- Analysis of sorting techniques.
UNIT II TREE STRUCTURES
10 hrs.
Binary Search Trees AVL Trees Red-Black trees-B-Trees Splay Trees
HEAP STRUCTURES
Min/Max heaps -Leftist Heaps Binomial Heaps Fibonacci Heaps
UNIT III MULTIMEDIA STRUCTURES
10 hrs.
Segment Trees k-d Trees Point Quad Trees MX-Quad Trees R-Trees TV-Trees.
UNIT IV PROBLEM SOLVING TECHNIQUES
10 hrs.
Branch & Bound -NP hard and NP complete problems - Huffman Coding - Activity Networks - Flow Shop
Scheduling -Randomized Algorithms - Greedy algorithms - Back tracking -Dynamic programming - Divide and Conquer
UNIT V GRAPH ALGORITHMS
10 hrs.
Graphic Representation BFS DFS Topological Sort Connnected Components Minimum Spanning trees
Kruskals Algorithm Prims Algorithm Dijkstras Algorithm Floyds Algorithm Bellman Ford Algorithm
REFERENCE BOOKS:
1.
2.
3.
4.
5.
Thomas H .Coreman, Charles E.Leiserson, Ronald L.Rivest, Introduction to Algorithms, PHI, 2002.
Sara Baase, Allen Ran Gelda, Computer Algorithms and Introduction to Design and Analysis, Pearson,2000
Sahni ,Data Structures algorithm and Application in C++ , PHI, 2000
Mark Allen Weiss, Data Structures and Algorithms in C++, Addison wesley
Aho. A.V,Hopcroft J.E, and Ullman.J.D, Design and analysis of Computer Algorithms, Addison wesley ,1974.

Max. Marks : 80

30 marks
50 marks
REGULATIONS 2010
COMPILER DESIGN
SCSX5002
Credits
Total Marks
100
UNIT I LEXICAL PHASE
10 hrs.
Principles of compiler- Compiler structure- Lexical analysis-buffering schemes-Regular expression-Design of lexical

analyser-finite automata-types-Minimised DFA-Direct method-Implementation of lexical analyser generator-Study of LEX
tool-Examples.
UNIT II SYNTAX &SEMANTIC PHASE
10 hrs.
Grammar-Syntax tree - Regular expression Vs CFG-Capabilities of CFG-Parsing-Types-Shift Reduce

Parsing-Operator Precedence Parsing - Predicive Parsing-Recursive Decent parsing - LR parsing-SLR,CALR and LALR
parsing - Run time environment - YACC tool - Examples
UNIT III INTERMEDIATE CODE GENERATION
10 hrs.
Syntax directed translation - Evaluation of inherited and synthesized attribute - Top-down and Bottom-up
translators - Intermediate languages - Declaration - Assignment statements - Boolean expressions - Flow control
statements -Back patching-Flow control statements-Procedure calls-Symbol table Organization.
UNIT IV CODE OPTIMIZATION
10 hrs.
Introduction to code optimization -Loop optimization- Procedure optimization in-line expansion Leaf routine
optimization and shrink wrapping Register allocation and assignment Graph coloring Data flow analysis Constant
propagation- Alias analysis Register allocation Global references Optimization for memory hierarchy -Code
Scheduling Instruction scheduling Speculative scheduling Software pipelining Trace scheduling Run-time
support Register usage Local stack frame Run-time stack Code sharing Positionindependent code.
UNIT V CODE GENERATION
10 hrs.
Issues in the design of a code generator Three address code generation algorithm - Run time
environment-Design of a simple code generator.
REFERENCE BOOKS:
1.
2.
3.
4.
5.
Alfred V.Aho, Ravi Sethi, Jeffery D.Ullman, Compilers Principles, Techniques and Tools, Addison- Wesley Publishing Company, 1986.
Jeans Paul Tramblay and Paul G.Sorenson, The Theory and Practice of compiler Writing, McGraw-Hill Book Company, 1985.
Dhamdhere D.M, Introduction to System Software Tata McGraw-Hill Publishing Company, 1986.
Alfred V.Aho and Jeffrey D.Ullman, Principles of Compiler Design Addison Wesley, 1977.
Steven S. Muchnick, Advanced Compiler Design Implementation, Morgan Koffman Elsevier Science, India, First Edition 2004

Max. Marks : 80

30 marks
50 marks
REGULATIONS 2010
SCSX5003
COMPUTER NETWORKS AND PROTOCOLS
Credits
Total Marks
100
UNIT I NETWORK DESIGN AND TRANSMISSION MEDIA
10 hrs.
Components-Topologies-ISO / OSI reference model-layered architecture-TCP/IP architecture and protocol-IP

Utilities -Transmission media- SONET-Signaling-cellular network
UNIT II DIGITAL TRANSMISSION AND P2P PROTOCOL
10 hrs.
Characterization of communication channels-Line coding-Error detection and correction-FEC-peer to peer

protocols-ARQ protocols-Adaptation functions-Data link control-Channelization
UNIT III IEEE 802.X LAN STANDARDS AND ROUTING TECHNIQUES
10 hrs.
IEEE 802 LAN Standards-LAN bridges-Packet network topology-Routing in packet networks- Shortest path
algorithm-Congestion control techniques
UNIT IV TCP/IP
10 hrs.
Ipv4 and Ipv6-User Datagram Protocol-Transmission Control Protocol-DHCP and Mobile IP-Internet routing
protocols Multicasting routing.
UNIT V ADVANCED ARCHITECTURE AND MULTIMEDIA NETWORKING
10 hrs.
IP forwarding architectures- Overlay models-MPLS-RSVP-Real time transport protocol[RTCP]-Session control

protocol
REFERENCE BOOKS:
1. Leon Garcia.Widjaja, Communication Networks, Tata Mcgraw-Hill, Sixth Edition, 2002.
2. Behrouz A. Forouzan, Data communication and Networking, Tata McGraw-Hill 2nd edition , 2006.
3. Andrew S. Tanenbaum, Computer Networks, PHI, Fourth Edition, 2003.
4. Prakash C Gupta, Data communication and Networks, PHI, 2009.

Max. Marks : 80
30 marks
50 marks
REGULATIONS 2010
SCSX5004
ADVANCED COMPUTER ARCHITECTURE
Credits
Total Marks
100
UNIT I INTRODUCTION AND MEMORY ORGANISATION
10 hrs.
Evolution of Computers - CPU Organisation - Optimizations of Cache Performance - Memory Technology and
Optimizations - Protection: Virtual Memory and Virtual Machines - Design of Memory Hierarchies - Case Studies
UNIT II ADVANCED TECHNIQUES FOR EXPLOITING ILP
10 hrs.
Introduction Parallel Processing - Instruction Level Parallelism and Its Exploitation - Concepts and Challenges
-Compiler Techniques for Exposing ILP - Limitations on ILP for Realizable Processors - Hardware versus Software
Speculation - Multithreading: Using ILP Support to Exploit Thread-level Parallelism
UNIT III MULTI-CORE ARCHITECTURES
10 hrs.
SMT and CMP architectures Design issues Intel Multi-core architecture SUN CMP architecture IBM cell
architecture - HP architecture RISC architecture.
UNIT IV MULTIPROCESSORS
10 hrs.
Symmetric and distributed shared memory architectures Cache coherence issues - Performance Issues
Synchronization issues Models of Memory Consistency - Interconnection networks Buses, crossbar and multi-stage
switches
UNIT V PIPELINING AND VECTOR PROCESSING
10 hrs.
Pipelining Arithmetic Pipeline Instruction Pipeline RISC Pipeline Vector Processing Vector Operations
REFERENCES BOOKS :
1. John L. Hennessey and David A. Patterson, Computer Architecture A quantitative approach, Morgan Kaufmann / Elsevier, 4 th.
edition, 2007.
2. John P. Hayes, Computer Architecture and Organisation ,MCGraw Hill. 3rd Edition, 1998,
3. Hwang K. and Briggs. F.A, Computer Architecture and Parallel Processing, MCGraw Hill, 1985.

Max. Marks : 80

30 marks
50 marks
REGULATIONS 2010
SCSX5005
ADVANCED DATABASES
Credits
Total Marks
100
UNIT I PARALLEL AND DISTRIBUTED DATABASES
10 hrs.
Database System Architectures: Centralized and Client-Server Architectures Server System Architectures
Parallel Systems- Distributed Systems Parallel Databases: I/O Parallelism Inter and Intra Query Parallelism Inter
and Intra operation Parallelism Distributed Database Concepts - Distributed Data Storage Distributed Transactions
Commit Protocols Concurrency Control Distributed Query Processing Three Tier Client Server ArchitectureCase Studies.
UNIT II OBJECT AND OBJECT RELATIONAL DATABASES
10 hrs.
Concepts for Object Databases: Object Identity Object structure Type Constructors Encapsulation of
Operations Methods Persistence Type and Class Hierarchies Inheritance Complex Objects Object Database
Standards, Languages and Design:ODMG Model ODL OQL Object Relational and Extended Relational Systems
: Object Relational featuresinSQL/Oracle Case Studies.
UNIT III XML DATABASES
10 hrs.
XML Databases: XML Data Model DTD - XML Schema - XML Querying Web Databases JDBC
Information Retrieval Data Warehousing Data Mining.
UNIT IV MOBILE DATABASES
10 hrs.
Mobile Databases: Location and Handoff Management - Effect of Mobility on Data Management - Location
Dependent Data Distribution - Mobile Transaction Models - Concurrency Control - Transaction Commit Protocols- Mobile
Database Recovery Schemes
UNIT V MULTIMEDIA DATABASES
10 hrs.
Multidimensional Data Structures Image Databases Text/Document Databases- Video Databases Audio
Databases Multimedia Database Design.
REFERENCES BOOKS :
1. Elmasri.R, Navathe. S.B, Fundamentals of Database Systems, Fifth Edition, Pearson Education/Addison Wesley, 2007.
2. Thomas Cannolly and Carolyn Begg, Database Systems, A Practical Approach to Design, Implementation and Management, Third
Edition, Pearson Education, 2007.
3. Henry F Korth, Abraham Silberschatz, S. Sudharshan, Database System Concepts, Fifth Edition, McGraw Hill, 2006.
4. Date. C.J,Kannan.A and Swamynathan. S,An Introduction to Database Systems, Eighth Edition, Pearson Education, 2006.

Max. Marks : 80

30 marks
50 marks
REGULATIONS 2010
SCSX5006
ADVANCED OPERATING SYSTEM
Credits
Total Marks
100
UNIT I INTRODUCTION
10 hrs.
Overview of processes Processor Inter Process communication Critical sections Semaphores Process
scheduling Performance evaluation Deadlocks: prevention,avoidance detection and recovery.
UNIT II STORAGE ORGANIZATION
10 hrs.
Management strategies Contiguous and non-contiguous storage allocation Fixed partition multi-programming
Variable partitions Swapping. Virtual storage, Multilevel organizations, block mapping, paging, segmentation, paging
/ segmentation systems Page replacement locality-Working sets Demand paging Anticipatory paging page
release Page size Program behavior under paging.
UNIT III FILE SYSTEMS
10 hrs.
Structures, types File operations Memory mapped files Hierarchical directory systems File system
implementation Shared files Protection and security- Case study on design of Unix and MSDOS
UNIT IV DISTRIBUTED OPERATING SYSTEMS
10 hrs.
Introduction Hardware and software concepts Multiprocessor time sharing system Design issues Layered
protocols Client server model - Remote procedure calls.
UNIT V THREADS & FILE SYSTEMS
10 hrs.
Distributed operating systems - Clock synchronization algorithms Threads Design issues of threaded packages
Design and implementation issues of processor allocation algorithms Distributed file system.
REFERENCE BOOKS:
1.
2.
3.
4.
5.
Silberschatz, Peterson and Galving, Operating System Concepts, Addison Wesley Publishing Company, 3rd Edition 1991.
Milenkovich M., Operating Systems: Concepts and Design, McGraw Hill Inc., 2nd Edition, 1992.
Tannenbaum. A.S, Modern Operating System Prentice Hall 1992.
Bach, M.J Design of Unix Operating SystemPrentice Hall India Ltd., 1988.
She Tov Levi, Ashok K.Agarwal, Real Time System Design, Mc Graw Hill Publishing Company 1990.

Max. Marks : 80

30 marks
50 marks
REGULATIONS 2010
SCSX5007
OBJECT ORIENTED SOFTWARE ENGINEERING
Credits
Total Marks
100
UNIT I PROCESS MODELS
10 hrs.
Software Process - Process models - unified process - Iterative and Incremental - Agile software development
- Formal methods - Process improvement models.
Object models Classes and objects - Notations- OOSD life cycle UML diagrams.
UNIT II ANALYSIS OF MODELS
10 hrs.
Requirements elicitation Usecases - Analysis of object models - Analysis of dynamic models - Functional and
non-functional requirements - Analysis patterns - C&Y CRC technique - Cohesion and Coupling
UNIT III OBJECT MODEL
10 hrs.
Static object modeling - Identification of classes dynamic object modeling - Interaction diagrams - Interface
specification Object constraint language.
UNIT IV OO TESTING STRATEGIES
10 hrs.
Testing OOA and OOD Models OO Testing Strategies Test Case Design for OO Software Testing Methods
applicable at the class level Interclass test design Metrics for the OO design model OO metrics Metrics for
OO testing- Software configuration management - Reverse Engineering and Reengineering - Quality Standards.
UNIT V MAINTENANCE & RISK ANALYSIS
10 hrs.
Maintenance-its importance-Problem tracking report (PTR), Risk management,CMM,COCOMO Model, Risk

Analysis, Software Project Scheduling and tracking- Software Architecture
Case Studies:-Intro to CASE TOOLS, Object Oriented database-Client /Server computing middleware
REFERENCE BOOKS:
1.
2.
3.
4.
5.
6.
7.
Stephen R Schach,Classical Object Oriented Software Engineering With UML and Java, McGraw-Hill International edition
Brett McLaughlin, Gary Pollice, David West, Head First Object Oriented Analysis and Design, Oreilly series- 2006
John D McGregor, David A Sykes, A Practical Guide to Testing Object Oriented Software, 2001
Pressman R.S,Software Engineering McGraw-Hill 6th edition .
Ali Bahrami, Object Oriented System Development using UML, McGraw-Hill International edition, 2005
Graddy Booch, James Rumbaugh,Ivar Jacobson The Unified Modeling Language, Addison-Wesley Professional
Robert Binder, Testing Object oriented Systems: Models, Patterns and Tools, Addison-Wesley,1999

Max. Marks : 80

30 marks
50 marks
REGULATIONS 2010
SCSX6501
ADVANCED DATA STRUCTURES LAB
Credits
Total Marks
100
Credits
Total Marks
100
LIST OF EXPERIMENTS
1.
Polynomial Differentiation.
2.
Printing the node details level wise
3.
Searching the given element from N*N matrix using Binary search
4.
Knapsack Problem using Greedy Method
5.
Traveling salesman Problem
6.
Binary Tree Traversal
7.
Implementing RED BLACK Trees
8.
Minimum Spanning Tree using KRUSKAL Algorithm
9.
Minimum Spanning Tree using FLOYD WARSHALL Algorithm
10.
Implementing Oct trees
11.
Implementing quad trees
SCSX6502
OPERATING SYSTEM LABORATORY

LIST OF EXPERIMENTS
1.
Implement the following CPU scheduling algorithm.

a. FCFS
b. Round Robin
c. Shortest Job First
2.
Implement the Mutual Exclusion problem using Dekkers Algorithm.
3.
Implement the Inter Process Communication Problem (Producer Consumer / Reader-Writer problem) using
semaphores.
4.
Implement Best-Fit, First-Fit Algorithm for Memory management.
5.
Implement Memory Allocation with Pages.
6.
Implement FIFO Page Replacement Algorithm.
7.
Implement LRU Page Replacement Algorithm.
8.
Implement the creation of Shared memory Segment.
9.
Implement File Locking.
10.
Implement Bankers Algorithm.
REGULATIONS 2010
SCSX5008
DATA MINING AND WAREHOUSING
Credits
Total Marks
100
UNIT I INTRODUCTION
10 hrs.
Data mining- Introduction - Data Mining Functionalities-Steps in Data Mining Process-Architecture of a Typical
Data Mining Systems- Classification of Data Mining Systems Major Issues in Data Mining
DATA PREPROCESSING
Data Preprocessing-Data Cleaning Integration Transformation Reduction - Discretization Concept Hierarchies
UNIT II CONCEPT DESCRIPTION AND ASSOCIATION RULES
10 hrs.
Concept Description - Data Generalization and Summarization based Characterization - Mining Association Rules
In Large Databases.
UNIT III PREDICTIVE MODELING
10 hrs.
Classification and Prediction - Issues Regarding Classification and Prediction-Classification By Decision Tree
Induction-Bayesian Classification-Other Classification Methods-Prediction-Clusters Analysis: Types Of Data In Cluster
Analysis- Categorization Of Major Clustering Methods: Partitioning Methods Hierarchical Methods
UNIT IV DATA WAREHOUSING
10 hrs.
Introduction -Multi Dimensional Data Model- Data Warehouse Architecture-Data Warehouse Implementation- From
Data warehousing to Data Mining-OLAP-Need- Categorization Of OLAP Operations.
UNIT V APPLICATIONS
10 hrs.
Applications of Data Mining-Social Impacts Of Data Mining-Tools-An Introduction to DB Miner-Case Studies-Mining

WWW-Mining Text Database-Mining Spatial Databases.
REFERENCE BOOKS:
1. Jiawei Han, Micheline Kamber, "Data Mining: Concepts and Techniques", Morgan Kaufmann Publishers, 2002.
2. Alex Berson,Stephen J. Smith, Data Warehousing, Data Mining,& OLAP, Tata Mcgraw- Hill, 2004.
3. Usama M.Fayyad, Gregory Piatetsky - Shapiro, Padhrai Smyth and Ramasamy Uthurusamy, "Advances In Knowledge Discovery And
Data Mining", The M.I.T Press, 1996.
4. Ralph Kimball, "The Data Warehouse Life Cycle Toolkit", John Wiley & Sons Inc., 1998.
5. Sean Kelly, "Data Warehousing In Action", John Wiley & Sons Inc., 1997.

Max. Marks : 80
10

30 marks
50 marks
REGULATIONS 2010
SCSX5009
COMPUTATIONAL INTELLIGENCE TOOLS
Credits
Total Marks
100
UNIT I ARTIFICIAL NEURAL NETWORKS
10 hrs.
The Artificial Neuron - Supervised Learning -Unsupervised Learning - Reinforcement Learning - Performance
Issues
UNIT II EVOLUTIONARY COMPUTATION
10 hrs.
Introduction - Genetic Algorithms - Genetic Programming - Evolutionary Programming - Evolution Strategies

Differential Evolution - Cultural Algorithms - Coevolution
UNIT III SWARM INTELLIGENCE
10 hrs.
Particle Swarm Optimization - Ant Colony Optimization Artificial Bee Colony Sheepflock Optimization
UNIT IV ARTIFICIAL IMMUNE SYSTEMS
10 hrs.
Natural Immune System - Learning the Antigen Structure - The Network Theory - The Danger Theory
Artificial Immune Models
UNIT V FUZZY SYSTEMS
10 hrs.
Fuzzy Sets - Fuzzy Logic and Reasoning - Fuzzy Inferencing - Fuzzy Controllers - Mamdani Fuzzy Controller
Takagi-Sugeno Controller - Rough Sets
REFERENCE BOOKS:
1. Andries . P. Engelbrecht , Computational Intelligence, Wiley Publications, Second Edition

Max. Marks : 80
30 marks
50 marks
11
REGULATIONS 2010
SCSX5010
WEB TECHNOLOGY
Credits
Total Marks
100
UNIT I WEB ESSENTIALS
10 hrs.
Internet Web clients-servers communication XHTML 1.0 Cascading Style sheets[CSS]: features- Style
rule-Style properties-Box model techniques
UNIT II CLIENT SIDE PROGRAMMING
10 hrs.
Java script objects Build in objects-DOM: History and levels- Document tree- DOM event handling- Non compliant
browsers .
UNIT III JAVA SERVLET AND JSP
10 hrs.
Server side programming Java servlets: basics Simple program Session management JSP : JSP basics
-JSP objects simple JSP pages.
UNIT IV ASP PROGRAMMING
10 hrs.
Active server page: ASP object - AJAX- Simple ASP pages-ASP Components-Database connectivity.
UNIT V RELATED TECHNOLOGIES
10 hrs.
Building Web applications - Cookies Sessions Open source environment PHP basis and simple program
MYSQL -SOAP basis Case studies.
REFERENCE BOOKS:
1. Jeffrey C Jackson, Web Technology A computer Science perspective, Person Education, 2007.
2. Chris Bates, Web Programming Building Internet Applications, Wiley India, 2006.
3. Deitel & Deitel Internet and World Wide Web How to Program, Third Edition.
4. Gopalan. N.P , Web Technology A Developer Perspectives, PHI, 2009.

Max. Marks : 80
30 marks
50 marks
12
REGULATIONS 2010
SCSX6503
WEB TECHNOLOGY LAB
Credits
Total Marks
100
LIST OF EXPERIMENTS
HTML
1. Create a personalized web page using HTML. The web page must include links about yourself, your curriculum
vitae (forms), album (img tags), tutorials and contacts. All types of hyper-links should be used.
2. Create a web page using frames, ordered and unordered list.
XML
Develop a simple application using XML
JAVA SCRIPT
1. Perform client side validation for an e-mail registration form using Java Script.
2. Create a simple quiz application with timer using Java Script.
3. Develop an application to fetch information from a database with AJAX
JAVA APPLETS
1. Create an applet application and load an image in the applet.
2. Create a Java application to show how mouse events are handled.
ASP
Develop a simple application using ASP
PHP
Develop a simple application using PHP
WEB APPLICATIONS
Creating a simple web service using SOAP.
13
REGULATIONS 2010
SCSX5011
NETWORK SECURITY
Credits
Total Marks
100
UNIT I INTRODUCTION & MATHEMATICAL FOUNDATION
10 hrs.
Beginning with a simple communication game Wresting between safeguard and attack Probability and
Information Theory - Algebraic foundations Number theory.
UNIT II ENCRYPTION SYMMETRIC TECHNIQUES
10 hrs.
Substitution Ciphers - Transposition Ciphers - Classical Ciphers DES AES Confidentiality Modes of
Operation Key Channel Establishment for symmetric cryptosystems.
UNIT III ENCRYPTION ASYMMETRIC TECHNIQUES & DATA INTEGRITY TECHNIQUES
10 hrs.
Diffie-Hellman Key Exchange protocol Discrete logarithm problem RSA cryptosystems & cryptanalysis
ElGamal cryptosystem Need for stronger Security Notions for Public key Cryptosystems Combination of Asymmetric
and Symmetric Cryptography Key Channel Establishment for Public key Cryptosystems - Data Integrity techniques
Symmetric techniques - Asymmetric techniques
UNIT IV AUTHENTICATION
10 hrs.
Authentication Protocols Principles Authentication protocols for Internet Security SSH Remote logic protocol
Kerberos Protocol SSL & TLS Authentication frame for public key Cryptography Directory Based Authentication
framework Non - Directory Based Public-Key Authentication framework .
UNIT V SECURITY PRACTICES
10 hrs.
Protecting Programs and Data Information and the Law Rights of Employees and Employers Software
Failures Computer Crime Privacy Ethical Issues in Computer Security.
REFERENCE BOOKS:
1.
2.
3.
4.
Wenbo Mao, Modern Cryptography Theory and Practice, Pearson Education, First Edition, 2006.
Douglas R. Stinson ,Cryptography Theory and Practice , Third Edition, Chapman & Hall/CRC,2006.
Charles B. Pfleeger, Shari Lawrence Pfleeger, Security in Computing, Fourth Edition, Pearson Education, 2007.
Wade Trappe and Lawrence C. Washington, Introduction to Cryptography with Coding Theory, Second Edition, Pearson Education, 2007

Max. Marks : 80
14

30 marks
50 marks
REGULATIONS 2010
SCSX501
SOFTWARE ARCHITECTURE
Credits
Total Marks
100
UNIT I SOFTWARE PROCESS AND THE ROLE OF MODELING AND ANALYSIS
10 hrs.
Analysis modeling and best practices Process - Process modeling - process notations Traditional best practice
diagrams such as DFDs and ERDs.
UNIT II ARCHITECTURAL MODELING
10 hrs.
UML diagrams - Structural static modeling - Behavioural modeling Interactions Use cases Use case,
interaction & Activity diagrams - Component and deployment diagrams analysis case studies - analysis patterns.
UNIT III SOFTWARE ARCHITECTURE DESIGN
10 hrs.
Design best practices - Design patterns Creational patterns Structural patterns Behavioural patterns Component technology - Object oriented frameworks - Distributed objects - Interoperability standards- Case studies.
UNIT IV SOFTWARE ARCHITECTURE
10 hrs.
Architectural styles - Architectural patterns - Patterns and software architecture - Analysis of architectures Formal descriptions of software architectures.
UNIT V ARCHITECTURAL DESCRIPTION LANGUAGES ADL AND TOOLS
10 hrs.
Requirements of Architecture Description languages - Tools for Architectural design - Scalability and
Interoperability issues, Web application architectures - case studies.
REFERENCE BOOKS:
1. Grady Booch, James Rumbaugh, Ivar Jacobson, The Unified Modeling Language User Guide, Addison Wesley, 1999.
2. Erich Gamma, Richard Helm, Ralph Johnson and John Vlissides, Design Patterns, Elements of reusable Object Oriented Software,
Addison Wesley 1995.
3. Frank Buschmann et al, Pattern Oriented Software Architecture, Volume 1: A system of patterns, John Wiley and Sons, 1996.
4. Len Bass, Paul Clements, Rick Kazman, Software Architecture in Practice, Second Edition, Addison Wesley, 1998.
5. Mary Shaw and David Garlan, Software Architecture Perspectives on an emerging Discipline:, Prentice Hall, 1996.

Max. Marks : 80
15

30 marks
50 marks
REGULATIONS 2010
SCSX5013
NATURAL LANGUAGE PROCESSING
Credits
Total Marks
100
UNIT I LINGUISTIC BACKGROUND
10 hrs.
An outline of English syntax Grammars and Parsing features and Augmented Grammars.
UNIT II SYNTACTIC PROCESSING
10 hrs.
Grammars for Natural language Toward efficient parsing - Bottom-up parsing - Top-down parsing Transition
Network Grammars.
UNIT III FEATURES AND AUGMENTED GRAMMARS
10 hrs.
Feature systems and Augmented Grammars Some basic feature systems for English Morphological analysis
and the lexicon Grammar using features Parsing with features Augmented transition networks Generalized
feature systems and unification grammars.
UNIT IV GRAMMARS FOR NATURAL LANGUAGE
10 hrs.
Auxiliary verbs and verb phrases Movement phenomena in language Handling questions in context Free
grammars relative clauses Hold mechanism in ATNs.
UNIT V TOWARD EFFICIENT PARSING
10 hrs.
Human preferences - Parsing semantic interpretation Semantics and logical form word senses and Ambiguity
The basic logical form language Encoding ambiguity Verbs and states in logical form Semantic interpretation
and compositionality A simple grammar and lexicon with semantic interpretation Prepositional phrases and noun
phrases.
REFERENCE BOOK:
1. James. Allan, Natural Language understanding, Benjamin/Gumming Publishing Company Inc, 2nd edition, 1995

Max. Marks : 80
16

30 marks
50 marks
REGULATIONS 2010
SCSX5014
NETWORK MANAGEMENT SYSTEM
Credits
Total Marks
100
UNIT I DATA COMMUNICATION AND NETWORKS MANAGEMENT OVERVIEW
10 hrs.
Analogy of Telephone Network Management Distributed Computing Environments Communications Protocols

& Standards Case histories of Networking and Management Challenges of Information Technology Managers
Network Management Goals , Organization, and Functions Network & System management Network Management
System Platform Current status and Future of Network management.
UNIT II SNMP, BROADBAND, AND TMN MANAGNEMENT
10 hrs.
Standard, Models and Language SNMPv1 Network Management: Organization, Information, Communication
and Functional model SNMPv2: System Architecture- Structure of Management Information SNMPv2 Protocol
SNMpv3: Documentation Architecture Applications.
UNIT III SNMP MANAGEMENT
10 hrs.
RMON Remote Monitoring RMON SMI & MIB RMON1 RMON2 ATM remote monitoring A Case
study of Internet Traffic Using RMON.
UNIT IV BROADBAND NETWORK MANAGEMENT
10 hrs.
Broadband Access Networks and Technologies HFC Technology HFC Management DSL Technology
Asymmetric Digital Subscriber Line Technology Telecommunication Management Network: Why TMN TMN
Conceptual Model TMN Standards TMN Architecture TMN Management Service Architecture Implementation
Issues.
UNIT V NETWORK MANAGEMENT TOOLS AND SYSTEMS
10 hrs.
Network Management Tools- Network Statistics Measurement Systems History of Enterprise Management
Network Management Systems Commercial Network Management Systems System Management Network
Management Applications: Fault management Performance Management security Management.
REFERENCE BOOK:
1. Mani Subramanian ,Network Management Principles and Practice, Pearson Education, Fourth Indian Reprint , 2003

Max. Marks : 80
17

30 marks
50 marks
REGULATIONS 2010
SCSX5015
AGENT BASED INTELLIGENT SYSTEMS
Credits
Total Marks
100
UNIT I INTRODUCTION
10 hrs.
Definitions - Foundations - History - Intelligent Agents-Problem Solving-Searching - Heuristics -Constraint

Satisfaction Problems - Game playing.
UNIT II KNOWLEDGE REPRESENTATION AND REASONING
10 hrs.
Logical Agents-First order logic-First Order Inference-Unification-Chaining- Resolution Strategies-Knowledge

Representation-Objects-Actions-Events
UNIT III PLANNING AGENTS
10 hrs.
Planning Problem-State Space Search-Partial Order Planning-Graphs-Nondeterministic Domains-Conditional

Planning-Continuous Planning-MultiAgent Planning.
UNIT IV AGENTS AND UNCERTAINITY
10 hrs.
Acting under uncertainty Probability Notation-Bayes Rule and use - Bayesian Networks-Other Approaches-Time
and Uncertainty-Temporal Models- Utility Theory - Decision Network Complex Decisions.
UNIT V HIGHER LEVEL AGENTS
10 hrs.
Knowledge in Learning-Relevance Information-Statistical Learning

Communication - Formal Grammar-Augmented Grammars- Future of AI.
Methods-Reinforcement
Learning
REFERENCE BOOKS:
1.
2.
3.
4.
Stuart Russell and Peter Norvig, Artificial Intelligence - A Modern Approach, 2nd Edition, Prentice Hall, 2002
Michael Wooldridge, An Introduction to Multi Agent System, John Wiley, 2002.
Patrick Henry Winston,Artificial Intelligence, III Edition, AW, 1999.
Nils.J.Nilsson, Principles of Artificial Intelligence, Narosa Publishing House, 1992.

Max. Marks : 80
30 marks
50 marks
18
REGULATIONS 2010
SCSX5016
MACHINE LEARNING
Credits
Total Marks
100
UNIT I INTRODUCTION
10 hrs.
Learning Problems Perspectives and Issues Concept Learning Version Spaces and Candidate Eliminations
Inductive bias Decision Tree learning Representation Algorithm Heuristic Space Search.
UNIT II NEURAL NETWORKS AND GENETIC ALGORITHMS
10 hrs.
Neural Network Representation Problems Perceptrons Multilayer Networks and Back Propagation Algorithms
Advanced Topics Genetic Algorithms Hypothesis Space Search Genetic Programming Models of Evalution
and Learning.
UNIT III BAYESIAN AND COMPUTATIONAL LEARNING
10 hrs.
Bayes Theorem Concept Learning Maximum Likelihood Minimum Description Length Principle Bayes
Optimal Classifier Gibbs Algorithm Nave Bayes Classifier Bayesian Belief Network EM Algorithm Probability
Learning Sample Complexity Finite and Infinite Hypothesis Spaces Mistake Bound Model.
UNIT IV INSTANT BASED LEARNING
10 hrs.
K- Nearest Neighbour Learning Locally weighted Regression Radial Bases Functions Case Based Learning.
UNIT V ADVANCED LEARNING
10 hrs.
Learning Sets of Rules Sequential Covering Algorithm Learning Rule Set First Order Rules Sets of
First Order Rules Induction on Inverted Deduction Inverting Resolution Analytical Learning Perfect Domain
Theories Explanation Base Learning FOCL Algorithm Reinforcement Learning Task Q-Learning Temporal
Difference Learning
REFERENCE BOOKS:
1. Tom M. Mitchell, Machine Learning, McGraw-Hill, 1st edition, 1997
2. Ethem Alpaydin, Introduction to Machine Learning (Adaptive Computation and Machine Learning), The MIT Press 2004
3. Hastie. T, Tibshirani. R, Friedman. J. H, The Elements of Statistical Learning, Springer,1st edition, 2001

Max. Marks : 80
PART A : 6 questions of 5 marks each without choice PART B : 2 questions from each unit of internal choice, each carrying 10 marks M.E(COMPUTER SCIENCE AND ENGINEERING)
19

30 marks
50 mark
REGULATIONS 2010
SCSX5017
ETHICAL HACKING AND DIGITAL FORENSICS
Credits
Total Marks
100
UNIT I HACKING WINDOWS
10 hrs.
Hacking windows Network hacking Web hacking Password hacking - A study on various attacks Input
validation attacks SQL injection attacks Buffer overflow attacks - Privacy attacks.
UNIT II TCP / IP AND FIREWALLS
10 hrs.
TCP / IP Checksums IP Spoofing port scanning, DNS Spoofing. Dos attacks SYN attacks, Smurf attacks,
UDP flooding, DDOS Models. Firewalls Packet filter firewalls - Packet Inspection firewalls Application Proxy
Firewalls - Batch File Programming.
UNIT III COMPUTER FRAUD
10 hrs.
Fundamentals of Computer Fraud Threat concepts Framework for predicting inside attacks Managing the
threat Strategic Planning Process.
UNIT IV ARCHITECTURE STRATEGIES
10 hrs.
Architecture strategies for computer fraud prevention Protection of Web sites Intrusion detection system
NIDS, HIDS Penetrating testing process Web Services Reducing transaction risks.
UNIT V FRAUD SELECTION & DETECTION
10 hrs.
Key Fraud Indicator selection process customized taxonomies Key fraud signature selection process
Accounting Forensics Computer Forensics Journaling and it requirements Standardized logging criteria Journal
risk and control matrix Neural networks Misuse detection and Novelty detection.
REFERENCE BOOKS:
1. Kenneth C.Brancik, Insider Computer Fraud, Auerbach Publications Taylor & Francis, Group 2008.
2. Ankit Fadia, Ethical Hacking, Second Edition Macmillan India Ltd, 2006

Max. Marks : 80
20

30 marks
50 marks
REGULATIONS 2010
SCSX5018
GRID COMPUTING
Credits
Total Marks
100
UNIT I INTRODUCTION
10 hrs.
High Performance Computing- Cluster Computing-Grid Computing- Grid Computing Models- Types of Grids
An overview of Grid Business Areas- Grid Applications Grid Protocols
UNIT II GRID COMPUTING SYSTEMS AND ARCHITECTURES
10 hrs.
Grid architecture Grid architecture and relationship to other Distributed Technologies Concept of virtual
organizations- Grid Computing road map
UNIT III THE NEW GENERATION OF GRID COMPUTING APPLICATIONS
10 hrs.
Merging the Grid services Architecture with the Web Services Architecture
UNIT IV OPEN GRID SERVICES
10 hrs.
ARCHITECTURE: OGSA Sample use cases OGSA platform components - OGSA Basic Services.
INFRASTRUCTURE: Technical details of OSGI- OGSI/OGSA service elements and layered model
UNIT V GRID COMPUTING TOOL KITS
10 hrs.
Globus Toolkit Architecture - Programming model - High level services OGSI - .Net middleware Solutions
REFERENCE BOOKS:
1. Joshy Joseph & Craig Fellenstein, Grid Computing, PHI, PTR-2003.
2. Ahmar Abbas, Grid Computing: A Practical Guide to technology and Applications, Charles River media 2003.
3. Ian Foster, Carl Kesselman, The Grid2: Blueprint for a New Computing Infrastructure. Morgan Kaufman, New Delhi, 2004
4. Fran Bermn, Geoffrey Fox, Anthony Hey J.G., Grid Computing: Making the Global Infrastructure a Reality, Wiley, USA, 2003
5. Maozhen Li, Mark Baker, The Grid: Core Technologies, John Wiley & Sons, 2005.
6. URLs: www.globus.org and glite.web.cern.ch (Unit 5)

Max. Marks : 80
PART A : 6 questions of 5 marks each without choice -
30 marks
PART B : 2 questions from each unit of internal choice, each carrying 10 marks -
50 marks
21
REGULATIONS 2010
SCSX5019
PERFORMANCE EVALUATION OF SYSTEMS AND

NETWORKS
Credits
Total Marks
100
UNIT I REQUIREMENT ANALYSIS
10 hrs.
Performance Characteristics Requirement Analysis: Concepts User, Device, Network Requirements Process
Developing RMA, Delay, Capacity Requirements Flow Analysis Identifying and Developing Flows Flow Models
Flow Prioritization Specification.
UNIT II QUEUING MODELS AND DISCIPLINE
10 hrs.
Random variables - Stochastic process Link Delay components Queuing Models Littles Theorem Birth
& Death process Queuing Disciplines.
UNIT III QUEUING SYSTEMS
10 hrs.
Markovian FIFO Queuing Systems M/M/1 M/M/a M/M/8 - M/G/1 M/M/m/m and other
Markov-Non-Markovian and self-similar models Network of Queues Burkes Theorem Jacksons Theorem.
UNIT IV THROUGHPUT ANALYSIS
10 hrs.
Multi-User Uplinks/Downlinks - Capacity Regions - Opportunistic Scheduling for Stability and Max Throughput Multi-Hop Routing - Mobile Networks - Throughput Optimality and Backpressure
UNIT V PERFORMANCE MEASURES
10 hrs.
Performance of Optimal Lyapunov Networking - Energy Optimality- Energy-Delay Tradeoffs - Virtual Cost Queues
- Average Power Constraints - Flow Control with Infinite Demand - Auxiliary Variables - Flow Control with Finite
Demand - General Utility Optimization.
REFERENCE BOOKS:
1.
2.
3.
4.
5.
6.
James D.McCabe , Network Analysis , Architecture and Design , 2nd Edition,Elsevier,2003

Bertsekas & Gallager , Data Networks , Second Edition ,Pearson Education,2003
Sheldon Ross ,Introduction to Probability Models , Academic Press, New York , 8th edition,2003
Bertsekas.D, Nedic A. and Ozdaglar. A., Convex Analysis and Optimization, Athena Scientific, Cambridge , Massachusetts , 2003
Nader F.Mir, Computer and Communication Networks,Pearson Education.2007
Paul J.Fortier, Howard E.Michel, Computer Systems Performance Evaluation and Prediction, Elsevier,2003

Max. Marks : 80
22

30 marks
50 marks
REGULATIONS 2010
SCSX5020
KNOWLEDGE ENGINEERING
Credits
Total Marks
100
UNIT I INTRODUCTION
10 hrs.
Key concepts Why knowledge Representation and Reasoning Language of first order Logic Syntax,
Semantics Pragmatics Expressing Knowledge Levels of Representation Knowledge Acquisition and Sharing
Sharing Ontologies Language Ontologies Language Patterns Tools for Knowledge Acquisition
UNIT II RESOLUTION AND REASONING
10 hrs.
Proportional Case Handling Variables and Qualifies Dealing with Intractability Reasoning with Horn Clauses
- Procedural Control of Reasoning Rules in Production Description Logic - Vivid Knowledge Beyond Vivid.
UNIT III REPRESENTATION
10 hrs.
Object Oriented Representations Frame Formalism Structured Descriptions Meaning and Entailment Taxonomies and Classification Inheritance Networks Strategies for Defeasible Inheritance Formal Account of
Inheritance Networks.
UNIT IV DEFAULTS, UNCERTAINTY AND EXPRESSIVENESS
10 hrs.
Defaults Introduction Closed World Reasoning Circumscription Default Logic Limitations of Logic Fuzzy
Logic Nonmontonic Logic Theories and World Semiotics Auto epistemic Logic - Vagueness Uncertainty
and Degrees of Belief Noncategorical Reasoning Objective and Subjective Probability.
UNIT V ACTIONS AND PLANNING
10 hrs.
Explanation and Diagnosis Purpose Syntax, Semantics of Context First Order Reasoning Modal Reasoning
in Context Encapsulating Objects in Context Agents Actions Situational Calculus Frame Problem Complex
Actions Planning Strips Planning as Reasoning Hierarchical and Conditional Planning.
REFERENCE BOOKS:
1. Ronald Brachman, Hector Levesque Knowledge Representation and Reasoning , The Morgan Kaufmann Series in Artificial Intelligence 2004
2. John F. Sowa, Knowledge Representation: Logical, Philosophical, and Computational Foundations, 2000
3. Arthur B. Markman, Knowledge Representation, Lawrence Erlbaum Associates,1998

Max. Marks : 80
PART A : 6 questions of 5 marks each without choice -
30 marks
PART B : 2 questions from each unit of internal choice, each carrying 10 marks -
50 marks
23
REGULATIONS 2010
SCSX5021
DIGITAL IMAGE PROCESSING
Credits
Total Marks
100
UNIT I FUNDAMENTALS
10 hrs.
Digital Image Representation- Fundamental steps in Image Processing- Elements of Digital Image Processing
System.
Digital Image Fundamentals Elements of Visual perception- A simple Image Model- Sampling & QuantizationNeighbours of a Pixel Connectivity Relations - Equivalence & Transitive Closure.
UNIT II BASIC TRANSFORMATION
10 hrs.
Basic Transformation Perspective Transformation Photographic film structure, Exposure & Film Characteristics.
Image Transforms-Introduction to Fourier Transform-Discrete Fourier Transform-Fast Fourier Transform-Discrete
Cosine Transform.
UNIT III IMAGE ENHANCEMENT AND RESTORATION
10 hrs.
Image Enhancement: Background Enhancement by Point Processing Spactial filtering Enhancement in

Frequency Domain Colour Image Processing : Color Models RGB color model CMY color model YIQ color
model- HIS color model PseudoColor Image Processing Fundamentals- Filtering model of pseudo-color image
processing.
Image Restoration:Algebraic approach to restoration Inverse filtering, LMS filter Geometric transformation
Spatial & Gray-level Interpolation
UNIT IV IMAGE COMPRESSION
10 hrs.
Image Compression : Fundamentals Image Compression Models Elements of Information Theory Error
Free Compression Variable Length Coding Constant area Coding Lossless Predictive Coding Transform Coding
Image Compression Standards.
UNIT V IMAGE SEGMENTATION AND APPLICATIONS
10 hrs.
Image Segmentation, Representation & Description Edge linking & Boundary Detection Thresholding Region
Segmentation Representation Oriented & description schemes of Images Boundary Extraction Morphology
Applications Elements of Image Analysis.
REFERENCE BOOKS:
1. Rafel C. Gonzalez & Richard E. Woods, Digital Image Processing , Addison Wesley
2. SID Ahamed M.A, Image Processing Theory, Algorithm & Architecture , McGraw Hill 1991.

Max. Marks : 80
24

30 marks
50 marks
REGULATIONS 2010
SCSX5022
VIRTUALIZATION TECHNIQUES
Credits
Total Marks
100
UNIT I OVERVIEW OF VIRTUALIZATION
10 hrs.
Basics of Virtualization - Virtualization Types Desktop Virtualization Network Virtualization Server and
Machine Virtualization Storage Virtualization System-level or Operating Virtualization Application
Virtualization-Virtualization Advantages - Virtual Machine Basics Taxonomy of Virtual machines - Process Virtual
Machines - System Virtual Machines Hypervisor - Key Concepts
UNIT II SERVER CONSOLIDATION
10 hrs.
Hardware Virtualization Virtual Hardware Overview - Sever Virtualization Physical and Logical Partitioning Types of Server Virtualization Business cases for Server Virtualization Uses of Virtual server Consolidation
Planning for Development Selecting server Virtualization Platform
UNIT III NETWORK VIRTUALIZATION
10 hrs.
Design of Scalable Enterprise Networks - Virtualizing the Campus WAN Design - WAN Architecture - WAN
Virtualization - Virtual Enterprise Transport VirtualizationVLANs and Scalability - Theory Network Device Virtualization
Layer 2 - VLANs Layer 3 VRF Instances Layer 2 - VFIs Virtual Firewall Contexts Network Device Virtualization Data-Path Virtualization Layer 2: 802.1q - Trunking Generic Routing Encapsulation - IPsec L2TPv3 Label Switched
Paths - Control-Plane VirtualizationRouting Protocols- VRF - Aware Routing Multi-Topology Routing.
UNIT IV VIRTUALIZING STORAGE
10 hrs.
SCSI- Speaking SCSI- Using SCSI buses Fiber Channel Fiber Channel Cables Fiber Channel Hardware
Devices iSCSI Architecture Securing iSCSI SAN backup and recovery techniques RAID SNIA Shared
Storage Model Classical Storage Model SNIA Shared Storage Model Host based Architecture Storage based
architecture Network based Architecture Fault tolerance to SAN Performing Backups Virtual tape libraries.
UNIT V VIRTUAL MACHINES PRODUCTS
10 hrs.
Xen Virtual machine monitors- Xen API VMware VMware products - Vmware Features Microsoft Virtual
Server Features of Microsoft Virtual Server.
REFERENCES BOOKS :
1.
2.
3.
4.
5.
William von Hagen, ,,Professional Xen Virtualization, Wrox Publications, January, 2008.
Chris Wolf , Erick M. Halter, Virtualization: From the Desktop to the Enterprise, APress 2005.
Kumar Reddy, Victor Moreno, Network virtualization, Cisco Press, July, 2006.
James E. Smith, Ravi Nair, Virtual Machines: Versatile Platforms for Systems and Processes, Elsevier/Morgan Kaufmann, 2005.
David Marshall, Wade A. Reynolds, Advanced Server Virtualization: VMware and Microsoft Platform in the Virtual Data Center,
Auerbach Publications, 2006.

Max. Marks : 80
25

30 marks
50 marks
REGULATIONS 2010
SCSX5023
SERVICE ORIENTED ARCHITECTURE
Credits
Total Marks
100
UNIT I SOA - INTRODUCTION
10 hrs.
Software Architecture Types of IT Architecture SOA Evolution Key components perspective of SOA
Enterprise-wide SOA Architecture Enterprise Applications Solution Architecture for enterprise application
Software platforms for enterprise Applications Patterns for SOA SOA programming models
UNIT II ANALYSIS AND DESIGN
10 hrs.
Service-oriented Analysis and Design Design of Activity, Data, Client and business process services
Technologies of SOA SOAP WSDL JAX WS XML WS for .NET Service integration with ESB Scenario
Business case for SOA stakeholder objectives benefits of SPA Cost Savings
UNIT III SOA TECHNOLOGIES
10 hrs.
SOA implementation and Governance Strategy SOA development SOA governance Trends in SOA
Event-driven architecture Software as a service SOA technologies Proof-of-concept Process orchestration
SOA best practices
UNIT IV WEB SERVICE FRAMEWORK
10 hrs.
Meta data management XML security XML signature XML Encryption SAML XACML XKMS
WS-Security Security in web service framework - Advanced messaging
UNIT V TRANSACTION PROCESSING
10 hrs.
Transaction processing Paradigm Protocols and co-ordination Transaction specifications SOA in mobile
Research issues.
REFERENCE BOOKS:
1. Shankar Kambhampaly, Service Oriented Architecture for Enterprise Applications, Wiley India Pvt Ltd, 2008
2. Eric Newcomer, Greg Lomow, Understanding SOA with Web Services, Pearson Education.
3. Mark O Neill, et al. , Web Services Security, Tata McGraw Hill

Max. Marks : 80
26

30 marks
50 marks
REGULATIONS 2010
SCSX5024
CLOUD COMPUTING
Credits
Total Marks
100
UNIT I UNDERSTANDING CLOUD COMPUTING
10 hrs.
Cloud Computing History of Cloud Computing Cloud Architecture Cloud Storage Why Cloud Computing
Matters Advantages of Cloud Computing Disadvantages of Cloud Computing Companies in the Cloud Today
Cloud Services
UNIT II DEVELOPING CLOUD SERVICES
10 hrs.
Web-Based Application Pros and Cons of Cloud Service Development Types of Cloud Service Development
Software as a Service Platform as a Service Web Services On-Demand Computing Discovering Cloud
Services Development Services and Tools Amazon Ec2 Google App Engine IBM Clouds
UNIT III CLOUD COMPUTING FOR EVERYONE
10 hrs.
Centralizing Email Communications Collaborating on Schedules Collaborating on To-Do Lists Collaborating

Contact Lists Cloud Computing for the Community Collaborating on Group Projects and Events Cloud Computing
for the Corporation
UNIT IV USING CLOUD SERVICES
10 hrs.
Collaborating on Calendars, Schedules and Task Management Exploring Online Scheduling Applications
Exploring Online Planning and Task Management Collaborating on Event Management Collaborating on Contact
Management Collaborating on Project Management Collaborating on Word Processing - Collaborating on Databases
Storing and Sharing Files
UNIT V OTHER WAYS TO COLLABORATE ONLINE
10 hrs.
Collaborating via Web-Based Communication Tools Evaluating Web Mail Services Evaluating Web Conference
Tools Collaborating via Social Networks and Groupware Collaborating via Blogs and Wikis
REFERENCE BOOKS :
1. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate Online, Que publishing,
August 2008.
2. Haley Beard, Cloud Computing Best Practices for Managing and Measuring Processes for On-demand Computing, applications and
Data Centers in the Cloud with SLAs, Emereo Pty Limited, July 2008

Max. Marks : 80
27

30 marks
50 marks
REGULATIONS 2010
SCSX5025
MULTICORE ARCHITECTURE
Credits
Total Marks
100
UNIT I INTRODUCTION
10 hrs.
Fundamentals of SuperScalar Processor Design - Introduction to Multicore Architecture Chip Multiprocessing

- Homogeneous Vs Heterogeneous design - SMP Multicore Vs Multithreading.
UNIT II MEMORY ORGANIZATION
10 hrs.
Shared memory architectures Synchronization Memory organization Cache Memory Cache Coherency
Protocols - Design of Levels of Caches.
UNIT III PROGRAMMING MODEL
10 hrs.
Multicore programming Model Shared memory model - Message passing model -Transaction model OpenMP
and MPI Programming.
UNIT IV POWER PC DESIGN
10 hrs.
PowerPC architecture RISC design - Power PC ISA - Power PC Memory Management - Power 5 Multicore
architecture design - Power 6 Architecture.
UNIT V PROCESSING ELEMENT AND DEVELOPMENT
10 hrs.
Cell Broad band engine architecture, PPE (Power Processor Element), SPE (Synergistic processing element),
Cell Software Development Kit, Programming for Multicore architecture.
REFERENCE BOOKS:
1.
2.
3.
4.
5.
6.
Hennessey & Pateterson, Computer Architecture A Quantitative Approach, Harcourt Asia, Morgan Kaufmann, 1999
Joseph JaJa, Introduction to Parallel Algorithms, Addison-Wesley, 1992.
IBM Journals for Power 5, Power 6 and Cell Broadband Engine Architecture.
Kai Hwang, Advanced Computer Architecture: Parallelism, Scalability and Programmability McGraw-Hill, 1993
Richard Y. Kain, Advanced Computer Architecture: A System Design Approach, PHI, 1999
Rohit Chandra, Ramesh Menon, Leo Dagum, and David Kohr, Parallel Programming in OpenMP, Morgan Kaufmann, 2000.

Max. Marks : 80
28

30 marks
50 marks
REGULATIONS 2010
SCSX5026
MOBILE AND PERVASIVE COMPUTING
Credits
Total Marks
100
UNIT I EMERGING TECHNOLOGIES
10 hrs.
Wireless networks- Emerging technologies - Blue tooth, WiFi, WiMAX, 3G ,WATM.-Mobile IP protocols -WAP
push architecture-Wml scripts and applications.
UNIT II MOBILE COMPUTING ENVIRONMENT AND SECURITY
10 hrs.
Mobile computing environment Functions -Architecture-Design considerations - content architecture -CC/PP

exchange protocol -context manager - Data management in WAE-Coda file system- Caching schemes- Mobility QOS
- Security in mobile computing.
UNIT III HANDOFF AND TRACKING MANAGEMENT SCHEMES
10 hrs.
Handoff in wireless mobile networks-Reference model-Handoff schemes- Location management in cellular

networks - Mobility models- Location and tracking management schemes- Time, movement, profile and distance based
update strategies - ALI technologies
UNIT IV PERVASIVE COMPUTING
10 hrs.
Pervasive Computing- Principles, Characteristics- Interaction transparency - Context aware - Automated experience
capture. Architecture for pervasive computing- Pervasive devices - Embedded controls.- Smart sensors and actuators
-Context communication and access services
UNIT V OPEN PROTOCOLS AND CONTEXT AWARE SENSOR NETWORKS
10 hrs.
Open protocols- Service discovery technologies- SDP, Jini, SLP, UpnP protocolsdata synchronization- SyncML
framework - Context aware mobile services -Context aware sensor networks - Addressing and communications - Context
aware security.
REFERENCE BOOKS :
1.
2.
3.
4.
Ivan Stojmenovic , Handbook of Wireless Networks and Mobile Computing, John Wiley & sons Inc, Canada, 2002.
Asoke K Taukder,Roopa R Yavagal,Mobile Computing, Tata McGraw Hill Pub Co. , New Delhi, 2005.
Seng Loke, Context-Aware Computing Pervasive Systems Auerbach Pub., New York, 2007.
Uwe Hansmann etl , Pervasive Computing, Springer, New York.

Max. Marks : 80
29

30 marks
50 marks
REGULATIONS 2010
SCSX5027
SOFTWARE QUALITY ASSURANCE AND TESTING
Credits
Total Marks
100
UNIT I INTRODUCTION
10 hrs.
Software testing fundamentals Objectives-principles Testability- Levels of testing-TMM- Characteristics of a

tester-A testing group-Comparison of KPA in ISO, CMM and TMM- Software quality attributes.
UNIT II SOFTWARE TESTING METHODS & STRATEGIES
10 hrs.
Test case design-White box testing-Basic path testing Flow Graph Notation-Cyclomatic Complexity-Deriving
Test Cases- Graphic matrices-Control Structure Testing Deriving Test cases-Data flow Testing-Loop Testing-Black
box Testing Graph Based Testing Methods- Equivalence partitioning-Boundary value analysis-Comparison testing.
Strategic Approach to Software Testing Verification and Validation-Strategic issues-Unit testing Consideration
Procedures. Integration Testing-Regression Testing-Integration Test Documentation-Validation testing-Configuration
Review-Alpha and Beta Testing System Testing Art of Debugging
Case studies : Writing test cases for white box and black box testing.
UNIT III OBJECT ORIENTED TESTING, METRICS & MEASUREMENTS
10 hrs.
Testing OOD Models OO Testing Strategies Test Case Design for OO Software Testing Methods applicable
at the class level Interclass test design The intent of OO metrics Distinguishing characteristics of OO metrics
Common software measurements: Code coverage-Cohesion-Comment density,Coupling-Function point
analysis-Number of classes and interfaces-Number of lines of customer requirements-Robert Cecil Martins software
package metrics-Bugs per line of code -Source lines of code
UNIT IV QUALITY CONSIDERATIONS
10 hrs.
Planning for quality Quality plan Cost/benefit tradeoff Feature/bug tradeoff Modeling quality improvement
- Notation of defects Defects Defect removal activities Conditions for each activity Defect removal goals
Quality improvement teams quality recognition Manage Priorities Effectively Statistical Quality Assurance-Software
Reliability
UNIT V OVERVIEW OF STANDARDS
10 hrs.
Levels of standards Quality assurance standards Project management standards Dependability standards
Product standards Process standards - ISO 9000 Reviews, Audits and Certification.
REFERENCE BOOKS:
1.
2.
3.
4.
5.
Ilene Barnstein,Practical Software Testing A Process Oriented Approach, Springer International Edition.
Humphrey, W. S. (2002),A Discipline for Software Engineering. Reading,MA, Addison-Wesley
Roger S.Pressman, Software Engineering, A Practitioners Approach,Tata McGraw Hill,Fifth Edition.
Marc Roper, Software Testing, McGraw Hill Professional -1994
Ian Sommerville, Software Engineering, Addison-Wesley, V Edition, 1996.

Max. Marks : 80
30

30 marks
50 marks
REGULATIONS 2010
SCSX5028
SOFTWARE PROJECT MANAGEMENT
Credits
Total Marks
100
UNIT I BASIC CONCEPTS
10 hrs.
Product, Process and Project - Definition: Product Life Cycle -Project Life Cycle Models.
UNIT II FORMAT PROCESS MODELS AND THEIR USE
10 hrs.
Definition and format model for a process- The ISO 9001 and CMM models and their relevance to project
management- Other emerging models like People CMM.
UNIT III UMBRELLA ACTIVITIES IN PROJECTS
10 hrs.
Metrics- Configuration management-Software Quality Assurance- Risk Analysis
UNIT IV IN STREAM ACTIVITIES IN PROJECTS
10 hrs.
Project Initiation - Project Planning, execution and tracking- Project Wind-up- Concept of process/project database.
UNIT V ENGINEERING AND PEOPLE ISSUES IN PROJECT MANAGEMENT
10 hrs.
Phases (Requirements, Design, Development, Testing, maintenance, deployment) - Engineering activities and
management issues in each phase- Special considerations in project management for India and geographic distribution
issues.
REFERENCE BOOKS:
1.
2.
3.
4.
5.
Ramesh, "Gopalaswamy: Managing Global Projects", Tata McGraw Hill, 2001.

Humphrey, Watts, "Managing the Software Process", Addison Wesley, 1986.
Pressman, Roger, "Software Engineering, A Practitioners approach, McGraw Hill, 1997.
DeMarco and Lister, "Peopleware: Productive Projects and Teams ,Second Edition, 1987
Wheelwright and Clark: "Revolutionising Product Development", The Free Press, 1993.

Max. Marks : 80
31

30 marks
50 marks
REGULATIONS 2010
SMTX5008
MATHEMATICAL FOUNDATIONS FOR COMPUTER

SCIENCE
Credits
Total Marks
100
UNIT I PRELIMINARIES AND INDUCTION
10 hrs.
Set Theory basic concepts-Relations and ordering- Functions, Recursion and its use in theorem provingAlphabets, strings and Languages and Grammars- Functions and Infinite sets Paring Functions Contors proofMathematical Induction proofs- the principle of mathematical induction Recursive definitions Structural Induction.
UNIT II FINITE AUTOMATA
10 hrs.
Finite Automata and Regular Languages - Regular Languages and regular expressions, Finite AutomataDistinguishing one string from another, union, intersections, and complements-Non-determinism and kleenes theoremNon-deterministic finite automata and NFA with transition-Kleenes theorem.
UNIT III REGULAR LANGUAGES AND CONTEXT-FREE LANGUAGES
10 hrs.
Regular and Non-regular Languages- A criterion for regularity-Minimal finite automata-The pumping
lemma-Decision problems, Regular languages and computers.
Context-free Grammars- Definition-More examples-Including some familiar languages- Union-Concatenations, and
*s of CFLs.
UNIT IV DERIVATION TREES AND PUSHDOWN AUTOMATA
10 hrs.
Derivation Trees and Ambiguity- Unambiguous CFG for Algebraic Expressions-Simplified forms and Normal forms.
Pushdown Automata- Introduction-Definition-Deterministic Pushdown automaton-PDA corresponding to a given
Context-free Grammar- Context-free Grammar corresponding to PDA.
UNIT V TURING MACHINES AND THEIR LANGUAGES
10 hrs.
Turing Machines Models of computation and the Turing thesis-Definition of TM and TMs as Language
Acceptor-Computing a partial Function with a TM, variations of TM-Non-deterministic TM-Universal Turing Machine.
Recursively Enumerable and Recursive languages Recursively Enumerable and recursive sets- Enumerating
a Language-Not all Languages are recursively enumerable-Language not Recursively enumerable
REFERENCE BOOKS:
1.John C. Martin, Theory of Computation ,Tata McGraw Hill, Third Edition.
2.Bernard M.Moret, The Theory of Computation , Addison Wesley,2002 Reprint.
3.Tremblay.P. and.Manohar. R, Discrete Mathematical Structures with applications to computer science Tata McGraw Hill

Max. Marks : 80
32

30 marks
50 marks
REGULATIONS 2010
SECX5079
WIRELESS SENSOR NETWORKS
Credits
Total Marks
100
UNIT I NETWORK ARCHITECTURE
10 hrs.
Concept of sensor network Introduction, Applications, sensors.

Single node architecture: Hardware and software components of a sensor node-Tiny OS operating system-nesC
language.
Wireless Sensor Network architecture: Typical network architectures- Data relaying strategies-Aggregation-Role
of energy in routing decisions.
UNIT II MAC LAYER
10 hrs.
MAC layer strategies: MAC layer protocols-Scheduling sleep cycles-Energy management-contention based
protocols-schedule based protocols, 802.15.4 standard. Naming and addressing: Addressing services, Publish-subscribe
topologies.
Clock Synchronization: Clustering for synchronization-Sender-receiver and Receiver-receiver synchronization-Error
analysis.
Power Management Per node-System-wide-Sentry services-Sensing coverage
UNIT III NODE LOCALIZATION AND DATA GATHERING
10 hrs.
Node Localization: Absolute and relative localization-Triangulation-Multi-hop localization and error

analysis-Anchoring, geographic localization-Target tracking, localization and identity management-Walking GPS-Range
free solutions.
Data Gathering - Tree construction algorithms and analysis - Asymptotic capacity- Lifetime optimization
formulations- Storage and retrieval.
Deployment & Configuration - Sensor deployment, scheduling and coverage issues-Self configuration and topology
control.
UNIT IV ROUTING AND DISTRIBUTED COMPUTATION
10 hrs.
Routing: Agent-based routingRrandom walk-Trace routing data centric-Hierarchical, location-based, energy efficient
routing Querying - Data collection and processing-Collaborative information processing and group connectivity.
Distributed Computation - Detection, estimation, and classification problems - Energy-efficient distributed
algorithms.
UNIT V SENSOR NETWORK TOOLS
10 hrs.
Sensor Network Platforms and Tools: Sensor node hardware-Programming challenges-Node level software
platform-Node level simulators-Programming beyond individual nodes.- Security - Privacy issues - Attacks and
countermeasures.
REFERENCE BOOKS:
1. Feng Zhaoand Leonidas J Guibas, Wireless Sensor Networks Morgan Kaufmann Publishers and imprint of Elsevier, 2004.
2. Raghavendra. C. S., Krishna M. Sivalingam, Taieb F. Znati, Wireless Sensor Networks, 2nd edition, Springer, 2004.
3. Holger Karl, Andreas Willig, Protocols and Architectures for Wireless Sensor Networks, John Wiley and Sons, 2005.

Max. Marks : 80
33

30 marks
50 marks
REGULATIONS 2010
SECX5080
HIGH PERFORMANCE NETWORKS
Credits
Total Marks
100
UNIT I HIGH SPEED LAN
10 hrs.
Fast Ethernet technology-FDDI, SONET and SDH standards-Performance of high speed LAN Throughput,
delay and reliability-Wavelength division multiplexed LAN Routing and switching in WDM networks-Gigabit LAN
UNIT II ISDN
10 hrs.
Overview of ISDN User interface - Architecture and standards-Packet switched call over ISDN,B and D
channels-Link access procedure (LAPD)-ISDN layered architecture-Signaling-Limitations of Narrow band ISDN(N-ISDN)
and evolution of Broadband ISDN(B- ISDN)
UNIT III ASYNCHRONOUS TRANSFER MODE NETWORKS
10 hrs.
TM protocol architecture-ATM adaption layer-Fast packet switching techniques and VP/VC encapsulation-Source
characteristics.
UNIT IV ATM TRAFFIC MANAGEMENT
10 hrs.
Traffic management issues in ATM- Resource management-Connection management-Policing and reactive control
principles-Discrete time queue analysis and application to CAC-Leaky bucket and ECN/ICN.
UNIT V ATM SIGNALING AND DATA COMMUNICATION OVER ATM
10 hrs.
ATM signaling fundamentals and Meta signaling-TCP/IP over ATM-Challenges and proposals-LAN emulation over
ATM- Performance of data communication over ATM.
REFERENCE BOOKS:
1.
2.
3.
4.
Onvural R.O, Asyncronous Transfer mode Networks Performance Issues, Artech House, 1995.
Stallings. W, High Speed Networks, TCP/IP and ATM Design Principle, PHI,1998.
Craig Partridge, Gigabit Networking, Addison Wesley, 1997.
William Stallings, ISDN B ISDN with Frame relay and ATM, PHI, 1995.

Max. Marks : 80
34

30 marks
50 marks
REGULATIONS 2010

Sathyabama University: Jeppiaar Nagar, Rajiv Gandhi Salai, Chennai - 119

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

Sathyabama University: Jeppiaar Nagar, Rajiv Gandhi Salai, Chennai - 119

Uploaded by

Copyright:

Available Formats

SATHYABAMA UNIVERSITY

(Established under section 3 of UGC Act, 1956)

Jeppiaar Nagar, Rajiv Gandhi Salai, Chennai - 119.

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

General core courses like Mathematics

Core course of Engineering / Technology/Architecture / Science

Elective course for specialization in related fields

Workshop practice, Computer Practice, laboratory Work, Industrial Training, Seminar

Requirements for Completion of a Semester

M.E(COMPUTER SCIENCE AND ENGINEERING)

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

Eligibility for the Award of Degree

Award of Credits and Grades

RANGE OF MARKS FOR GRADES

Grade Points (GP)

CUMULATIVE GRADE POINT AVERAGE CALCULATION

where Ci - Credits for the subject

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

Classification of the Degree Awarded

Final Degree is awarded based on the following :

First Class - Exemplary

CGPA 7.50 < 9.0

First Class with Distinction

CGPA 6.00 < 7.50

CGPA 5.00 < 6.00

Minimum CGPA requirements for award of Degree is 5.0 CGPA.

Revision of Regulations and Curriculum

M.E(COMPUTER SCIENCE AND ENGINEERING)

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

M.E - COMPUTER SCIENCE AND ENGINEERING

Advanced Optimization Techniques

Advanced Data Structures & Algorithms

Computer Networks & Protocols

Advanced Computer Architecture

Advanced Data Structures Laboratory

Advanced Operating System

Object Oriented Software Engineering

Operating System Laboratory

Data Mining & Warehousing

Computational Intelligence Tools

Web Technology Laboratory

M.E(COMPUTER SCIENCE AND ENGINEERING)

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

Natural Language Processing

Network Management System

Agent Based Intelligent Systems

Ethical Hacking & Digital Forensics

Performance Evaluation of Systems and Networks

Digital Image Processing

Service Oriented Architecture

Mobile & Pervasive Computing

Software Quality Assurance & Testing

Software Project Management

Mathematical Foundations For Computer Science

Wireless Sensor Networks

High Performance Networks

L Lecture hours; T Tutorial hours; P Practical hours; C Credits

M.E(COMPUTER SCIENCE AND ENGINEERING)

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

ADVANCED OPTIMIZATION TECHNIQUES

UNIT I INTRODUCTION TO OPTIMIZATION

Formulation of optimization problem- Classification - Bounded Variable problems- Bounded

UNIT II NON LINEAR PROGRAMMING