k.s.rangasamy college of technology - r 2007...

BoS Chairman 36 : M.E. COMPUTER SCIENCE AND ENGINEERING - REGULATION 2007 - CURRICULUM

K.S.Rangasamy College of Technology - Autonomous Regulation

R 2007

Department Computer Science and Engineering

Programme Code & Name 36 : M.E. Computer Science and

Engineering


K.S.Rangasamy College of Technology, Tiruchengode – 637 215

Curriculum for the programmes under Autonomous Scheme

Regulation R 2007

Department Department of Computer Science and Engineering

Program Code & Name 36 : M.E. Computer Science and Engineering

Semester I

Course Code

Course Name Hours / Week Credit Maximum Marks

L T P C CA ES Total

THEORY

07360101C Theoretical Foundations of Computer Science

3 1 0 4 50 50 100

07360102C Advanced Computer Architecture

3 1 0 4 50 50 100

07360103C Data Structures and Algorithms 3 0 0 3 50 50 100

07360104C Operating Systems 3 0 0 3 50 50 100

07360105C Software Engineering Methodologies

3 0 0 3 50 50 100

07360106C Computer Networks 3 0 0 3 50 50 100

PRACTICAL

07360107P Data Structures Laboratory 0 0 3 2 50 50 100

Total 18 2 3 22 700

Semester II

Course Code


L T P C CA ES Total

THEORY

07360201C Database Technology 3 0 0 3 50 50 100

07360202C Compiler Design 3 1 0 4 50 50 100

07360203C Object Oriented System Design 3 1 0 4 50 50 100

07360204C Web Technology 3 0 0 3 50 50 100

07360205C Information Security 3 0 0 3 50 50 100

073602**E Elective I 3 0 0 3 50 50 100

PRACTICAL

07360207P Web Technology Laboratory 0 0 3 2 50 50 100

07360208P Database Technology Laboratory

0 0 3 2 50 50 100

07360209P Technical Seminar I 0 0 3 2 100 00 100

07360210P Technical Report preparation & Presentation I

0 0 3 2 100 00 100

Total 18 2 12 28 1000




Regulation R 2007



Semester III

Course Code


L T P C CA ES Total

THEORY

073603**E Elective II 3 0 0 3 50 50 100

073603**E Elective III 3 0 0 3 50 50 100

073603**E Elective IV 3 0 0 3 50 50 100

PRACTICAL

07360304P Project Work - Phase I 0 0 3 6 100 00 100

07360305P Technical Report preparation & Presentation II

0 0 3 2 100 00 100

Total 9 0 6 17 500

Semester IV

Course Code Course Name Hours / Week Credit Maximum Marks

L T P C CA ES Total

PRACTICAL

07360401P Project Work - Phase II 0 0 30 20 50 50 100

Total 0 0 30 20 100




Regulation R 2007




L T P C CA ES Total

List of II Semester Electives

07360241E High Speed networks 3 0 0 3 50 50 100

07360242E XML and Web Services 3 0 0 3 50 50 100

07360243E Theory of Computation 3 0 0 3 50 50 100

07360244E Soft Computing 3 0 0 3 50 50 100

07360245E Software Communication and Documentation

3 0 0 3 50 50 100

07360246E Bio Informatics 3 0 0 3 50 50 100

List of III Semester Electives

07360351E Distributed Computing 3 0 0 3 50 50 100

07360352E Software Architecture 3 0 0 3 50 50 100

07360353E Grid Computing 3 0 0 3 50 50 100

07360354E Network Security 3 0 0 3 50 50 100

07360355E Embedded Systems 3 0 0 3 50 50 100

07360356E Data Warehousing And Data Mining

3 0 0 3 50 50 100

07360361E Adhoc Networks 3 0 0 3 50 50 100

07360362E Performance Evaluation of Computer Systems and Networks

3 0 0 3 50 50 100

07360363E Advanced Databases 3 0 0 3 50 50 100

07360364E Software Quality Assurance 3 0 0 3 50 50 100

07360365E Neural Networks and Its Applications

3 0 0 3 50 50 100

07360366E Mobile Computing 3 0 0 3 50 50 100

07360371E Software Project Management 3 0 0 3 50 50 100

07360372E Software Testing 3 0 0 3 50 50 100

07360373E Digital Imaging 3 0 0 3 50 50 100

07360374E Multimedia Systems 3 0 0 3 50 50 100

07360375E Advanced Networks 3 0 0 3 50 50 100

07360376E Component Based Technology 3 0 0 3 50 50 100

BoS Chairman 36 : M.E. COMPUTER SCIENCE AND ENGINEERING - REGULATION 2007 - SYLLABUS

K.S.Rangasamy College of Technology - Autonomous Regulation R 2007

Department Computer Science and

Engineering Programme Code & Name

36: M.E. Computer Science and Engineering

Semester I

Course Code Course Name Hours/Week Credit Maximum Marks

L T P C CA ES Total

07360101C THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE

3 1 0 4 50 50 100

Objective(s) To gain knowledge which has application in expert system in data base and a basic for the prolog language. an understanding of regular languages and context free languages. study the Turing Machine and classes of problem.

1 FUNDAMENTAL STRUCTURES Total Hrs 12

Set theory:- Relationships between sets – Operations on sets – Set identities – Principle of inclusion and exclusion – Minsets. Relations: – Binary relations – Partial orderings – Equivalence relations. Functions:– Properties of functions – Composition of functions – Inverse functions – Permutation functions.

2 LOGIC Total Hrs 12

Propositional logic – Logical connectives – Truth tables – Normal forms (conjunctive and disjunctive) – Predicate logic – Universal and existential quantifiers – Proof techniques – direct and indirect – Proof by contradiction – Mathematical Induction.

3 COMBINATORICS Total Hrs 12

Basics of counting – Counting arguments – Pigeonhole principle – Permutations and Combinations – Recursion and Recurrence relations – Generating functions.

4 MODELING COMPUTATION AND LANGUAGES Total Hrs 12

Finite state machines – Deterministic and Non- deterministic finite state machines – Turing Machines – Formal Languages – Classes of Grammars – Type 0 – Context Sensitive – Context Free – Regular Grammars – Ambiguity.

5 DISCRETE PROBABILITY Total Hrs 12

Finite probability – Conditional Probability – Independence – Bayes‟ theorem – Mathematical expectation – Probability Distribution (Binomial, Poisson, Geometric and their Properties).

Total hours to be taught 60

Text book (s) :

1 Kenneth H. Rosen, “Discrete Mathematics and its Applications”, Fifth Edition, TMH, 2003.

Reference(s):

1 Judith L.Gersting, “Mathematical Structures for Computer Science”, W.H. Freeman and Company, NY, 2006.

2 M.K. Venkataraman, N. Sridharan and N.Chandrasekaran,“ Discrete Maths.”, The National Publishing Company, 2003.

3 Kishore S Trivedi, “Probability and statistics with reliability, Queing and computer science applications”, PHI, 2006.






Semester I


L T P C CA ES Total

07360102C ADVANCED COMPUTER ARCHITECTURE

3 1 0 4 50 50 100

Objective(s) Expose the students the concepts of computer architecture to exploit parallelism at the instruction level in a computer system, use the ILP concept for memory design and exploit parallelism in multi processes.

1 FUNDAMENTALS OF COMPUTER DESIGN Total Hrs 12

Introduction-measuring and reporting performance- Quantitative principles of computer design-Instruction set principles and examples- classifying instructions- set architectures-memory addressing-addressing modes for signal processing-type and size of operands.

2 INSTRUCTION LEVEL PARALLELISM Total Hrs 12

Concepts and challenges – overcoming data hazards with dynamic scheduling – examples- reducing branch costs with dynamic hardware prediction- high performance instruction delivery- taking advantages of ILP with multiple issues-limitations of ILP.

3 ILP WITH SOFTWARE APPROACHES Total Hrs 12

Basic compiler techniques for exposing ILP- static branch prediction- static multiple issues: VLIW approach- Advanced compiler support for exposing and exploiting ILP-Hardware support-cross cutting issues- Intel IA64 architecture.

4 MEMORY HIERARCHY DESIGN Total Hrs 12

Introduction- review of caches- cache performance- reducing cache miss penalty-reducing miss rate- miss rate via parallelism –reducing hit time – main memory and organizations for improving performance- memory technology- virtual memory.

5 MULTIPROCESSORS AND THREAD LEVEL PARALLELISM

Total Hrs 12

Symmetric shared memory architectures-performance of symmetric shared memory multiprocessors – Distributed shared memory architectures-synchronization- storage systems – types of storage devices- buses- reliability-availability and dependability- RAID – errors and failures in real systems- IO performance measures- Introduction to queuing theory.


Text book (s) :

1 John L. Hennessey and David A. Patterson,” Computer Architecture: A Quantitative Approach”, Morgan Kaufmann, 2006.

Reference(s):

1 D. Sima, T. Fountain and P. Kacsuk, “ Advanced Computer Architectures: A Design Space Approach”, Addison Wesley, 2000.

2 Kai Hwang “Advanced Computer Architecture: Parallelism, Scalability, Programmability” Tata McGraw Hill Edition, 2001.




Engineering Programme Code &

Name 36: M.E. Computer Science

and Engineering

Semester I


L T P C CA ES Total

07360103C DATA STRUCTURES AND ALGORITHMS

3 0 0 3 50 50 100

Objective(s) To understand the different methods of organizing large amounts of data, implementation of different data structures using C++ and to efficiently implement solutions for specific problems.

1 INTRODUCTION Total Hrs 9

Basic concepts of OOPs – Templates – Fundamentals of Analysis of Algorithm Efficiency – ADT – List (Singly, Doubly and Circular) Implementation – Array, Pointer.

2 BASIC DATA STRUCTURES Total Hrs 9

Stacks and Queues – ADT, Implementation and Applications – Trees – General, Binary, Binary Search, Expression Search, AVL, Splay, B-Trees – Implementations – Tree Traversals.

3 ADVANCED DATA STRUCTURES Total Hrs 9

Set – Implementation – Basic operations on set – Priority Queue – Implementation – Graphs – Directed Graphs – Shortest Path Problem – Undirected Graph – Spanning Trees – Graph Traversals.

4 SEARCHING AND SORTING Total Hrs 9

Searching Techniques, Sorting – Internal Sorting – Bubble Sort, Insertion Sort, Quick Sort, Heap Sort, Bin Sort, Radix Sort – External Sorting – Merge Sort, Multi-way Merge Sort, Polyphase Sorting

5 ALGORITHM DESIGN TECHNIQUES Total Hrs 9

Design Techniques – Divide and Conquer – Dynamic Programming – Greedy Algorithm – Backtracking – Local Search Algorithms.


Text book (s) :

1 Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, 3rd edition, Pearson Education, 2007.

Reference(s):

1 A. Levitin, “Introduction to The Design and Analysis of Algorithms “, 2nd edition, Addison Wesley, 2007.

2 Tanenbaum A.S., Langram Y and Augestien M.J., ”Data Structures using C & C++”, Prentice Hall of India, 2002.

3 Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education, 2002.

4 Horowitz, Sahni, Rajasekaran, “Computer Algorithms”, Galgotia, 2000.






and Engineering

Semester I


L T P C CA ES Total

07360104C OPERATING SYSTEMS 3 0 0 3 50 50 100

Objective(s) To know the components of an operating system, to have the thorough knowledge of process management and to have a thorough knowledge of storage management.


Main frame Systems, Desktop Systems – Multiprocessor Systems – Distributed Systems – Clustered Systems – Real Time systems – Hand held Systems, Operating Systems Structures: System Components – Operating System Services – System calls – System Programs – System Design and Implementation – CPU scheduling: Basic Concepts – Scheduling Algorithms.

2 PROCESS MANAGEMENT Total Hrs 11

Process Concepts – Process Scheduling – Operation on Process – Co-Operating process – Inter Process Communication – Threads: Multithreading Models – Process Synchronization: The Critical Section Problem – Synchronization Hardware– Semaphores – classical problem of Synchronization – Monitors – Deadlock: Deadlock Characterization – Methods for handling Deadlocks – Deadlock Prevention-Deadlock Avoidance – Deadlock Detection – Recovery from Deadlock.

3 MEMORY MANAGEMENT Total Hrs 9

Background – Swapping – Contiguous Memory Allocation – Paging – Segmentation– Segmentation with paging – Virtual Memory: Demand paging – Page Replacement-Thrashing. Buddy Systems – Storage Compaction.

4 FILE SYSTEMS Total Hrs 9

File Concepts – Access methods – Directory Structure – File Protection – File System Implementation: File System Structure and Implementation – Directory Implementation – Allocation methods Free Space Management – Recovery – Disk Structure – Disk Scheduling.

5 DISTRIBUTED OPERATING SYSTEM Total Hrs 9

Design issues in distributed operating system-Distributed file systems – Naming and Transparency-Remote File Access-Stateful versus Stateless service – Distributed Coordination- Event Ordering-Mutual Exclusion- Atomicity- Concurrency Control-Deadlock Handling-Election Algorithms-Case Study-Linux.


Text book (s) :

1 Avi Silberschatz, P.B.Galvin, G.Gagne “Operating System Concepts” seventh edition, John Wiley & Sons, 2007.

Reference(s):

1 Pradeep K.Sinha, “Distributed Operating System: Concepts and Design”, IEEE computer Society Press, PHI, 2004.

2 Andrew S. Tanenbaum , “Modern Operating Systems”, PHI , 2nd Edition, 2001.

3 Harvey M. Deitel, “Operating System”, Second Edition, Pearson Education Pvt. Ltd, 2002.






Semester I


L T P C CA ES Total

07360105C SOFTWARE ENGINEERING METHODOLOGIES

3 0 0 3 50 50 100

Objective(s)

To know about the Different Life Cycle Models, Requirement Dictation Process, Analysis modeling and specification to enable the students to know the concept of various Implementation and testing strategies and also the techniques of Project planning and management.

1 PROCESS AND PROJECT MANAGEMENT Total Hrs 9

Software Process models – process iteration – process activities – rational unified process – computer aided software engineering. Management activities – project planning – project scheduling – risk management.

2 REQUIREMENT ANALYSIS Total Hrs 9

Functional and Non – functional requirements – user requirements – system requirements – interface specifications – software requirements document. Requirements engineering processes – feasibility studies – elicitation and analysis –validations – management. System Models – Context – Behavioural – Data – Object-Structured.

3 SOFTWARE DESIGN Total Hrs 9

Architectural Design – Distributed System Architectures – Application Architectures –Object Oriented Design – Real-time Software Design.

4 SOFTWARE TESTING Total Hrs 9

Software testing fundamentals – Test Case Design – White Box – Basis Path Testing – Control Structure Testing – Black Box – Testing for Specialized environments, Architectures and Applications - Software Testing Strategies – Approach – issues – testing – unit – integration – validation – system – art of debugging.

5 SOFTWARE QUALITY ASSURANCE Total Hrs 9

Software Quality Concepts – Quality Assurance – Software Technical Reviews – Formal Approach to Software Quality Assurance – Reliability – Quality Standards – Software Quality Assurance Plan – Software Maintenance – Software Configuration Management – configuration item – process – objects in the software configuration – version control – change control – configuration audit – status reporting – SCM Standards – Case study : Martha Stockton Greengage (MSG) foundations.


Text book (s) :

1 Roger S. Pressman, “Software Engineering: A Practitioner‟s Approach”, Sixth Edition, McGraw Hill, 2001.

Reference(s):

1 Ian Sommerville, “Software Engineering”, Pearson Education Asia, 6th Eidtion, 2000.

2 Pankaj Jalote – An Integrated Approach to Software Engineering, Springer Verlag, 1997.

3 James F Peters and Witold Pedryez, “Software Engineering – An Engineering Approach”, John Wiley and Sons, New Delhi, 2000.

4 Ali Behforooz and Frederick J Hudson, “Software Engineering Fundamentals”, Oxford University Press, New Delhi, 1996.






and Engineering

Semester I


L T P C CA ES Total

07360106C COMPUTER NETWORKS 3 0 0 3 50 50 100

Objective(s) To learn computer network fundamentals with layers and networking

1 COMPUTER NETWORKS AND INTERNET Total Hrs 9

Internet – Network edge – network core – access networks and physical media – ISP and Internet Backbones – delay and loss in packet switched network – protocol layers and service models.

2 APPLICATION LAYER Total Hrs 9

Principles of network application – web and HTTP – FTP – e-mail – DNS – P2P file sharing – Socket Programming with TCP and UDP.

3 TRANSPORT LAYER Total Hrs 9

Introduction and Transport layer services – multiplexing and de-multiplexing –connection less transport – principles of reliable data transfer – connection oriented transfer – principles of congestion control – TCP congestion control.

4 NETWORK LAYER Total Hrs 9

Introduction – Virtual circuits and Datagram networks – routers – internet protocol –forwarding and addressing in the internet – routing algorithms – routing in the internet – broadcast and multicast routing. – link layer – introduction and services – error detection and correction techniques – multiple access protocols - link layer addressing.

5 MULTIMEDIA AND NETWORKING Total Hrs 9

Streaming stored audio and video – best of the best effort service – protocol for real time interactive applications – network management – infrastructures – internet standards management framework.


Text book (s) :

1 James F. Kurose, Keith W. Ross, “Computer Networking – A top down Approach Featuring the Internet” ,Third Edition, Pearson Education, 2006.

Reference(s):

1 Behrouz A. Foruzan, “Data communication and Networking”, Tata McGraw Hill, 2004.

2 William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson Education, 2000.





36 : M.E. Computer Science and Engineering

Semester I


L T P C CA ES Total

07360107P DATA STRUCTURES LABORATORY

0 0 3 2 50 50 100

Objective(s) To implement various data structures as using C++

List of experiments

1. Implementation of List (Single, Double, Circular). 2. Implementation of Stack and Queue. 3. Implementation of Searching Techniques (any three) 4. Implementation of Sorting Techniques ( any Three) 5. Implementation of Hash table 6. Implementation of Heaps 7. Implementation of AVL Rotations 8. Implementation of Prim‟s Algorithm. 9. Implementation of Breadth First Search and Depth First Search Techniques. 10. Implementation of Dijkstra‟s Algorithm.






Semester II


L T P C CA ES Total

07360201C DATABASE TECHNOLOGY 3 0 0 3 50 50 100

Objective(s) To learn the fundamentals of data models and to conceptualize, depict a database system using ER diagram and the study of SQL, relational database design techniques which will help in physical DB design and recovery procedure.

1 DATA BASE SYSTEM CONCEPT Total Hrs 10

File systems - Database systems - Database systems architecture - Data models - Relational model – Hierarchical model - Network model - Entity-Relationship model - Data Dictionary - Database Administration and control.

2 RELATIONAL DATABASES Total Hrs 9

Codd's rules - Base tables - Views - Domains and key concept - Integrity rules - Relational Algebra – Relational calculus - Commercial query languages - Embedded SQL - Normalization and database design.

3 DATABASE SYSTEM DESIGN Total Hrs 8

File and storage structures - Indexing and Hashing - Query processing - Database recovery - Concurrency control - Transaction processing - Security and Integrity - Triggers.

4 DISTRIBUTED DATABASES Total Hrs 9

Centralized versus distributed databases - Fragmentation - Distributed database architecture - Client / Server databases - Distributed transactions - Locking and Commit protocols - Distributed concurrency Control – Security and reliability - Parallel databases.

5 ADVANCED DATABASES Total Hrs 9

The World Wide Web - Object oriented database - Object Relational database - XML, XML/QL - Data Analysis and OLAP - Data mining - Data warehousing.


Text book (s) :

1 Abraham Silberschatz, Henry. F. Korth, S.Sudharsan, Database System Concepts, 5

th Edition, Tata

McGraw Hill, 2005.

2 Ramez Elmasri, Shamkant B. Navathe, Fundamentals of Database Systems, 5

rd Edition, Addison

Wesley, 2006.

Reference(s):

1 Jim Buyens, Step by Step Web Database Development, PHI, 2001.

2 Stefano Ceri & Giuesppe Pelagatti, Distributed Databases - Principles and Systems, McGraw Hill Book Company, 1987.

3 Date C.J, “An Introduction to Database system”, Pearson Education, 7th Edition, 2003.






Semester II


L T P C CA ES Total

07360202C COMPILER DESIGN 3 1 0 4 50 50 100

Objective(s) To enable the students to understand the concepts of each phases of the compiler in depth.


Basic concepts - Grammar - Language - Parts of a compiler – Grouping of phases - Compiler construction tools.

2 LEXICAL ANALYZER Total Hrs 9

Role of a lexical analyzer – Input buffering - Specification and recognition of tokens - Finite automata - Regular expression to finite automation – Optimization of DFA-based pattern matchers-Use of a tool for generating lexical analyzer.

3 SYNTAX ANALYZER Total Hrs 9

Role of a parser - Context-free grammars - Top-down parsing - Bottom-up parsing - Use of a tool to generate parsers.

4 INTERMEDIATE CODE GENERATION Total Hrs 9

Intermediate languages - Declaration - Assignment statements - Boolean expressions - Flow control statements –Back patching.

5 CODE GENERATION Total Hrs 9

Introduction to optimization techniques - Issues in the design of a code generator - Run-time storage management - Design of a simple code generator.


Text book (s) :

1 Aho A.V, Ravi Sethi, J.D. Ullman, Compilers - Principles, Techniques and Tools, Addison- Wesley, 2003.

Reference(s):

1 Kennath C.Louden, Compiler Construction Principles and Practice, Vikas publishing House, 2004.

2 Allen I. Holub, Compiler Design in C, Prentice Hall of India, 2001.

3 Fischer Leblanc, Crafting Compiler, Benjamin Cummings, Menlo Park, 1988.






Semester II


L T P C CA ES Total

07360203C OBJECT ORIENTED SYSTEM DESIGN

3 1 0 4 50 50 100

Objective(s) Easily map the real world entity to object oriented environment and became master in various OOSAD methods and to acquire knowledge about OOAD analysis and design and development with tools.

1 OBJECT ORIENTED DESIGN FUNDAMENTALS Total Hrs 9

The Object Model – Classes And Objects - Complexity Of Software – Classification – Notation – Process – Pragmatics – Binary And Entity Relationship – Object Types – Object State – OOSD Life Cycle.

2 OBJECT ORIENTED METHODOLOGIES AND UML Total Hrs 9

Object Oriented Methodology: Rumbaugh, Booch, Jacobson, Shaler/Mellor, Coad/Yardon – Patterns – Frame Works – The Unified Approach – UML.

3 OBJECT ORIENTED ANALYSIS Total Hrs 9

Identify Use Cases – Use Case Model – Documentation – Classification – Identifying Classes – Noun Phrases Approach – Common Class Pattern Approach – Use Case Driven Approach – Identifying Object Relationship, Attributes And Models.

4 OBJECT ORIENTED DESIGN Total Hrs 9

Design Process – Design Axioms – Designing Classes – Access Layer Design – View Layer Design.

5 MANAGING OBJECT ORIENTED DEVELOPMENT Total Hrs 9

Managing Analysis And Design – Evaluation Testing – Coding – Maintenance – Metrics – Case Study: Foundation Class Library – Client/Server Computing.


Text book (s) :

1 Ali Bahrami, Object Oriented System Development, Mc Graw Hill International Edition, 1999.

Reference(s):

1 Bernd Bruegge, Allen H. Dutoit, “Object Oriented Software Engineering using UML, Patterns and Java”, Pearson Education 2

nd Edition 2004.

2 Larman, Applying UML & Patterns: An Introduction to Object Oriented Analysis and Design, Pearson Education, 2

nd Edition, 2003.






Semester II


L T P C CA ES Total

07360204C WEB TECHNOLOGY 3 0 0 3 50 50 100

Objective(s) To make the students to understand web programming languages and web applications.


Introduction – Network concepts – Web concepts – Internet addresses - Retrieving Data with URL – HTML – DHTML: Cascading Style Sheets - Scripting Languages: Javascript – Vbscript.

2 COMMON GATEWAY INTERFACE Total Hrs 9

Common Gateway Interface: Programming CGI Scripts – HTML Forms – Custom Database Query Scripts – Server Side Includes – Server security issues – XML.

3 JAVA PROGRAMMING Total Hrs 9

Java fundamentals: Classes – Inheritance – Packages – Interfaces – Exceptions Handling – Multi threading – Applets.

4 SERVER SIDE PROGRAMMING Total Hrs 9

Server side Programming – Active server pages – Java server pages – Java Servlets: Servlet container – Exceptions – Sessions and Session Tracking – Using Servlet context – Dynamic Content Generation – Servlet Chaining and Communications.

5 APPLICATIONS Total Hrs 9

Simple applications – Internet Commerce – Database connectivity – Online databases – EDI Applications in Business – Plug-ins – Firewalls.


Text book (s) :

1 Deitel, Deitel and Neito, “INTERNET and WORLD WIDE WEB – How to program”, Pearson education asia, 2002.

2 Norton D and Schildt H, “Java 2: The complete Reference”, Fifth Edition, TMH.

Reference(s):

1 Elliotte Rusty Herold , “Java Network Programming”, O‟Reilly Publications, 3rd

Edition, 2004.

2 Eric Ladd and Jim O‟Donnell, et al, “USING HTML 4, XML, and JAVA1.2”, PHI publications, 2003.

3 Jeffy Dwight, Michael Erwin and Robert Nikes “USING CGI”, PHI Publications, 1997.






Semester II


L T P C CA ES Total

07360205C INFORMATION SECURITY 3 0 0 3 50 50 100

Objective(s) To understand the basics of information security, the legal, ethical and professional issues in Information Security, the aspects of risk management, the various standards in this area and to know the technological aspects of Information Security.


History, What is Information Security?, Critical Characteristics of Information, NSTISSC Security Model, Components of an Information System, Securing the Components, Balancing Security and Access, The SDLC, The Security SDLC.

2 SECURITY INVESTIGATION Total Hrs 9

Need for Security, Business Needs, Threats, Attacks, Legal, Ethical and Professional Issues.

3 SECURITY ANALYSIS Total Hrs 9

Risk Management: Identifying and Assessing Risk, Assessing and Controlling Risk.

4 LOGICAL DESIGN Total Hrs 9

Blueprint for Security, Information Security Poicy, Standards and Practices, ISO 17799/BS 7799, NIST Models, VISA International Security Model, Design of Security Architecture, Planning for Continuity.

5 PHYSICAL DESIGN Total Hrs 9

Security Technology, IDS, Scanning and Analysis Tools, Cryptography, Access Control Devices, Physical Security, Security and Personnel.


Text book (s) :

1 Michael E Whitman and Herbert J Mattord, “Principles of Information Security”, Vikas Publishing House, New Delhi, 2004.

2 Matt Bishop, “Computer Security Art and Science”, Pearson/PHI, 2005.

Reference(s):

1 Stuart Mc Clure, Joel Scrambray, George Kurtz, “Hacking Exposed”, Tata McGraw-Hill, 2003.

2 Micki Krause, Harold F. Tipton, “Handbook of Information Security Management”, Vol 1-3 CRC Press LLC, 2004.






Semester II


L T P C CA ES Total

07360207P WEB TECHNOLOGY LABORATORY

0 0 3 2 50 50 100

Objective(s) Make the students to implement web applications using web languages

List of experiments

1. Web Page Creation using HTML and DHTML and Client side Scripting Languages 2. Write a application/GUI program in java for getting time and date information from the server using TCP/UDP 3. Design a FTP Server through which download /Upload files. 4. Design a XML web document for payroll processing. 5. Write a program in java to implement Database Connectivity 6. Write a JSP program for order processing 7. Write a JSP program for online shopping 8. Write a Servlet, program to access information from databases 9. Write a program in ASP to get the data of students using forms and stores them in database. 10. Write a program in ASP that makes use of Ad Rotator component. 11. Mini Project. *

* It will be executed and recorded through extra Lab.






Semester II


L T P C CA ES Total

07360208P DATABASE TECHNOLOGY LABORATORY

0 0 3 2 50 50 100

Objective(s) To improve querying techniques and fundamental concepts of transaction processing – concurrency control techniques.

List of experiments

1. Implement the Study of all SQL commands. 2. Implement the concept of Normalization. 3. Implement the concept of cursors and Triggers. 4. Implement the concept of Dynamic SQL. 5. Implement the inventory control system with a reorder level. 6. Develop a package for a bank to maintain its customer details. 7. Develop a package for the payroll of a company. 8. Develop an Office Automation package. 9. Develop a Student internal marks calculation from internal tests. 10. Design and implementation of Library Information System. 11. Develop a package for Income Tax Calculation. *

* It will be executed and recorded through extra Lab.






Semester II


L T P C CA ES Total

07310210P TECHNICAL REPORT PREPARATION & PRESENTATION I

0 0 3 2 100 00 100

Objective(s) To provide exposure to the students to refer, read and review the research articles in referred journals and conference proceedings. To Improve the technical report writing and presentation skills of the students.

Methodology Each student is allotted to a faculty of the department by the HOD

By mutual discussions, the faculty guide will assign a topic in the general / subject area to the student.

The students have to refer the Journals and Conference proceedings and collect the published literature.

The student is expected to collect atleast 20 such Research Papers published in the last 5 years.

Using OHP/Power Point, the student has to make presentation for 15-20 minutes followed by 10 minutes discussion.

The student has make two presentations, one at the middle and the other near the end of the semester.

The student has to write a Technical Report for about 30-50 pages (Title page, One page Abstract, Review of Research paper under various subheadings, Concluding Remarks and List of References). The technical report has to be submitted to the HOD one week before the final presentation, after the approval of the faculty guide.

Execution

Week Activity

I Allotment of Faculty Guide by the HoD

II Finalizing the topic with the approval of Faculty Guide

III-IV Collection of Technical papers

V-VI Mid semester presentation

VII-VIII Report writing

IX Report submission

X-XI Final presentation

Evaluation

50% by Continuous Assessment and 50% by End Semester examination 3 Hrs/week and 2 credits

Component Weightage

Mid semester presentation 25%

Final presentation (Internal) 25%

End Semester Examination Report 30%

Presentation 20%

Total 100%






Elective


L T P C CA ES Total

07360241E HIGH SPEED NETWORKS 3 0 0 3 50 50 100

Objective(s)

To highlight the features of different technologies involved in High Speed Networking and their performance. Students will get an introduction about ATM and Frame relay. It provides up-to-date survey of developments in High Speed Networks. It also enable the students to know techniques involved to support real-time traffic and congestion control. Students will be provided with different levels of quality of service (Q.S) to different applications.

1 HIGH SPEED NETWORKS Total Hrs 9

Frame Relay Networks – Asynchronous transfer mode – ATM Protocol Architecture, ATM logical Connection, ATM Cell – ATM Service Categories – AAL. High Speed LAN‟s: Fast Ethernet, Gigabit Ethernet, Fibre Channel – Wireless LAN‟s: applications, requirements – Architecture of 802.11.

2 CONGESTION AND TRAFFIC MANAGEMENT Total Hrs 9

Queuing Analysis- Queuing Models – Single Server Queues – Effects of Congestion – Congestion Control – Traffic Management – Congestion Control in Packet Switching Networks – Frame Relay Congestion Control.

3 TCP AND ATM CONGESTION CONTROL Total Hrs 9

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.

4 INTEGRATED AND DIFFERENTIATED SERVICES Total Hrs 9

Integrated Services Architecture – Approach, Components, Services- Queuing Discipline, FQ, PS, BRFQ, GPS, WFQ – Random Early Detection, Differentiated Services.

5 PROTOCOLS FOR QOS SUPPORT Total Hrs 9

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 book (s) :

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

Reference(s):

1 Warland & Pravin Varaiya, “HIGH PERFORMANCE COMMUNICATION NETWORKS”, Jean Harcourt Asia Pvt. Ltd., II Edition, 2001.

2 Irvan Pepelnjk, Jim Guichard and Jeff Apcar, “MPLS and VPN architecture”, Cisco Press, Volume 1 and 2, 2003.






Elective


L T P C CA ES Total

07360242E XML AND WEB SERVICES 3 0 0 3 50 50 100

Objective(s) To learn xml and web services thoroughly


Role Of XML – XML and The Web – XML Language Basics – SOAP – Web Services – Revolutions Of XML – Service Oriented Architecture (SOA).

2 XML TECHNOLOGY Total Hrs 10

XML – Name Spaces – Structuring With Schemas and DTD – Presentation Techniques – Transformation – XML Infrastructure.

3 SOAP Total Hrs 10

Overview Of SOAP – HTTP – XML-RPC – SOAP: Protocol – Message Structure – Intermediaries – Actors – Design Patterns And Faults – SOAP With Attachments.

4 WEB SERVICES Total Hrs 10

Overview – Architecture – Key Technologies - UDDI – WSDL – ebXML – SOAP And Web Services In E-Com – Overview Of .NET And J2EE.

5 XML SECURITY AND XML IN PRACTICE Total Hrs 10

Security Overview – Canonicalization – XML Security Framework – XML Encryption – XML Digital Signature – XKMS Structure – Guidelines For Signing XML Documents – Dimensions of XML In Practice – XML Application Spectrum – Vertical Industry Data Descriptions : Finance OFX – Tracking XML Standards – Configuration and action : EJB and XML – SVG, Voice XML, SMIL – Power through combination : The British Government GovTalk Initiative.


Text book

1 Frank. P. Coyle, XML, Web Services And The Data Revolution, Pearson Education, 2002.

Reference(s):

1 Ramesh Nagappan , Robert Skoczylas and Rima Patel Sriganesh, “ Developing Java Web Services”, Wiley Publishing Inc., 2004.

2 Sandeep Chatterjee, James Webber, “Developing Enterprise Web Services”, Pearson Education, 2004.

3 McGovern, et al., “Java Web Services Architecture”, Morgan Kaufmann Publishers, 2005.






Elective


L T P C CA ES Total

07360243E THEORY OF COMPUTATION 3 0 0 3 50 50 100

Objective(s)

Students have an understanding of finite state and pushdown automata. They have knowledge of regular languages, context free languages and know the relation between regular language, context free language and corresponding recognizers. study the Turing machine and classes of problems.

1 AUTOMATA Total Hrs 9

Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite Automata (FA) – Deterministic Finite Automata (DFA)– Non-deterministic Finite Automata (NFA) – Finite Automata with Epsilon transitions.

2 REGULAR EXPRESSIONS AND LANGUAGES Total Hrs 9

Regular Expression – FA and Regular Expressions – Proving languages not to be regular – Closure properties of regular languages – Equivalence and minimization of Automata.

3 CONTEXT-FREE GRAMMAR AND LANGUAGES Total Hrs 9

Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages – Definition of the Pushdown automata – Languages of a Pushdown Automata – Equivalence of Pushdown automata and CFG, Deterministic Pushdown Automata.

4 PROPERTIES OF CONTEXT-FREE LANGUAGES Total Hrs 9

Normal forms for CFG – Pumping Lemma for CFL - Closure Properties of CFL – Turing Machines – Programming Techniques for TM.

5 UNDECIDABILITY Total Hrs 9

A language that is not Recursively Enumerable (RE) – An undecidable problem that is RE – Undecidable problems about Turing Machine – Post‟s Correspondence Problem - The classes P and NP.


Text book (s) :

1 J.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata Theory, Languages and Computations”, Second Edition, Pearson Education, 2003.

Reference(s):

1 H.R.Lewis and C.H.Papadimitriou, “Elements of The theory of Computation”, Second Edition, Pearson Education/PHI, 2003.

2 J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, TMH, 2003.

3 Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997.






Elective


L T P C CA ES Total

07360244E SOFT COMPUTING 3 0 0 3 50 50 100

Objective(s) To introduce the ideas of fuzzy sets and fuzzy logic and functions with neural networks that can learn from available examples to know the concept of genetic algorithms.

1 BASICS OF ARTIFICIAL NEURAL NETWORKS Total Hrs 9

Fundamentals of ANN: The Biological Neural Network, Artificial Neural Networks - Building Blocks of ANN and ANN terminologies: architecture, setting of weights, activation functions - McCulloch-pitts Neuron Model, Hebbian Learning rule, Perception learning rule, Delta learning rule.

2 MODELS OF ANN Total Hrs 9

Single layer perception, Architecture, Algorithm, application procedure - Feedback Networks: Hopfield Net and BAM - Feed Forward Networks: Back Propogation Network (BPN) and Radial Basis Function Network (RBFN) – Self Organizing Feature Maps: SOM and LVQ.

3 FUZZY SET THEORY Total Hrs 9

Fuzzy Sets, properties and operations - Fuzzy relations, cardinality, operations and properties of fuzzy relations, fuzzy composition - Fuzzy variables - Types of membership functions - fuzzy rules: Takagi and Mamdani – fuzzy inference systems: fuzzification, inference, rulebase, defuzzification.

4 GENETIC ALGORITHM Total Hrs 9

Genetic Algorithm (GA): Biological terminology – elements of GA: encoding, types of selection, types of crossover, mutation, reinsertion – a simple genetic algorithm – Theoretical foundation: schema, fundamental theorem of GA, building block hypothesis.

5 NEURO FUZZY MODELING Total Hrs 9

Adaptive Neuro – Fuzzy Inference Systems – Architecture – Hybrid Learning Algorithm – learning Methods that Cross-fertilize ANFIS and RBFN – Coactive Neuro-Fuzzy Modeling – Framework – Neuron Functions for Adaptive Networks – Neuro Fuzzy Spectrum.


Text book (s) :

1 J.S.R.Jang, C.T.Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI,Pearson Education 2004.

2 S. Rajasekaran and G.A.V.Pai, “Neural Networks, Fuzzy Logic and Genetic Algorithms”, PHI, 2003.

Reference(s):

1 S.N.Sivanandam, M.Paulraj, “Introduction to Artificial Neural Networks”, Vikas Publishing House Pvt. Ltd., 2003.

2 Timothy J.Ross, “Fuzzy Logic with Engineering Applications”, McGraw-Hill, 1995.

3 Davis E.Goldberg, “Genetic Algorithms: Search, Optimization and Machine Learning”, Addison Wesley, N.Y, 1989.






Elective


L T P C CA ES Total

07360245E SOFTWARE COMMUNICATION AND DOCUMENTATION

3 0 0 3 50 50 100

Objective(s) Describe the communication and its importance. Improve the communication skills. Compare the written and spoken communication. Technologies to implement the effective communication.

1 BASIC CONCEPTS Total Hrs 9

Importance of communication and documentation; Different types of communication; Spoken communication; written communication; Different types of documentation.

2 SPOKEN INDIVIDUAL SPOKEN COMMUNICATION Total Hrs 9

Elements of good individual communication – getting over nervousness – organizing one self – characteristics of effective communication – augmenting spoken words by actions and other means – other aspects of spoken communication like speeches; presentations; use of visual aids.

3 GROUP COMMUNICATION Total Hrs 9

Meeting – effective participation – effective management of meetings – preparing minutes – “virtual” meetings audio conference – video conference – use of collaboration tools.

4 DIFFERENT TYPES OF WRITTEN COMMUNICATION Total Hrs 9

Principles of effective written communication – differences between written communication and spoken communication – resume writing – e-mail; effective e-mail techniques – proposals – contracts – user guides – external technical documentation for software – internal software technical documentation – users guides – letters and different types of letters – legal issues.

5 TECHNOLOGY AND STANDARDS Total Hrs 9

Use of various tools and technologies – need for standardization – role of processes and standards in documentation – on-line help – impact of Internet on documentation – common challenges in the harnessing of technology; courses summary.


Text book (s) :

1 Huckin, et al, “Technical Writing and Professional Communication”, McGraw Hill, 1991.

2 W.R.Gordin and Edward W.Mammen: “The Art of Speaking Made Simple”, Rupa & Co., 1982.

Reference(s):

1. Ron Ludlow and Fergus Panton, “The Essence of Effective Communication”, PHI (P) Ltd., New Delhi, 1995.

2. Sushil Bahl: “Business Communication Today”, Response Books, New Delhi, 1996.

3. Eyre, “Effective Communication Made Simple”, W.H. Allen, London, 1979.

4. Gloria Wilson and Garry Bitter, “Learning Media Design (Text and CD Rom)”, PHI (P) Ltd., New Delhi, 1998.

5. Simmon Collin – “Multimedia Made Simple”, Asian Books (P) New Delhi, 1996.

6. Bennet – “Illustrated World of DTP”, Dreamland Publications, New Delhi, 1998.






Elective


L T P C CA ES Total

07360246E BIO INFORMATICS 3 0 0 3 50 50 100

Objective(s) To learn about Data Base Management System, Data Mining Application Bio Informatics.


The Central Dogma – Killer Application – Parallel Universes – Watson‟s Definition – Top Down Vs Bottom Up Approach – Information Flow – Conversance – Communications.

2 DATABASE AND NETWORKS Total Hrs 9

Definition – Data Management – Data Life Cycle – Database Technology – Interfaces – Implementation – Networks: Communication Models – Transmission Technology – Protocols – Bandwidth – Topology – Contents – Security – Ownership – Implementation.

3 SEARCH ENGINES AND DATA VISUALIZATION Total Hrs 10

Search Process – Technologies – Searching And Information Theory – Computational Methods – Knowledge Management – Sequence Visualizations – Structure Visualizations – User Interfaces – Animation Vs Simulation.

4 STATISTICS, DATA MINING AND PATTERN MATCHING

Total Hrs 11

Statistical Concepts – Micro Arrays – Imperfect Data – Basics – Quantifying – Randomness – Data Analysis – Tools Selection – Alignment – Clustering – Classification – Data Mining Methods – Technology – Infrastructure Pattern Recognition – Discovery – Machine Learning – Text Mining – Pattern Matching Fundamentals – Dot Matrix Analysis – Substitution Matrix – Dynamic Programming – Word Method – Bayesian Method – Multiple Sequence Alignment Tools.

5 MODELING SIMULATION AND COLLABORATION Total Hrs 8

Drug Discovery Fundamentals – Protein Structure – System Biology Tools – Collaboration And Communication – Standards – Issues – Case Study.


Text book

1 Bryan Bergeron, “Bio Informatics Computing”, Prentice Hall, 2003.

Reference(s):

1 T.K. Affward, D.J. Parry Smith, “Introduction to Bio Informatics”, Pearson Education, 2001.

2 Pierre Baldi, Soren Brunak, “Bio Informatics – The Machine Learning Approach”, 2nd

Edition, First East West Press, 2003.






Elective


L T P C CA ES Total

07360351E DISTRIBUTED COMPUTING 3 0 0 3 50 50 100

Objective(s) To understand the concepts of distributed systems, operating system issues and to learn about distributed transaction processing.


Characterization of Distributed Systems - Examples - Resource Sharing and the Web - Challenges - System Models - Architectural and Fundamental Models - Networking and Internetworking - Types of Networks - Network Principles - Internet Protocols - Case Studies.

2 PROCESSES AND DISTRIBUTED OBJECTS Total Hrs 9

Interprocess Communication - The API for the Internet Protocols - External Data Representation and Marshalling - Client-Server Communication - Group Communication - Case Study - Distributed Objects and Remote Invocation - Communication Between Distributed Objects - Remote Procedure Call - Events and Notifications - Java RMI - Case Study.

3 OPERATING SYSTEM ISSUES – I Total Hrs 9

The OS Layer - Protection - Processes and Threads - Communication and Invocation – OS Architecture - Security - Overview - Cryptographic Algorithms - Digital Signatures - Cryptography Pragmatics - Case Studies - Distributed File Systems - File Service Architecture - Sun Network File System - The Andrew File System.

4 OPERATING SYSTEM ISSUES – II Total Hrs 9

Name Services –Domain Name System - Directory and Discovery Services - Global Name Service - X.500 Directory Service - Clocks, Events and Process States - Synchronizing Physical Clocks - Logical Time And Logical Clocks - Global States - Distributed Debugging - Distributed Mutual Exclusion – Elections – Multicast Communication Related Problems.

5 DISTRIBUTED TRANSACTION PROCESSING Total Hrs 9

Transactions - Nested Transactions - Locks - Optimistic Concurrency Control - Timestamp Ordering - Comparison - Flat and Nested Distributed Transactions - Atomic Commit Protocols - Concurrency Control in Distributed Transactions - Distributed Deadlocks - Transaction Recovery - Overview of Replication And Distributed Multimedia Systems.


Text book (s) :

1 George Coulouris, Jean Dollimore and Tim Kindberg, Distributed Systems Concepts and Design, Pearson Education, 3

rd Edition, 2002.

Reference(s):

1 Sape Mullender, Distributed Systems, Addison Wesley, 2nd

Edition, 1993.

2 Albert Fleishman, Distributes Systems- Software Design and Implementation, Springer-Verlag, 1994.

3 M.L.Liu, Distributed Computing Principles and Applications, Pearson Education, 2004.

4 Andrew S Tanenbaum, Maartenvan Steen, Distibuted Systems –Principles and Pardigms, Pearson Education, 2002.

5 Mugesh Singhal, Niranjan G Shivaratri, Advanced Concepts in Operating Systems, Tata McGraw Hill Edition, 2001.






Elective


L T P C CA ES Total

07360352E SOFTWARE ARCHITECTURE 3 0 0 3 50 50 100

Objective(s) To learn about the Layered architecture system, Share Information System with Architecture design and User Interface Design and about various software architecture tools.


Introduction – Software Architecture – Definition – Prospects – State of Art – Architectural Styles – Pipes and Filters – Layered Systems – Repositories – Process Control – Other familiar Architecture – Heterogeneous.

2 SHARED INFORMATION SYSTEMS Total Hrs 9

Shared Information Systems – DB Integration – Integration in Software Development Environments – Integration and Design of Building – Architecture Structures for Shared Information Systems.

3 ARCHITECTURE DESIGN Total Hrs 9

Architectural design and Mapping – Round trip engineering – Architecture design patterns – Object Oriented Organization.

4 USER INTERFACE ARCHITECTURE Total Hrs 9

Architecture design guidance – User Interface Architecture – Quantified design space – Formalizing architectural description language – First class connectors – Adding implicit invocation to traditional programming languages.

5 TOOLS Total Hrs 9

Tools for Architectural design – Unicon, A4 – Exploiting style in architectural design – Architectural Interconnection – Case Studies.


Text Book

1 Mary Shaw David Garlan, “Software Architectural Perspectives on an emerging discipline”, EEE, PHI 1996.

Reference(s):

2 Wolfgng pree, “Design patterns for Object Oriented Software Development”, Addison Wesley, 1995.






Elective


L T P C CA ES Total

07360353E GRID COMPUTING 3 0 0 3 50 50 100

Objective(s) To understanding the technology and tool kits to facilitated the grid computing and knew the application, genesis of grid computing.

1 GRID COMPUTING Total Hrs 9

Introduction - Definition - Scope of grid computing

2 GRID COMPUTING INITIATIVES Total Hrs 9

Grid Computing Organizations and their roles – Grid Computing analog – Grid Computing road map.

3 GRID COMPUTING APPLICATIONS Total Hrs 9

Merging the Grid sources – Architecture with the Web Devices Architecture.

4 TECHNOLOGIES Total Hrs 9

OGSA – Sample use cases – OGSA platform components – OGSI – OGSA Basic Services.

5 GRID COMPUTING TOOL KITS Total Hrs 9

Globus Toolkit – Architecture, Programming model, High level services – OGSI .Net middleware Solutions.


Text book

1 Joshy Joseph & Craig Fellenstein, “Grid Computing”, PHI, PTR-2003.

Reference(s):

1 Ahmar Abbas, “Grid Computing: A Practical Guide to technology and Applications”, Charles River media – 2003.






Elective


L T P C CA ES Total

07360354E NETWORK SECURITY 3 0 0 3 50 50 100

Objective(s) To know the methods of conventional encryption and the concepts of public key encryption and number theory. The network security tools and application and authentication Hash function.


Attacks - Services - Mechanisms - Conventional Encryption - Classical And Modern Techniques – Encryption Algorithms - Confidentiality.

2 PUBLIC KEY ENCRYPTION Total Hrs 9

RSA - Elliptic Curve Cryptography - Number Theory Concepts.

3 MESSAGE AUTHENTICATION Total Hrs 9

Hash Functions - Digest Functions - Digital Signatures - Authentication Protocols.

4 NETWORK SECURITY PRACTICE Total Hrs 9

Authentication, Applications - Electronic Mail Security - IP Security - Web Security.

5 SYSTEM SECURITY Total Hrs 9

Intruders – Viruses – Worms – Firewalls Design Principles – Trusted Systems.


Text book

1 Stallings, Cryptography & Network Security - Principles & Practice, Prentice Hall, 3rd

Edition 2002.

Reference(s):

1 Bruce, Schneier, Applied Cryptography, 2nd Edition, Toha Wiley & Sons, 1996.

2 Man Young Rhee, “Internet Security”, Wiley, 2003.

3 Pfleeger & Pfleeger, “Security in Computing”, Pearson Education, 3rd Edition, 2003.






Elective


L T P C CA ES Total

07360355E EMBEDDED SYSTEMS 3 0 0 3 50 50 100

Objective(s) To introduce the concepts of embedded systems, its hardware and software, devices, buses used for embedded networking, embedded programming in C and C++, real time operating systems and inter-task communication.

1 INTRODUCTION TO EMBEDDED SYSTEMS Total Hrs 9

Definition and Classification – Overview of Processors and hardware units in an embedded system – Software embedded into the system – Exemplary Embedded Systems – Embedded Systems on a Chip (SOC) and the use of VLSI designed circuits.

2 DEVICES AND BUSES FOR DEVICES NETWORK Total Hrs 9

I/O Devices - Device I/O Types and Examples – Synchronous - ISO-synchronous and Asynchronous Communications from Serial Devices - Examples of Internal Serial-Communication Devices - UART and HDLC - Parallel Port Devices - Sophisticated interfacing features in Devices/Ports- Timer and Counting Devices - „12C‟, „USB‟, „CAN‟ and advanced I/O Serial high speed buses- ISA, PCI, PCI-X, CPCI and advanced buses.

3 EMBEDDED PROGRAMMING Total Hrs 9

Programming in assembly language (ALP) vs. High Level Language - C Program Elements, Macros and functions -Use of Pointers - NULL Pointers - Use of Function Calls – Multiple function calls in a Cyclic Order in the Main Function Pointers – Function Queues and Interrupt Service Routines Queues Pointers – Concepts of EMBEDDED PROGRAMMING in C++ - Objected Oriented Programming – Embedded Programming in C++, „C‟ Program compilers – Cross compiler – Optimization of memory codes.

4 REAL-TIME CHARACTERISTICS Total Hrs 9

Clock driven Approach, weighted round robin Approach, Priority driven Approach, Dynamic Versus Static systems, effective release times and deadlines, Optimality of the Earliest deadline first (EDF) algorithm, challenges in validating timing constraints in priority driven systems, Off-line Versus On-line scheduling.

5 SYSTEM DESIGN TECHNIQUES Total Hrs 9

Design Methodologies, Requirement Analysis, Specification, System Analysis and Architecture Design, Quality Assurance, Design Example: Telephone PBX- System Architecture, Ink jet printer- Hardware Design and Software Design, Personal Digital Assistants, Set-top Boxes.


Text book (s) :

1. Rajkamal, Embedded Systems Architecture, Programming and Design, TATA McGraw Hill, First reprint 2003.

Reference(s):

1 Jane.W.S. Liu Real-Time systems, Pearson Education Asia, 2000.

2 C. M. Krishna and K. G. Shin , Real-Time Systems, ,McGraw-Hill, 1997.

3 David E.Simon, An Embedded Software Primer, Pearson Education Asia, First Indian Reprint 2000.

4 Wayne Wolf, Computers as Components: Principles of Embedded Computing System Design, Morgan Kaufman Publishers, 2001.






Elective


L T P C CA ES Total

07360356E DATA WAREHOUSING AND DATA MINING

3 0 0 3 50 50 100

Objective(s) To introduce the concept of data mining with in detail coverage of basic tasks, metrics, issues, and implication. Core topics like classification, clustering and association rules are exhaustively dealt with.

1 INTRODUCTION AND DATA WAREHOUSING Total Hrs 8

Introduction, Data Warehouse, Multidimensional Data Model, Data Warehouse Architecture, Implementation, Further Development, Data Warehousing to Data Mining

2 DATA PREPROCESSING, LANGUAGE, ARCHITECTURES, CONCEPT DESCRIPTION

Total Hrs 8

Why Preprocessing, Cleaning, Integration, Transformation, Reduction, Discretization, Concept Hierarchy Generation, Data Mining Primitives, Query Language, Graphical User Interfaces, Architectures, Concept Description, Data Generalization, Characterizations, Class Comparisons, Descriptive Statistical Measures.

3 ASSOCIATION RULES Total Hrs 9

Association Rule Mining, Single-Dimensional Boolean Association Rules from Transactional Databases, Multi-Level Association Rules from Transaction Databases.

4 CLASSIFICATION AND CLUSTERING Total Hrs 12

Classification and Prediction, Issues, Decision Tree Induction, Bayesian Classification, Association Rule Based, Other Classification Methods, Prediction, Classifier Accuracy, Cluster Analysis, Types of data, Categorisation of methods, Partitioning methods, Outlier Analysis.

5 RECENT TRENDS Total Hrs 8

Multidimensional Analysis and Descriptive Mining of Complex Data Objects, Spatial Databases, Multimedia Databases, Time Series and Sequence Data, Text Databases, World Wide Web, Applications and Trends in Data Mining.


Text book (s) :

1 J. Han, M. Kamber, “Data Mining: Concepts and Techniques”, Harcourt India / Morgan Kauffman, 2001.

Reference(s):

1 Margaret H.Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson Education 2004.

2 Sam Anahory, Dennis Murry, “Data Warehousing in the real world”, Pearson Education 2003.

3 David Hand, Heikki Manila, Padhraic Symth, “Principles of Data Mining”, PHI 2004.

4 W.H.Inmon, “Building the Data Warehouse”, 3rd

Edition, Wiley, 2003.

5 Alex Bezon, Stephen J.Smith, “Data Warehousing, Data Mining & OLAP”, MeGraw-Hill Edition, 2001.

6 Paulraj Ponniah, “Data Warehousing Fundamentals”, Wiley-Interscience Publication, 2003.






Elective


L T P C CA ES Total

07360361E ADHOC NETWORKS 3 0 0 3 50 50 100

Objective(s) To learn about adhoc protocols and security protocolsand the concept of adhoc networks.


Introduction-Fundamentals of Wireless Communication Technology - The Electromagnetic Spectrum - Radio Propagation Mechanisms - Characteristics of the Wireless Channel - IEEE 802.11a,b Standard – Origin Of Ad hoc: Packet Radio Networks - Technical Challenges - Architecture of PRNETs - Components of Packet Radios – Ad hoc Wireless Networks -What Is an Ad Hoc Network? Heterogeneity in Mobile Devices - Wireless Sensor Networks - Traffic Profiles - Types of Ad hoc Mobile Communications - Types of Mobile Host Movements - Challenges Facing Ad Hoc Mobile Networks-Ad hoc wireless Internet.

2 AD HOC ROUTING PROTOCOLS Total Hrs 9

Introduction - Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks - Classifications of Routing Protocols -Table-Driven Routing Protocols - Destination Sequenced Distance Vector (DSDV) - Wireless Routing Protocol (WRP) - Cluster Switch Gateway Routing (CSGR) - Source-Initiated On-Demand Approaches - Ad Hoc On-Demand Distance Vector Routing (AODV) - Dynamic Source Routing (DSR) -Temporally Ordered Routing Algorithm (TORA) - Signal Stability Routing (SSR) -Location-Aided Routing (LAR) - Power-Aware Routing (PAR) - Zone Routing Protocol (ZRP).

3 MULTICASTROUTING IN AD HOC NETWORKS Total Hrs 9

Introduction - Issues in Designing a Multicast Routing Protocol - Operation of Multicast Routing Protocols - An Architecture Reference Model for Multicast Routing Protocols -Classifications of Multicast Routing Protocols - Tree-Based Multicast Routing Protocols- Mesh-Based Multicast Routing Protocols - Summary of Tree-and Mesh-Based Protocols - Energy-Efficient Multicasting - Multicasting with Quality of Service Guarantees - Application-Dependent Multicast Routing - Comparisons of Multicast Routing Protocols.

4 TRANSPORT LAYER, SECURITY PROTOCOLS Total Hrs 9

Introduction - Issues in Designing a Transport Layer Protocol for Ad Hoc Wireless Networks - Design Goals of a Transport Layer Protocol for Ad Hoc Wireless Networks -Classification of Transport Layer Solutions - TCP Over Ad Hoc Wireless Networks -Other Transport Layer Protocols for Ad Hoc Wireless Networks - Security in Ad Hoc Wireless Networks - Network Security Requirements - Issues and Challenges in Security Provisioning - Network Security Attacks - Key Management - Secure Routing in Ad Hoc Wireless Networks.

5 QoS AND ENERGY MANAGEMENT Total Hrs 9

Introduction - Issues and Challenges in Providing QoS in Ad Hoc Wireless Networks -Classifications of QoS Solutions - MAC Layer Solutions - Network Layer Solutions - QoS Frameworks for Ad Hoc Wireless Networks Energy Management in Ad Hoc Wireless Networks –Introduction - Need for Energy Management in Ad Hoc Wireless Networks - Classification of Energy Management Schemes - Battery Management Schemes - Transmission Power Management Schemes - System Power Management Schemes.


Text book:

1 C. Siva Ram Murthy and B.S. Manoj “Ad Hoc Wireless Networks: Architectures and Protocols”, Prentice Hall PTR, 2004.

Reference(s):

1 C.K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems, Prentice Hall PTR, 2001.

2 Charles E. Perkins, Ad Hoc Networking, Addison Wesley, 2000.






Elective


L T P C CA ES Total

07360362E PERFORMANCE EVALUATION OF COMPUTER SYSTEMS AND NETWORKS

3 0 0 3 50 50 100

Objective(s) To learn about probability stochastic process, queuing theory, Petri Nets and system performance.


Need for performance evaluation – Role of performance evaluation - performance evaluation Methods – Performance Metrics and Evaluation Criteria – CPU and I/O Architectures – Distributed and Network Architectures– Secondary Storage – Topologies – Computer Architecture - Fundamental Concepts and Performance Measures.

2 PROBABILITY AND STOCHASTIC PROCESSES Total Hrs 9

Scheduling Algorithms – Workloads – Random Variables – Probability Distributions – Densities – Expectation – Stochastic Processes – Poisson Process – Birth-Death Process – Markov Process.

3 QUEUING THEORY Total Hrs 9

Queuing Systems – Networks of Queues - Estimating Parameters and Distributions – Computational Methods – Simulation Process – Time Control – Systems and Modeling.

4 PETRI NETS AND SYSTEM PERFORMANCE Total Hrs 9

Petri Nets – Classical Petri Nets – Timed Petri Nets – Priority-based Petri Nets – Colored Petri Nets – Generalized Petri Nets – Tool Selection – Validation of Results – Performance Metrics – Evaluation – Multiple Server Computer System Analysis.

5 ANALYSIS Total Hrs 9

OS Components – System Architecture – Workloads – Design – Simulation – Analysis - Database System Performance – Computer Networks Components – Simulation Modelling of LAN.


Text Book

1 Paul J. Fortier, Howard E. Michael, “Computer Systems Performance Evaluation and Prediction”, Elsvier Science (USA), 2003.

Reference(s):

2 Thomas G. Robertazzi, “Computer Networks and Systems: Queing theory and Performance Evaluation”, 3

rd Edition, Springer, 2000.

3 Domenico Ferrari , Giuseppe Serazzi ,Alexandro Zeijher, Measurement & Tuning of Computer Systems –Prentice Hall Inc, 1983.

4 Michael F.Mories and Paul F.Roth,. Tools and techniques, Computer Performance Evaluation, Van Nostrand, New York, 1982.






Elective


L T P C CA ES Total

07360363E ADVANCED DATABASES 3 0 0 3 50 50 100

Objective(s) To understand about different data models that can be used for the databases. the students to get familiarized with transaction management of the database and Develop in-depth knowledge about web and intelligent database.

1 DATABASE MANAGEMENT Total Hrs 9

Relational Data Models- SQL- Database Design- Entity-Relationship Model- Relational Normalization- Embedded SQL- Dynamic SQL.

2 QUERY AND TRANSACTION PROCESSING Total Hrs 9

Query processing Basics- Heuristic Optimization- Cost, Size Estimation- Models of Transaction- Architecture- Transaction Processing in a Centralized and Distributed System.

3 IMPLEMENTING AND ISOLATION

Schedules- Concurrency Control- Objects and Semantic Commutative - Locking- Crash, Abort and Media Failure- Recovery- Atomic Termination- Distributed Deadlock- Global Serialization- Replicated Databases- Distributed Transactions in Real World.

4 OBJECT ORIENTED DATABASES Total Hrs 9

Object Oriented Databases-Introduction- Object Oriented Data Models-OODBMS Perspectives- Issues in OODBMS- Advantages and Disadvantages of OODBMS- OODBMS Design-OODBMS Standards and Systems.

5 CURRENT TRENDS Total Hrs 9

XML and Web Data- XML Schema- Distributed Databases- Data Mining and Data Warehousing- Mobile Databases-Geographic Information Systems-Multimedia Database-Parallel Database.


Text book (s) :

1 Abraham Silberschatz, henry.f. korth, S,Sudharsan, Database System Concepts, 4th

Edition., Tata mcgraw hill, 2004.

Reference(s):

1 Philip M.Lewis, Arthur berntein, Michael Kifer, “Databases and Transaction Processing:An Application –Oriented Approach”, Addison-Wesley, 2002.

2 R. Elmasri and S.B. Navathe, Fundamentals of Database Systems, 3rd

Edition, Addison Wesley, 2004.

3 C.S.R.Prabhu, “Object Oriented Database Systems”, PHI, 2003.






Elective


L T P C CA ES Total

07360364E SOFTWARE QUALITY ASSURANCE

3 0 0 3 50 50 100

Objective(s) To have an understanding about the basic concepts of Software Quality Assurance & Quality Controls with different standards for Quality assurance and also about the future trends in Software Quality Assurance.

1 CONCEPTS Total Hrs 9

Concepts of Quality Control, Quality Assurance, Quality Management - Total Quality Management; Cost of Quality; QC tools - 7 QC Tools and Modern Tools; Other related topics - Business Process Re-engineering –Zero Defect, Six Sigma, Quality Function Deployment, Benchmarking, Statistical process control.

2 SOFTWARE ENGINEERING CONCEPTS Total Hrs 9

Software Engineering Principles, Software Project Management, Software Process, Project and Product Metrics, Risk Management, Software Quality Assurance; Statistical Quality Assurance - Software Reliability, Muse Model; Software Configuration Management; Software Testing; CASE (Computer Aided Software Engineering).

3 QUALITY ASSURANCE MODELS Total Hrs 9

Models for Quality Assurance-ISO-9000 - Series, CMM, SPICE, Malcolm Baldrige Award.

4 SOFTWARE QUALITY ASSURANCE RELATED TOPICS

Total Hrs 9

Software Process - Definition and implementation; internal Auditing and Assessments; Software testing -Concepts, Tools, Reviews, Inspections & Walkthroughts; P-CMM.

5 FUTURE TRENDS Total Hrs 9

PSP and TSP, CMMI, OO Methodology, Clean-room software engineering, Defect injection and prevention.


Text Book

1 Software Quality Produceing Practical Consistent software, Mordechai Ben-Menachem/Garry S.Marlies, Thomson Learning Publication.

Reference(s):

1 Watts Humphery, “Managing Software Process ", Addison - Wesley, 1998.

2 Philip B Crosby, " Quality is Free: The Art of Making Quality Certain ", Mass Market, 1992.

3 Roger Pressman, “Software Engineering ", Sixth Edition, McGraw Hill, 2005.






ELECTIVE


L T P C CA ES Total

07360365E NEURAL NETWORKS AND ITS APPLICATIONS

3 0 0 3 50 50 100

Objective(s) To understand the basic algorithms of neural networks and basic functions of neural network and study about the applications of neural networks.

1 BASIC LEARNING ALGORITHMS Total Hrs 8

Biological Neuron – Artificial Neural Model– Architecture: Feed forward and Feedback – Salient properties and application domains of neural networks-Learning Process: Error Correction Learning – Supervised and Unsupervised Learning – Learning Tasks: Pattern Space – Weight Space – Perceptron Learning Algorithm – Perceptron Convergence Theorem – α-Least Mean Square Learning Algorithm – Multilayered network Architectures– Back Propagation Algorithm –Limitations of Back Propagation Algorithm.

2 RADIAL-BASIS FUNCTION NETWORKS AND SUPPORT VECTOR MACHINES

Total Hrs 10

Radial Basis Function Networks - Regularization Theory – Generalized Radial Basis Function Networks - Learning in RBFN‟s - Image Classification – Other models for valid generation – Learning from examples and generalization – Statistical learning theory briefer - Support Vector Machine – Baye‟s Theorem – Implementing classification decisions with Baye‟s Theorem.

3 NEURODYNAMICS SYSTEMS AND ADAPTIVE RESONANCE THEORY

Total Hrs 9

Dynamical Systems – Attractors and Stability – Non-linear Dynamical Systems- Lyapunov Stability – Neurodynamical Systems – The Cohen-Grossberg Theorem - Noise-Saturation Dilemma - Solving Noise-Saturation Dilemma – Recurrent On-center –Off-surround Networks – Building Blocks of Adaptive Resonance – Substrate of Resonance Structural Details of Resonance Model – Adaptive Resonance Theory – Applications.

4 ATTRACTOR NEURAL NETWORKS Total Hrs 9

Associative Learning – Attractor Neural Network Associative Memory – Linear Associative Memory – Hopfield Network – Content Addressable Memory – Error Performance of Hopfield Networks - Applications of Hopfield Networks – Simulated Annealing – Boltzmann Machine – Bidirectional Associative Memory – BAM Stability Analysis – Error Correction in BAMs - Memory Annihilation of Structured Maps in BAMS – Continuous BAMs – Adaptive BAMs – Applications.

5 SELF ORGANISING MAPS Total Hrs 9

Self-organizing Map – Maximal Eigenvector Filtering – Sanger‟s Rule – Generalized Learning Law – Competitive Learning - Vector Quantization – Mexican Hat Networks - Self-organizing Feature Maps – Applications –Introduce – spiking neuron model – Integrated & Fire neurons – conductance based models – Computing with spiking neurons – reflections.


Text book (s) :

1 Satish Kumar, “Neural Networks: A Classroom Approach”, Tata McGraw-Hill Publishing Company Limited, New Delhi 2004.

Reference(s):

1 James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and Programming Techniques, Pearson Education (Singapore) Private Limited, Delhi, 2003.

2 Simon Haykin, “Neural Networks: A Comprehensive Foundation”, 2ed., Addison Wesley Longman (Singapore) Private Limited, Delhi, 2001.

3 Martin T.Hagan, Howard B. Demuth, and Mark Beale, “Neural Network Design”, Thomson Learning, New Delhi, 2003.






Elective


L T P C CA ES Total

07360366E MOBILE COMPUTING 3 0 0 3 50 50 100

Objective(s) Students able to learn and improve the knowledge about the concepts of wireless networks


Medium Access Control : Motivation for Specialized MAC- SDMA- FDMA- TDMA- CDMA- Comparison of Access mechanisms – Tele communications : GSM- DECT- TETRA – UMTS- IMT-200 – Satellite Systems: Basics- Routing- Localization- Handover- Broadcast Systems: Overview – Cyclic Repetition of Data- Digital Audio Broadcasting – Digital Video Broadcasting.

2 WIRELESS NETWORKS Total Hrs 9

Wireless LAN: Infrared Vs Radio Transmission – Infrastructure Networks- Ad hoc Networks- IEEE 802.11 – HIPERLAN – Bluetooth- Wireless ATM: Working Group- Services- Reference Model – Functions – Radio Access Layer – Handover- Location Management- Addressing Mobile Quality of Service- Access Point Control Protocol.

3 MOBILE NETWORK LAYER Total Hrs 9

Mobile IP : Goals – Assumptions and Requirement – Entities – IP packet Delivery- Agent Advertisement and Discovery – Registration – Tunneling and Encapsulation – Optimization – Reverse Tunneling – IPv6 – DHCP- Ad hoc Networks.

4 MOBILE TRANSPORT LAYER Total Hrs 9

Traditional TCP- Indirect TCP- Snooping TCP- Mobile TCP- Fast retransmit/ Fast Recovery- Transmission/ Timeout Freezing – Selective Retransmission- Transaction Oriented TCP.

5 WAP Total Hrs 9

Architecture – Datagram Protocol- Transport Layer Security- Transaction Protocol- Session Protocol- Application Environment-Wireless Telephony Application.


Text book (s) :

1 J.Schiller, Mobile Communication, Addison Wesley, 2000.

Reference(s):

1 William Stallings, Wireless Communication and Networks, Pearson Education, 2003.

2 Singhal, WAP-Wireless Application Protocol, Pearson Education, 2003.

3 Lother Merk, Martin. S. Nicklaus and Thomas Stober, Principles of Mobile Computing, Second Edition, Springer, 2003.






Elective


L T P C CA ES Total

07360371E SOFTWARE PROJECT MANAGEMENT

3 0 0 3 50 50 100

Objective(s) To discuss in detail the software management discipline, the Software Management Process and to evaluate the case studies.


Conventional Software Management – Evolution of Software Economics – Improving Software Economics – Conventional versus Modern Software Project Management.

2 SOFTWARE MANAGEMENT PROCESS FRAMEWORK

Total Hrs 9

Lifecycle Phases – Artifacts of the Process – Model Based Software Architectures – Workflows of the Process – Checkpoints of the Process.

3 SOFTWARE MANAGEMENT DISCIPLINES Total Hrs 9

Iterative Process Planning - Organisation and Responsibilities – Process Automation – Process Control and Process Instrumentation – Tailoring the Process.

4 MANAGED AND OPTIMIZED PROCESS Total Hrs 9

Data Gathering and Analysis: Principles of Data Gathering, Data Gathering Process, Software Measures, Data Analysis - Managing Software Quality – Defect Prevention.

5 CASE STUDIES Total Hrs 9

COCOMO Cost Estimation Model – Change Metrics – CCPDS-R.


Text Books

1 Walker Royce “Software Project Management – A Unified Framework “, Pearson Education, 2004 (Unit I, II, III & V)

2 Humphrey, Watts: “Managing the software process ", Addison Wesley, 1989. (Unit IV)

Reference(s):

3 Ramesh Gopalaswamy, “Managing Global Projects”, Tata McGraw Hill, 2001.

4 Bob Hughes, Mikecotterell, “Software Project Management”,3rd

Edition, Tata McGraw Hill, 2004.






Elective


L T P C CA ES Total

07360372E SOFTWARE TESTING 3 0 0 3 50 50 100

Objective(s) To have the knowledge about the testing strategies and different testing tools and Methodologies.


software testing – role of software testing – a structural approach to testing – test strategy

methods for developing test strategy testing methodologies.

2 LIFE CYCLE TESTING APPROACH Total Hrs 9

Test plan – Requirements testing – Walk through test tool – Risk matrix test tool – Testing for requirements phase and design phase – Design renew test tool – Test data and volume test tools.

3 INSTALLATION Total Hrs 9

Installation phase testing – Tools for acceptance test – Software acceptance process – Software maintenance – Methodologies for testing – Training and change installation.

4 TESTING METHODS Total Hrs 9

Tools and techniques – Cost estimate – For testing – Testing phase of life cycle – Point accumulation tracking system – Performance analysis of testing – Inspection plan and test plan documents.

5 TESTING STRATEGY Total Hrs 9

Rapid prototyping – Spiral testing – Tool selection processes – Structural system testing – Documentation of test results – Test effectiveness evaluation – Test measurement process – Test metrics.


Text book (s) :

1 R Ron Patton, “Software Testing”, Techmedia.

Reference Books

1 William Perry, “Effective Methods for Software Testing”, John Wiley & Sons, USA, 1995.






Elective


L T P C CA ES Total

07360373E DIGITAL IMAGING 3 0 0 3 50 50 100

Objective(s)

Students have a study in image fundamentals and mathematical transforms necessary for image processing, the image enhancement techniques and also study about the image restoration procedures. Also study the image compression procedures and the image segmentation and representation techniques.

1 DIGITAL IMAGE FUNDAMENTALS AND TRANSFORMS Total Hrs 9

Elements of visual perception – Image sampling and quantization Basic relationship between pixels – Basic geometric transformations-Introduction to Fourier Transform and DFT – Properties of 2D Fourier Transform – FFT – Separable Image Transforms: Walsh – Hadamard – Discrete Cosine Transform, Haar, Slant – Karhunen – Loeve transforms.

2 IMAGE ENHANCEMENT TECHNIQUES Total Hrs 9

Spatial Domain methods: Basic grey level transformation – Histogram equalization – Image subtraction – Image averaging –Spatial filtering: Smoothing filters, sharpening filters – Laplacian filters – Frequency domain filters : Smoothing – Sharpening filters – Homomorphic filtering

3 IMAGE RESTORATION Total Hrs 9

Model of Image Degradation/restoration process – Noise models – Inverse filtering -Least mean square filtering – Constrained least mean square filtering – Blind image restoration – Pseudo inverse – Singular value decomposition.

4 IMAGE COMPRESSION Total Hrs 9

Lossless compression: Variable length coding – LZW coding – Bit plane coding- predictive coding-DPCM. Lossy Compression: Transform coding – Wavelet coding – Basics of Image compression standards: JPEG, MPEG,Basics of Vector quantization

5 IMAGE SEGMENTATION AND REPRESENTATION Total Hrs 9

Edge detection – Thresholding - Region Based segmentation – Boundary representation schemes: chain codes- Polygonal approximation – Boundary segments – boundary descriptors: Simple descriptors-Fourier descriptors - Regional descriptors: Simple descriptors- Texture.


Text book (s) :

1 Rafael C Gonzalez, Richard E Woods 2nd Edition, Digital Image Processing - Pearson Education 2003.

Reference(s):

1 William K Pratt, Digital Image Processing John Willey (2001).

2 Image Processing Analysis and Machine Vision – Millman Sonka, Vaclav hlavac, Roger Boyle, Broos/colic, Thompson Learniy (1999).

3 A.K. Jain, PHI, New Delhi (1995)-Fundamentals of Digital Image Processing.

4 Chanda Dutta Magundar – Digital Image Processing and Applications, Prentice Hall of India, 2000.






Elective


L T P C CA ES Total

07360374E MULTIMEDIA SYSTEMS 3 0 0 3 50 50 100

Objective(s) learn multimedia systems and its applications deeply


Multimedia applications - System architecture - Objects of Multimedia Systems -Multimedia databases

2 COMPRESSION AND FILE FORMATS Total Hrs 9

Types of compression - Image compression - CCITT - JPEG - Video image compression - MPEG-DVI Technology - Audio compression - RTF format - TIFF file format - RIFF file format - MIDI - JPEG DIB -TWAIN.

3 INPUT/OUTPUT TECHNOLOGIES Total Hrs 9

Traditional devices - Pen input - Video display systems - Scanners - Digital audio - Video images and animation.

4 STORAGE AND RETRIEVAL Total Hrs 9

Magnetic Media - RAID - Optical media - CD-ROM - WORM - Juke box - Cache management.

5 APPLICATION DESIGN Total Hrs 9

Application classes - Types of systems - Virtual reality design - Components - Databases - Authoring Systems - Hyper media - User interface design - Display/Playback issues - Hypermedia linking and embedding.


Text book (s) :

1 Andleigh PK and Thakrar K, Multimedia Systems Design, Prentice Hall, 1996.

Reference(s):

1 Vaughan T, Multimedia, Tata McGraw Hill, 1999.

2 Koegel Buford JFK, Multimedia Systems, Addison Wesley Longman, 1999.

3 Mark J.B., Sandra K.M., Multimedia Applications Development using DVI technology, McGraw Hill, 1992.






Elective


L T P C CA ES Total

07360375E ADVANCED NETWORKS 3 0 0 3 50 50 100

Objective(s) Provide advanced topics on current and emerging high performance LAN and WAN technologies. Introduce Network simulation to encourage Research Development. student ability to communicate technical knowledge.


Introduction to LAN Concepts - TCP/IP Suite – Protocols - Transmission Media - Protocols. LAN Technology: Ethernet 802.3, CSMA/CD – VLAN –FDDI.

2 NETWORK DEVICES Total Hrs 9

Inter - connecting Devices: Bridge – Switches - Router, Fibre Channel - Storage Area Networks - Framing Protocol.

3 WIRELESS NETWORKS Total Hrs 9

WLAN – WIFI – WIMAX - Mobile IP

4 HIGH SPEED NETWORKS Total Hrs 9

ATM LANS – DSL – SONET- MPLS

5 VOICE – DATA AND SIMULATION NETWORKS Total Hrs 9

VOIP – VPN – SNMP - Networking Simulation and modeling Techniques with OPNET Software.


Text book (s) :

1 William Stallings, Local & Metropolitan Area Network, 6

th Edition, Prentice Hall, 2000 (ISBN : 0-13-

012939-0).

2

Jonathan Davidson, James Peters Manoj Bhatia, Satish Kalidindi and Sudipto Mukherjee.

3 Kevin Brown and Leunn Christianson, OPNET Lab Manual 5 Accompany Data and Computer Communications (7

th Edition), Pearson Prentice Hall, 2005 (ISBN : 0-13-148252-1).

Reference Book

1 Jefferey G.Andrews, Arunabha Ghosh, Rias Mohamed, Fundamental of WIMAX Prentice Hall.

2 Clint Smith, John meyer, BG Wireless with Wimax and WI-FI, Tata Mc Graw Hill.

3 Data Communication and Networking, Behroz A.Forovzan, Tata McGraw Hill, 2007.






Elective


L T P C CA ES Total

07360376E COMPONENT BASED TECHNOLOGY

3 0 0 3 50 50 100

Objective(s) Introduces in depth JAVA, Corba and .Net Components and Deals with Fundamental properties of components, technology and architecture and middleware.

1 BASIC CONCEPTS Total Hrs 9

Software Components – objects – modules – interfaces – callbacks – directory services – component architecture – components and middleware.

2 JAVA BASED COMPONENT TECHNOLOGIES Total Hrs 9

Threads – Java Beans – Events and connections – properties – introspection – JAR files – reflection – object serialization – Enterprise Java Beans – Distributed Object models – RMI.

3 CORBA COMPONENT TECHNOLOGIES Total Hrs 9

Java and CORBA – Interface Definition language – Object Request Broker – system object model – portable object adapter – CORBA services – CORBA component model – containers – application server – model driven architecture.

4 . NET BASED COMPONENT TECHNOLOGIES Total Hrs 9

COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces – connectable objects – OLE containers and servers – Active X controls – .NET components - assemblies – appdomains – contexts – reflection – remoting.

5 COMPONENT FRAMEWORKS AND DEVELOPMENT Total Hrs 9

Connectors – contexts – EJB containers – CLR contexts and channels – Black Box component framework – directory objects – cross-development environment – component-oriented programming – Component design and implementation tools – testing tools - assembly tools.


Text book (s) :

1. Clemens Szyperski, “Component Software: Beyond Object-Oriented Programming”, Pearson Education publishers, 2002.

Reference(s):

1 Ed Roman, “Mastering Enterprise Java Beans”, John Wiley & Sons Inc., 1999.

2 “Mowbray, “Inside CORBA”, Pearson Education, 2003.

3 Freeze, “Visual Basic Development Guide for COM & COM+”, BPB Publication, 2001.

4 Hortsamann, Cornell, “CORE JAVA Vol-II” Sun Press, 2002.