COURSE STRUCTURE & SYLLABUS

M.TECH PROGRAMME in

COMPUTER SCIENCE ENGINEERING

DEPARTMENT OF CSE

CENTURION UNIVERSITY OF TECHNOLOGY

MANAGEMENT, ODISHA

COURSE STRUCTURE OF M.TECH (Computer Science) (2 Years)

First semester Second Semester

Code Subject L-T-P Credits Code Subject L-T-P Credits

MTCO

1101

Analysis and Design of

Algorithm

3-1-0 4 MTCO

1201

Formal Language &

Automata Theory

3-1-0 4

MTCO

1102

Discrete Mathematical

Structures

3-1-0 4 MTCO

1202

Artificial Intelligence 3-1-0 4

MTCO

1103

Advanced Computer

Architecture

3-1-0 4 MTCO

1203

Object Oriented System 3-1-0 4

Elective---1 3-1-0 4 Elective --- 3 3-1-0 4

Elective---2 3-1-0 4 Elective --- 4 3-1-0 4

( Any TWO of the following subjects) ( Any TWO of the following subjects)

COPE 1101 Embedded Systems

3-1-0 4

COPE 1201 Data Warehousing and

Data Mining

COPE 1102 Software Testing COPE 1202 Compiler Design

COPE 1103 Basic Digital Image

Processing COPE 1203 Pattern Recognition

COPE 1104 Real-Time Systems COPE 1204 Distributed Database

Systems

COPE 1105 Service Oriented

Architecture COPE 1205

Computational

Intelligence

COPE 1106 Software Quality

Assurance COPE 1206

Agent Based Intelligent

Systems

COPR 1107 Analysis and Design

of Algorithm Lab

0-0-3 2 COPR 1207

Software Technologies

Lab

0-0-3 2

COPT 1108 Seminar ( Pre-thesis

work)- 1

0-0-3 2 COPT 1208

Seminar ( Pre-thesis

work)-2

0-0-3 2

Semester credits 24

Semester credits 24

THIRD SEMESTER FOURTH SEMESTER

CODE SUBJECT L-T-P Credits CODE SUBJECT L-T-P Credits

MTCO

2101 Web Technologies

3-1-0 4 COPT

2201

Thesis / Project

(Part-2)

20

Elective --- 5 3-1-0 4

( Any ONE of the following subjects)

COPE 2101 Enterprise Resource

Planning

COPE 2102 Cryptography

COPE 2103 VLSI Design

COPE 2104 Multimedia Systems 3-1-0

COPT 2107 Thesis / project

(Part-1)

10

COPR 2108 Web Technologies Lab 0-0-3 2

COCV 2109 Comprehensive viva 2

Semester credits 22 Semester credits 20

TOTAL CUMULATIVE CREDITS ( 4 SEMESTERS) ------------ 90

SEMESTER -1

Analysis and Design of Algorithm

UNIT-1 (12 Hrs) Algorithm paradigms, Asymptotic notations, Recurrences, Divide and conquer (Merge sort, Heap sort, Quick sort and its correctness proofs) Lower bounds of sorting, Counting sort. UNIT-II (12 hrs) Randomization (Randomization quick sort, Primality testing), Dynamic Programming (Floyd-Warshall Algorithm, Longest Common Subsequence, Matrix chain multiplication), Greedy Method (Single source shortest path, M, Knapsack problem, Minimum cost spanning trees, Task scheduling), UNIT- III (16 hrs) Polynomial time, Polynomial-time verification, NP completeness and reducibility, NP completeness proofs,, Cook’s theorem, NP complete problem Geometric algorithms (range searching, convex hulls, segment intersections, closest pairs), Numerical algorithms (integer, matrix and polynomial multiplication, FFT, extended Euclid’s algorithm), Internet algorithm (text pattern matching, tries, Ukonnen’s algorithm). Books: 1. Michael Goodrich and Roberto Tamassia, “Algorithm Design”, John Wiley & Sons, 2002. 2. Mark Allen Weiss, “Data Structures & Algorithm Analysis in C/C++”, Pearson Edu. India. 3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, “ Introduction to Algorithms”, PHI.

4. Horowitz, Sahni, Rajasekaran, “Fundamentals of Computer Algorithms”, Galgotia publ., 1999.

DISCRETE MATHEMATICAL STRUCTURES

Module-I (12 hrs)

The Foundations: Logic and Proof and Functions

Logic, Propositional Equivalences, Predicates & Quantifiers, Nested Quantifiers, Methods of proof,

Functions, Proof Strategy, Mathematical Induction, Recursive Definition & Structural induction.

Module-II(12 hrs)

Counting

The Basic of Counting, The pigeonhole Principle, Permutation & Combinations, Binomial Coefficients.

Advanced Counting Techniques

Recurrence Relations, Solving Recurrence Relations, Divide & Conquer Algorithms, Generating

Functions, Inclusion-Exclusion, Applications of Inclusion-Exclusion.

Module-III(16 hrs)

Graphs

Introduction to Graphs, Graph Terminology, Representing Graph & Graph Isomorphism, Connectivity,

Euler & Hamiltonian Paths, Shortest-Path Problems.

Trees

Introduction to Trees, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees

Boolean Algebra

Boolean Functions, Representing Boolean Functions, Lattice as Partially Ordered Sets, Boolean Algebra,

Finite State Machines.

BOOKS:-

1. Discrete Mathematics & Its Applications by Kenneth H. Rosen. TMH

2. Discrete Mathematics for Computer Science & Mathematicians by Joe L. Mott, Abraham Kandel

& Theodore P. Baker. PHI

3. Discrete Mathematical Structures with Applications to Computer Science by J.P.Tremblay &

R.Manohar. McGraw-Hill Book Company.

ADVANCED COMPUTER ARCHITECTURE

Module-I(12 hrs) Introduction: Review of basic computer architecture, quantitative techniques in computer design, measuring and reporting performance; CISC and RISC processors, Pipelining: Basic concepts, instructions and arithmetic pipeline, data hazards, control hazards and structural hazards, techniques for handling hazards, Exception handling, pipeline optimization techniques; Module-II(12 hrs) Hierarchical memory technology: Inclusion, Coherence and locality properties, cache memory organizations, techniques for reducing cache misses, virtual memory organization, mapping and management techniques, memory replacement policies; Module-III(16 hrs) Instruction-level parallelism: basic concepts, techniques for increasing ILP, super-scalar, super-pipelined and VLIW processor architectures, array and vector processors; Multiprocessor architecture: Taxonomy of parallel architectures; Centralized shared-memory architecture: Synchronization, memory consistency, interconnections networks, Distributed shared-memory architecture, cluster computers. Books: 1. Henessy and Patterson, “Computer Architecture—A Quantitative Approach”, Pearson press, 3rd

Edition, 2003. 2. K.Hwang and F.A.Briggs, “Computer Architecture and Parallel Processing”, Mc-Graw Hill, 1984. 3. Kai Hwang, “Advanced Computer Architecture: Parallelism, Scalability, programmability”, Mc-Graw Hill, 4. M.Singhal and N.G.Sivaratri, “Advanced concepts of Operating Systems”, Tata-Mc-Graw Hill

Publication, 2001. 5. Crowley, “Operating Systems”.

BASIC DIGITAL IMAGE PROCESSING

Module-I(15 hrs)

DIGITAL IMAGE FUNDAMENTALS

Image formation, Image transforms – Fourier transforms, Walsh, Hadamard, Discrete cosine, Hotelling

transforms.

IMAGE ENHANCEMENT & RESTORATION

Histogram modification techniques - Image smoothening - Image Sharpening - Image Restoration -

Degradation Model – Noise models - Spatial filtering – Frequency domain filtering.

Module-II(10 hrs)

IMAGE COMPRESSION & SEGMENTATION

Compression Models - Elements of information theory - Error free Compression -Image segmentation –

Detection of discontinuities - Edge linking and boundary detection - Thresholding – Region based

segmentation - Morphology.

Module-III(15 hrs)

REPRESENTATION AND DESCRIPTION

Representation schemes- Boundary descriptors- Regional descriptors - Relational Descriptors

OBJECT RECOGNITION AND INTERPRETATION

Patterns and pattern classes - Decision-Theoretic methods - Structural methods.

REFERENCE BOOKS:

1. Gonzalez.R.C & Woods. R.E., Digital Image Processing, 2nd

Edition, Pearson Education, 2002. 2. Anil Jain.K, Fundamentals of Digital image Processing, Prentice Hall of India, 1989. 3. Sid Ahmed, Image Processing, McGraw Hill, New York, 1995.

Formal Language and Automata Theory

Module-I(14 hrs)

FINITE AUTOMATA AND REGULAR LANGUAGES

Finite Automata and Regular languages - Regular expressions and Regular languages –non determinism

and Kleenes theorem, Equivalence of DFA and NFA, Finite Automation with e-moves, equivalence of

regular expression and NFA with e-moves – pumping lemma for regular sets.

CONTEXT FREE LANGUAGES

Context free languages, Derivation and languages, Relationship between derivation and derivation trees,

Simplification of context free grammars – Normal forms for context free grammars, CNF, and GNF.

Module-II(15 hrs)

PUSH DOWN AUTOMATA (PDA)

Acceptance by PDA, Pushdown automata and Context free languages, Pumping lemma for CFL,

deterministic Context free languages and Deterministic pushdown automata.

TURING MACHINE

Context sensitive languages and LBA, Turing machine (Definition and examples), Computable languages

and functions, Church Turing hypothesis, Universal Turing machine, P and NP problems, NP-complete.

Module-III(11 hrs)

UNSOLVABLE PROBLEMS

Unsolvable problems - Rice Theorem - Post's correspondence Problem, Recursive and recursively

enumerable languages.

REFERENCE BOOKS:

1. Hopcroft and Ullman, Introduction to Automata, Languages and Computation, Pearson Education, 2

nd Edition, 2006

2. A. M. Natarajan, A. Tamilarasi & P. Balasubramani, “Theory of Computation”, New age International publishers, 2002

3. John.C.Martin, Introduction to languages and the Theory of Computation, 2nd

Edition, McGraw Hill,1997

4. K.L.P.Mishra, N.Chandrasekaran, Theory of Computation, EEE, Prentice Hall of India, 3rd

Edition, 2007.

5. Peter Linz, “An Introduction to formal languages and Automata, Narosa Publishing House, 3rd

Edition, 2001.

6. Harry R. Lewis, Christos H. Papadimitriou, “Elements of Theory of Computation, Prentice Hall, 2002.

ARTIFICIAL INTELLIGENCE

Module 1 15Hrs

What is Artificial Intelligence? AI Technique, Level of the Model, Problem Spaces, and Search: Defining

the Problem as a State Space Search, Production Systems, Problem Characteristics, Production System

Characteristics, Issues in the Design of Search Programs. Heuristic Search Techniques: Generate-and-

Test, Hill Climbing, Best-first Search, Problem Reduction, Constraint Satisfaction, Means-ends Analysis,

Knowledge Representation: Representations and Mappings, Approaches to Knowledge

Representation, Using Predicate Logic: Representing Simple Facts in Logic, Representing Instance and

ISA Relationships, Computable Functions and Predicates, Resolution, Natural Deduction. Using Rules:

Procedural Versus Declarative Knowledge, Logic Programming, Forward Versus Backward Reasoning,

Matching, Control Knowledge.Symbolic Reasoning Under Uncertainty: Introduction to Nonmonotonic

Reasoning, Logics for Nonmonotonic Reasoning, Implementation Issues, Augmenting a Problem-solver,

Depth-first Search, Breadth-first Search.Weak and Strong Slot-and-Filler Structures: Semantic Nets,

Frames, Conceptual DependencyScripts, CYC.

Module 2 15Hrs Game Playing: The Minimax Search Procedure, Adding Alpha-beta Cutoffs, Iterative

Deepening.Planning: The Blocks World, Components of a Planning System, Goal Stack Planning,

Nonlinear Planning Using Constraint Posting, Hierarchical PlanningOther Planning

Techniques.Understanding: What is Understanding, What Makes Understanding Hard?, Understanding

as Constraint Satisfaction.Natural Language Processing: Introduction, Syntactic Processing, Semantic

Analysis, Discourse and Pragmatic Processing, Statistical Natural Language Processing, Spell Checking.

Module 3 10Hrs

Learning: Rote Learning, Learning by Taking Advice, Learning in Problem-solving, Learning from

Examples: Induction, Explanation-based Learning, Discovery, Analogy, Formal Learning Theory, Neural

Net Learning and Genetic Learning. Expert Systems: Representing and Using Domain Knowledge,

Expert System Shells, Explanation, Knowledge Acquisition.

Text Book:

1. Elaine Rich, Kevin Knight, & Shivashankar B Nair, Artificial Intelligence, McGraw Hill, 3rd ed.,2009 References:

1) Introduction to Artificial Intelligence & Expert Systems, Dan W Patterson, PHI.,2010 2) S Kaushik, Artificial Intelligence, Cengage Learning, 1st ed.2011

OBJECT ORIENTED SYSTEM

UNIT-1(10 hrs)

Real world domains, object oriented approach and technology, objects instances and concepts, Objects

and classes of objects, generalized object oriented software, Development cycle, Object oriented

programming language, object-oriented analysis of a real world domain object model. The notation of

encapsulation and information hiding, object identity: entity and attributes, data and knowledge: The

notion of inheritance, Relationship between objects: Association, Generalization/ Specialization,

Aggregation, Object and States, Dynamic behavior of objects.

UNIT-II (8 hrs) Object-Oriented analysis: introduction, Techniques for information gathering for RA, use case driven object oriented analysis, concepts and principles, identifying the elements of an object model, Management of Object-Oriented Software projects, Object oriented analysis, domain analysis and generic components of object- oriented analysis model, object behavior model.

The intent of object-oriented metrics, the distinguishing characteristics and metrics for the object-oriented

design model, class oriented metrics, operation oriented metrics, metrics for object oriented testing,

metrics for object-oriented projects.

UNIT-III (10 hrs) Introduction to UML : The meaning of object-orientation, object identity, encapsulation, information hiding, polymorphism, genericity, importance of modeling, principles of modeling, object oriented modeling, conceptual modeling of the UML, Architecture. Basic structural modeling : classes, relationships, common mechanisms, diagrams, advanced structural modeling : advanced relationship interfaces, roles, packages, instances. UNIT-IV (12 hrs) Class & object diagrams: Terms, concepts, examples, modeling techniques, class & object diagrams. Collaboration Diagrams: Terms, Concepts, depicting a message, polymorphism in collaboration diagrams, iterated messages, use of self in messages. Sequence diagrams: Terms, concepts, differences between collaboration and sequence diagrams, depicting synchronous messages with/without priority call back mechanism broadcast message. Behavioral modeling: interactions, use cases, use case diagrams, activity diagrams. Advanced Behavioral modeling: Events and signals, state machines, process and threads, time and space, state chart diagram. Architectural Modeling: Terms, concepts, examples, modeling techniques for component diagrams and deployment diagram Suggested Reading:

1. Grady Boach, James Rambaugh, Ivar Jacobson : The unified modeling language user gude, Addison wesey.

2. Mieiar Page-jones : fundamentals of object oriented design in UML, Addison Wesley, 2000 3. Larmen

Real Time Systems UNIT-1 [14Hrs] Introduction: What is real time, Applications of Real-Time systems, A basic model of Real-time system, Characteistics of Real-time system, Safety and Reliability, Types of Real-time tasks, timing constraints, Modelling timing constraints Real-Time Task Scheduling: Some important concepts, Types of Real-time tasks and their characteristics, Task scheduling, Clock-Driven scheduling, Hybrid schedulers, Event-Driven scheduling, Earliest Deadline First (EDF) scheduling, Rate monotonic algorithm (RMA). Some issues Associated with RMA. Issues in using RMA practical situations. UNIT-2 [14Hrs] Handling Resource Sharing and dependencies among Real-time Tasks: Resource sharing among real-time tasks. Priority inversion. Priority Inheritance Protocol (PIP), Highest Locker Protocol (HLP). Priority Ceiling Protocol (PCP). Different types of priority inversions under PCP. Important features of PCP. Some issues in using a resource sharing protocol. Handling task dependencies. Scheduling Real-time tasks in multiprocessor and distributed systems: Multiprocessor task allocation, Dynamic allocation of tasks. Fault tolerant scheduling of tasks. Clock in distributed Real-time systems, Centralized clock synchronization UNIT-3 [12Hrs] Commercial Real-time operating systems: Time services, Features of a Real-time operating system, Unix as a Real-time operating system, Unix-based Real-time operating systems, Windows as a Real-time

operating system, POSIX, A survey of contemporary Real-time operating systems. Benchmarking real-time systems. Real-time Databases: Example applications of Real-time databases. Review of basic database concepts, Real-time databases, Characteristics of temporal data. Concurrency control in real-time databases. Commercial real-time databases. Real-time Communication: Examples of applications requiring real-time communication, Basic concepts, Real-time communication in a LAN. Soft Real-time communication in a LAN. Hard real-time communication in a LAN. Bounded access protocols for LANs. Performance comparison, Real-time communication over packet switched networks. Qos framework, Routing, Resource reservation, Rate control, Qos models. Books:

1. Real-time Systems Theory and Practice by Rajib Mall, Pearsons Publication.

SERVICE ORIENTED ARCHITECTURE

Module-I(14 hrs)

INTRODUCTION TO SOA WITH WEB SERVICES

The service-oriented enterprise – Service oriented development – Service abstraction – Service-oriented architecture – SOA and web services – Rapid integration – Multi-channel access – Occasionally connected computing – Business Process Management – Extended Web Services Specifications.- Service Oriented architecture concepts – Service governance, processes , guidelines, principles, methods and tools – Key Service characteristics – Technical benefits of a service-oriented architecture – Service-oriented architecture – Benefits

SOA AND WEB SERVICES

The web services platform – Service contracts – Service-level data model – Service discovery-registration and lookup – Service-level security – Service level interaction patterns – Atomic services and composite services – Generating proxies and skeletons and service contracts – Service-level communication and alternative transports – A Retrospective on Service-oriented architectures- Overview of integration – Integration and Interoperability using XML and web services

Module-II(14 hrs)

SOA AND MULTI-CHANNEL ACCESS

Business benefits of SOA and multi-channel access – Architectural challenges – Client / presentation tier

– Channel access tier – Communication Infrastructure – Business Service Access tier – Business

Services tier – examples.

SOA AND BUSINESS PROCESS MANAGEMENT

Basic Business process management concepts – examples – combining BPM,SOA, and web services –

Orchestration and Choreography specification - examples - web services.

META DATA MANAGEMENT

the simple approach to metadata management – Metadata specification – Policy – WS-Metadata

exchange.

Module-III(12 hrs)

WEB SERVICES SECURITY

Overarching concern – core concepts – summary of challenges, threats and remedies – securing the communication layer – overview of message-level security – data-level security.

TRANSACTION PROCESSING

Overview – the transaction paradigm – impact of web services on transactions - protocols and

coordination – transaction and specification

REFERENCES

1. Eric Newcomer and Greg Lomow, “Understanding SOA with Web Services”, Pearson Education India, First reprint, New Delhi, 2005.

2. Barry, Douglas K. ”Web services and Service oriented architectures”, The Savvy Manager’s Guide. Morgan Kaufmann,2003.

3. Bernstein ,Philip A. and Eric Newcomer. ”Principles of transaction processing.”, Morgan Kaufmann,1997.

4. Chatterjee, Sandeep and James Webber,”Developing Enterprise Web Services: An Architect’s guide.” Upper Saddle River, NJ: Prentise Hall PTR, 2004.

Computational Intelligence Module-I(12 Hrs)

Introduction to Soft Computing: Soft computing constituents and conventional Artificial Intelligence, Neuro-Fuzzy and Soft Computing characteristics. Fuzzy Sets, Fuzzy Rules and Fuzzy Reasoning: Introduction, Basic definitions and terminology, Set-theoretic operations, MF Formulation and parameterization, More on fuzzy union, intersection, and complement, Extension principle and fuzzy relations, Fuzzy If-Then rules, Fuzzy reasoning. Fuzzy Inference System: Mamdani fuzzy models, Sugeno Fuzzy Models, Tsukamoto fuzzy models, other considerations. Least Square Method for system Identification: System Identification , Basic of matrix manipulations and calculus, Least-square estimator, Geometric interpretation of LSE, Recursive least-square estimator, Recursive LSE for time varying systems, Statistical Properties and maximum likelihood estimator, LSE for nonlinear models. Module-II(14 hrs) Derivative-based optimization: Descent methods, the method of steepest descent, Newton’s methods, Step size determination, conjugate gradient methods, Analysis of quadratic case, nonlinear least-squares problems, Incorporation of stochastic mechanism. Derivative-free optimization: Genetic algorithm simulated annealing, random search, Downhill simplex search, Swarm Intelligence, genetic programming. Adaptive Networks: Architecture, Back propagation for feed forward networks, Extended back propagation for recurrent networks, Hybrid learning rule: combing steepest descent and LSE. Supervised learning neural networks: Perceptions, Adaline, Back propagation multi layer perceptions, Radial Basic Function networks.

Learning from reinforcement: Failure is the surest path to success, temporal difference learning, the art of dynamic programming, Adaptive heuristic critic, Q-learning, A cost path problem, World modeling, other network configurations, Reinforcement learning by evolutionary computations. Module-III(14 hrs) Unsupervised learning and other neural networks: Competitive learning networks, Kohonen self-organizing networks, learning vector quantization, Hebbian learning, principal component networks, and the Hopfield network. Adaptive Neuro-fuzzy inference systems: ANFIS architecture, Hybrid learning algorithms, Learning methods that cross-fertilize ANFIS and RBNF, ANFIS as universal approximator, Simulation examples, Extensions and advance topics.

Coactive Neuro-fuzzy modeling: towards generalized ANFIS: Framework, Neuro functions for adaptive networks, Neuro-Fuzzy spectrum, Analysis of adaptive learning capability.

Books: 1. J.S.R. Jng, C.T. Sun and E. Mizutani,”Neuro-fuzzy and Soft Computing”, PHI.

2. S. Rajasekaran, G.A. Vijaylakshmi Pai,:Neural Networks, Fuzzy Logic, and Genetic Algorithms,” PHI.

SOFTWARE QUALITY ASSURANCE

Module-I(12 Hrs)

CONCEPTS

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.

Module-II(14 hrs)

SOFTWARE ENGINEERING CONCEPTS

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).

QUALITY ASSURANCE MODELS

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

Module-III(14 Hrs)

SOFTWARE QUALITY ASSURANCE RELATED TOPICS

Software Process - Definition and implementation; internal Auditing and Assessments; Software testing -

Concepts, Tools, Reviews, Inspections & Walkthroughts; P-CMM.

FUTURE TRENDS

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

prevention.

REFERENCE BOOKS:

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.

DATA WAREHOUSING AND DATA MINING

Module-I(12 hrs)

INTRODUCTION:

Definition of Data Mining - Data Mining Vs Query Tools – Machine Learning –Taxonomy of Data Mining

Tasks – Steps in Data Mining Process – Overview of Data Mining techniques.

DATA WAREHOUSING:

Definition – Multidimensional Data Model – Data Cube – Dimension Modeling – OLAP Operations –

Warehouse Schema – Data Warehouse Architecture – Data Mart – Meta Data – Types of Meta Data –

Data Warehouse Backend Process – Development Life Cycle

Module-II( 20 Hrs)

DATA PRE-PROCESSING AND CHARACTERIZATION:

Data Cleaning – Data Integration and Transformation – Data Reduction – Discretization and Concept

Hierarchy Generation – Primitives – Data Mining Query Language – Generalization – Summarization –

Analytical Characterization and Comparison - Association Rule Mining - Multi Dimensional data from

Transactional Database

CLASSIFICATION AND ASSOCIATION:

Classification – Decision Tree Induction – Bayesian Classification – Prediction – Back Propagation –

Cluster Analysis – Hierarchical Method – Density Based Method – Grid Based Method – Outlier Analysis -

Basic Association Algorithms – Parallel and Distributed Algorithms – Advanced Association rule

algorithms

Module-III(8 hrs)

5. ADVANCED TOPICS: Web Mining – Web Content Mining – Structure and Usage Mining – Spatial Mining – Spatial Data Overview – Generalization and Specialization – Spatial Rules and Classification Algorithms – Spatial Clustering Algorithms – Temporal Mining

REFERENCES:

1. Jaiwei Han, Micheline Kamber, “Data Mining: Concepts and Techniques”, Morgan Kaufman

Amsterdam, 2001.

2. Margaret Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson Education, New

Delhi, 2005.

3. Paulraj Ponnaiah, “Data Warehousing Fundamentals”, Wiley Publishers, Singapore, 2001.

EMBEDDED SYSTEMS Module – I (12 Hours) Introduction: Features of Embedded systems, Design matrices, Embedded system design flow, SOC and VLSI circuit. ARM: An advanced Micro Controller, Brief history, ARM pipeline, Instruction Set Architecture ISA: Registers, Data Processing Instructions, Data Transfer Instructions, Multiplications instructions, Software interrupt, Conditional execution, branch instruction, Swap instruction, THUMB instructions. FPGA Module – II (12 Hours) Devices and device drivers, I/O devices, Serial peripheral interfaces, IIC, RS232C, RS422, RS485, Universal serial bus, USB Interface, USB Connector IrDA, CAN, Bluetooth, ISA, PCI, PCI – X and advance busses, Device drivers. Real time operating system: Hard real time, firm real time, soft real time, Task periodicity: periodic task, sporadic task, aperiodic task, task scheduling, scheduling algorithms: clock driven scheduling, event driven scheduling. Module – III (16 Hours) Software and programming concept: Processor selection for an embedded system, State chart, SDL, PetriNets, Unified Modeling Language (UML). Low power embedded system design: Dynamic power dissipation, Static power dissipation, Power reduction techniques, system level power management.

Hardware and software partitioning: K-L partitioning, Partitioning using genetic algorithm, particle swarm optimization, Functional partitioning and optimization: functional partitioning, high level optimizations. Hardware software co-simulations. Text Books:

1. “Embedded System Design ” by Santanu Chattopadhay, PHI 2. “Embedded system architecture, programming and design” By Raj Kamal, TMH

Reference Books: 1. “Hardware software co-design of Embedded systems” By Ralf Niemann, Kulwer Academic. 2. “Embedded real time system programming” By Sriram V Iyer, Pankaj Gupta, TMH.

WEB TECHNOLOGY

Module-I

INTRODUCTION

Introduction – Network concepts – Web concepts – Internet addresses - Retrieving Data with URL –

HTML – DHTML: Cascading Style Sheets - Scripting Languages: Javascript – Vbscript.

COMMON GATEWAY INTERFACE

Common Gateway Interface: Programming CGI Scripts – HTML Forms – Custom Database Query Scripts

– Server Side Includes – Server security issues – XML.

Module-II

JAVA PROGRAMMING

Java fundamentals: Classes – Inheritance – Packages – Interfaces – Exceptions Handling – Multi

threading – Applets

SERVER SIDE PROGRAMMING

Server side Programming – Active server pages – Java server pages – Java Servlets: Servlet container –

Exceptions – Sessions and Session Tracking – Using ServletContext – Dynamic Content Generation –

Servlet Chaining and Communications.

Module-III

APPLICATIONS

Simple applications – Internet Commerce – Database connectivity – Online databases – EDI Applications

in Business – Plug-ins – Firewalls

REFERENCE BOOKS:

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

asia, 2002

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

3. Elliotte Rusty Herold , “Java Network Programming”, O’Reilly Publications, 3rd

Edition, 2004.

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

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

MULTIMEDIA SYSTEMS

Module-I ( 15 hrs)

1. INTRODUCTION AND QOS Introduction-QOS

Requirements and Constraints-Concepts-Resources- Establishment Phase-Run-Time Phase-

Management Architectures.

OPERATING SYSTEMS

Real-Time Processing-Scheduling-Interprocess Communication-Memory and Management-Server

Architecture-Disk Management.

Module-II ( 9 hrs)

FILE SYSTEMS AND NETWORKS

Traditional and Multimedia File Systems-Caching Policy-Batching-Piggy backing-Ethernet-Gigabit

Ethernet-Token Ring-100VG AnyLAN-Fiber Distributed Data Interface (FDDI)- ATM Networks-MAN-WAN.

Module-III ( 16 hrs)

COMMUNICATION

Transport Subsystem-Protocol Support for QOS-Transport of Multimedia-Computer Supported

Cooperative Work-Architecture-Session Management-MBone Applications.

SYNCHRONIZATION

Synchronization in Multimedia Systems-Presentation-Synchronization Types-Multimedia Synchronization

Methods-Case Studies-MHEG-MODE-ACME.

REFERENCE BOOKS:

1. Ralf Steinmetz and Klara Nahrstedt, “Multimedia Systems”, Springer, I Edition 2004. 2. Ralf Steinmetz and Klara Nahrstedt , Media Coding and Content Processing, Prentice hall, 2002. 3. Vaughan T, Multimedia, Tata McGraw Hill, 1999. 4. Mark J.B., Sandra K.M., Multimedia Applications Development using DVI technology, McGraw Hill,

1992. 5. K. R. Rao, Zoran S. Bojkovic, Dragorad A. Milovacovic, D. A. Milovacovic , Multimedia

Communication Systems: Techniques, Standards, and Networks, Prentice Hall, 1st Edition, 2002

6. Ze-Nian Li and Mark S. Drew, Fundamentals of Multimedia, Pearson, 2004.

CRYPTOGRAPHY

Module-I(10 hrs) Introduction to Cryptography: Basics of Symmetric Key Cryptography, Basics of Assymetric Key Cryptography, Hardness of Functions. Notions of Semantic Security (SS) and Message Indistinguishability (MI): Proof of Equivalence of SS and MI, Hard Core Predicate, Trap-door permutation, Goldwasser-Micali Encryption. Goldreich-Levin Theorem: Relation between Hardcore Predicates and Trap-door permutations Module-II(15 hrs) Formal Notions of Attacks: Attacks under Message Indistinguishability: Chosen Plaintext Attack(IND-CPA), Chosen Ciphertext Attacks (IND-CCA1 and INDCCA2), Attacks under Message Non-malleability: NM-CPA and NM-CCA2, Interrelations among the attack model Random Oracles: Provable Security and asymmetric cryptography, hash functions One-way functions: Weak and Strong one way functions Pseudo-random Generators (PRG): Blum-Micali-Yao Construction, Construction of more powerful PRG, Relation between One-way functions and PRG, Pseudorandom Functions (PRF) Building a Pseudorandom Permutation: The Luby Rackoff Construction: Formal Definition, Application of the Luby Rackoff Construction to the construction of Block Ciphers, The DES in the light of Luby Rackoff Construction Left or Right Security (LOR) Module-III(15 hrs) Message Authentication Codes (MACs): Formal Definition of Weak and Strong MACs, Using a PRF as a MAC, Variable length MAC Public Key Signature Schemes: Formal Definitions, Signing and Verification, Formal Proofs of Security of Full Domain Hashing Assumptions for Public Key Signature Schemes: One way functions Imply Secure One-time Signatures Shamir's Secret Sharing Scheme Formally Analyzing Cryptographic Protocols Zero Knowledge Proofs and Protocols References: 1. Hans Delfs and Helmut Knebl, Introduction to Cryptography: Principles and Applications, Springer Verlag. 2. Wenbo Mao,Modern Cryptography,Theory & Practice, Pearson Edu. (Low Priced Ed.) 3. Shaffi Goldwasser and Mihir Bellare, Lecture Notes on Cryptography, Available at http://citeseerx.ist.psu.edu/. 4. Oded Goldreich, Foundations of Cryptography, CRC Press (Low Priced Edition Available), Part 1 and Part 2

5.M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web How to Program, 3rd

Ed, Pearson Education, 2004. REFERENCE BOOKS:

1. Y. Daniel Liang: Introduction to JAVA Programming, 6th

Edition, Pearson, 2007.

2. Chris Bates: Web Programming Building Internet Applications, 3rd

Edition, Wiley India, 2006. 3. Xue Bai et al: The Web Warrior Guide to Web Programming, Thomson, 2003.

Pattern Recognition Module-I (12 Hrs) Introduction to pattern recognition and applications to OCR, speech recognition, fingerprints, signatures etc. Commercial importance of applications. Introduction to Statistical, Neural and Structural Approaches. Statistical Pattern Recognition: Patterns and classification, discriminant functions, Bayes decision rule, nearest neighbour rule, probability of error. Linear discriminant functions: Perceptrons and training, LMSE approaches. Module-II (14 hrs)

Unsupervised learning and clustering. Feature extraction. Neural Approach: Introduction to artificial neural networks, feed forward networks, delta rule and back propagation, Hopfield networks and unsupervised learning, Adaptive resonance architectures, related techniques. Pattern associators and content addressable memories, hardware realizations. Module-III (14 hrs) Syntactic pattern recognition: Formal languages and grammars Pattern grammars and higher dimensional grammars, Parsing, automata realizations, stochastic grammars, Grammatical Inference, computational learning theory, Valiant"s framework. References:

1. R. J. Schalkoff, Pattern Recognition: Statistical, Structural and Neural Approaches, Wiley, 1992. 2.

2. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis, Wiley, New York, 1973.

3. L. Miclet, Structural Methods in Pattern Recognition North Oxford Academic, London, 1986.

ADVANCED DATABASES

Module-I(16 Hrs)

DATABASE MANAGEMENT

Relational Data Model – SQL - Database Design - Entity-Relationship Model – Relational Normalization –

Embedded SQL – Dynamic SQL – JDBC – ODBC.

ADVANCED DATABASES

Object Databases - Conceptual Object Data Model – XML and Web Data – XML Schema – Distributed

Data bases – OLAP and Data Mining – ROLAP and MOLAP

Module-II(8 Hrs)

QUERY AND TRANSACTION PROCESSING

Query Processing Basics – Heuristic Optimization – Cost, Size Estimation - Models of Transactions –

Architecture – Transaction Processing in a Centralized and Distributed System – TP Monitor.

Module-III(16 Hrs)

IMPLEMENTING AND ISOLATION

Schedules – Concurrency Control – Objects and Semantic Commutativity – Locking – Crash, Abort and

Media Failure – Recovery – Atomic Termination – Distributed Deadlock – Global Serialization –

Replicated Databases – Distributed Transactions in Real World.

DATABASE DESIGN ISSUES

Security – Encryption – Digital Signatures – Authorization – Authenticated RPC - Integrity - Consistency -

Database Tuning - Optimization and Research Issues.

REFERENCE BOOKS:

1. Philip M. Lewis, Arthur Bernstein, 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. Abraham Silberschatz, Henry. F. Korth, S.Sudharsan, Database System Concepts, 4

th Edition., Tata

McGraw Hill, 2004 4. Raghu Ramakrishnan & Johannes Gehrke, “Database Management Systems”, 3

rd Edition, TMH,

2003

DISTRIBUTED DATABASE SYSTEM

Module-I(12 hrs) Features of distributed databases, features of centralized databases, level of distributed transparency

– Reference Architecture, types of Data Fragmentation, distribution Transparency, Access primitives, Integrity constraints.

Distributed Database design – A frame work, the design of database fragmentation, the allocation of

fragments. Translation of global queries into fragment queries, query optimization. Module-II(14 hrs)

Distributed Transaction Management – A framework, transaction atomicity, 2-phase commit, concurrency control: fundations, distributed deadlocks, timestamps.

Reliability: Basic concepts, commit protocols, consistent view of Network, Detection and Resolution of

Inconsistencies, check points and cold restart. Module-III(14 hrs)

Commercial Systems: Tranclem’s ENCOMPASS Distributed database systems, IBM’s Inter system communication, feature of distributed ingres and Oracle.

Heterogeneous databases: General problems – brief study of multibase. Text Book:

Ceri S. Pelagatti. G, Distributed Database systems Principles and Systems, Mc Graw Hill.

VLSI Design

Module-I(14 hrs) Introduction to VLSI Design Methodologies, Full Custom Design, Semi Custom Design and Programmable design, VLSI Design Flow, Design Entry, Synthesis, Floorplanning, Place & Route, Timing analysis, Front – end design and Backend design. Front End Design: Introduction to high level design, Hardware Description Language. VHDL: Introduction, Behavioral Modeling, Sequential Processing, data types, Sub Program & packages, Attributes, Configurations. Synthesis: HDL (RTL description), Constraints, Technology Library, Synthesis: translation Boolean Optimization, Flattening, Factoring, Mapping gates. High level design flow. Synthesis tools : Synopsis. Module-II(12 hrs) Backend Design: Introduction to low level Design. MOS Structure: Band Diagram, NMOS, PMOS, CMOS digital logic gates, Inverters

Digital Design: Static Logic & Dynamic logic design styles. Analog Design: Differential Amplifiers, Current Mirrors, design of operational amplifiers. Introduction to SPICE (T_Spice) for circuit simulation VLSI Technology. Fabrication Process (NMOS & CMOS) Module-III(14 hrs) Wafer Preparation, Oxidation, Photo & Ion Lithography, Eatching, Diffusion, Ion implantation, Metalization. Layout diagram and Layout of Digital Circuits, Introduction to Layout generation tools. (VLSI Software: Tanner L- Edit), CIF & GDS –II formats. Design of Telecom Chips Introduction to VLSI Design modulators, Demodulators, Transiver ICS, coder & Decoders. Companies Involved in Communication chip design. Suggested text books and references 1) Application specific Integrated Circuits by Smith (For Unit –I) 2) VHDL by Douglas Perry, TMH Publication (for Unit-II) 3) VLSI Design & Techniques, Pucknell & Eshraghian, PHI (For Unit-III & Unit-V) 4) VLSI Technology, S. M. Size, Mc Graw Hill (For Unit-IV) 5) Resources from Internet : www.ti.com

MOBILE COMPUTING Module-I(12 Hrs)

INTRODUCTION

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

Module-II (14hrs)

WIRELESS NETWORKS

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

MOBILE NETWORK LAYER

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

Module-III(14 hrs)

MOBILE TRANSPORT LAYER

Traditional TCP- Indirect TCP- Snooping TCP- Mobile TCP- Fast retransmit/ Fast Recovery-

Transmission/ Timeout Freezing – Selective Retransmission- Transaction Oriented TCP

WAP

Architecture – Datagram Protocol- Transport Layer Security- Transaction Protocol- Session Protocol-

Application Environment-Wireless Telephony Application

REFERENCE BOOKS

1. J.Schiller, Mobile Communication, Addison Wesley, 2000. 2. William Stallings, Wireless Communication and Networks, Pearson Education, 2003. 3. Singhal, WAP-Wireless Application Protocol, Pearson Education, 2003 4. Lother Merk, Martin. S. Nicklaus and Thomas Stober, Principles of Mobile Computing, Second

Edition, Springer, 2003. 5. William C.Y.Lee, Mobile Communication Design Fundamentals, John Wiley, 1993.

WEB TECHNOLOGY LAB

1. Web Page Creation using HTML and DHTM and Client side Scripting Languages

2. Write a application/GUI program in java for getting time and data information from the server

using TCP/UDP

3. Develop web application with CGI validation.

4. Develop Multi-threaded programs with Java.

5. Write a program in java to implement Database Connectivity

6. Write a JSP program for order processing

7. Write a Servlet, bean program to access information from databases

8. Write a ASP program using the components

9. Studying E-Commerce domains.

10. Designing of a simple plug-in.

Analysis and Design of Algorithm Laboratory(0-0-3)

All the problems have to be implemented either writing C programs or writing C++ programs

Elementary Problems : (8 is compulsory and any four among the rest)

1. Using a stack of characters, convert an infix string to a postfix string.

2. implement polynomial addition using a single linked list

3. Implement insertion, deletion, searching of a BST, Also write a routine to draw the BST horizontally.

4. implement insertion routine in an AVL tree using rotation.

5. Implement binary search and linear search in a program

6. Implement heap sort using a max heap.

7. Implement DFS/ BFS routine in a connected graph

8. Implement Dijkstra’s shortest path algorithm using BFS

Greedy Algorithm (Any Two) 1. Given a set of weights, form a Huffman tree from the weight and also find oot the code corresponding

to each weight. 2. Take a weighted graph as an input, find out one MST using Kruskal/ prim’s algorithm 3. Given a set of weight and an upper bound M – Find out a solution to the Knapsack problem Divide and Conquer Algorithm (any Two) 1. Write a quick sort routine, run it for a different input sizes and calculate the time of running. Plot in

graph paper input size verses time. 2. Implement two way merge sort and calculate the time of sorting 3. Implement Strasseem’s matrix multiplication algorithm for matrices whose order is a power of two. Dynamic programming (Any one) 1. Find out a solution for 0/1 knapsack problem 2. given two sequences of character, find out their longest common subsequence using dynamic

programming

Software Technologies Laboratory

Experiment 1: Develop requirements specification for a given problem (The requirements specification should include both functional and non-functional requirements.

For a set of about 20 sample problems, see the questions section of Chap 6 of Software Engineering book of Rajib Mall) Experiment 2: Develop DFD Model (Level 0, Level 1 DFD and data dictionary) of the sample problem (Use of a CASE tool required) Experiment 3: Develop Structured design for the DFD model developed Experiment 4: Develop UML Use case model for a problem (Use of a CASE tool any of Rational rose, Argo UML, or Visual Paradigm etc. is required) Experiment 5: Develop Sequence Diagrams Experiment 6: Develop Class diagrams Experiment 7: Develop code for the developed class model using Java Experiment 8: Use testing tool such as Junit Experiment 9: Use a configuration management tool Experiment 10: Use any one project management tool such as Microsoft Project or Gantt Project, etc.

Graph Theory

Module-I(12 Hrs) Basic Concepts: Graphs and digraphs, incidence and adjacency matrices, isomorphism, the automorphism group; Trees: Equivalent definitions of trees and forests, Cayley's formula, the Matrix-Tree theorem, minimum spanning trees; Connectivity: Cut vertices, cut edges, bonds, the cycle space and the bond space, blocks, Menger s theorem; Paths and Cycles: Euler tours, Hamilton paths and cycles, theorems of Dirac, Ore, Bondy and Chvatal, girth, circumference, the Chinese Postman Problem, Module-II(16 Hrs) Travelling Salesman problem, diameter and maximum degree, shortest paths; Matchings: Berge's Theorem, perfect matchings, Hall's theorem, Tutte's theorem, Konig's theorem, Petersen's theorem, algorithms for matching and weighted matching (in both bipartitie and general graphs), factors of graphs (decompositions of the complete graph), Tutte's f-factor theorem; Extremal problems: Independent sets and covering numbers, Turan's theorem, Ramsey theorems; Colorings: Brooks theorem, the greedy algorithm, the Welsh-Powell bound, critical graphs, chromatic polynomials, girth and chromatic number, Vizing's theorem; Module-III(12 Hrs) Graphs on surfaces: Planar graphs, duality, Euler's formula, Kuratowski's theorem, toroidal graphs, 2-cell embeddings, graphs on other surfaces; Directed graphs: Tournaments, directed paths and cycles, connectivity and strongly connected digraphs, branchings; Networks and flows: Flow cuts, Max flow min cut theorems, perfect square; Selected topics: Dominating sets, the reconstruction problem, intersection graphs, perfect graphs, random graphs. Text Books: 1. T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, Prentice Hall of India, 3rd ed, 2006. 2. N. Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall of India, 2004. Reference Books: 1. D. B. West, Introduction to Graph Theory, 2nd Ed, Prentice Hall of India, 2007. 2. R. Diestel, Advanced Graph Theory, Springer Verlag Heidelberg, New York, 2005. 3. M. T. Goodrich and R. Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples, Wiley, 1st ed, 2001.

SOFTWARE TESTING Module 1.(12 Hrs) Basics of Software Testing The Testing process, Testing and Debugging; Test Metrics; Software and Hardware Testing; Testing and Verification; Defect Management; Execution History; Test case generation Strategies, Static and dynamic analysis., Model-Based Testing; Control-flow Graph, state-model, and data-flow-based testing. Module 2. (16 hrs) Test Generation and Regression Testing Introduction; The Test-Selection Problem; Equivalence Partitioning; Boundary Value. Analysis; Category-Partition Method. Cause-Effect Graphing, Test Generation from Predicates. Combinatorial Designs; A Combinatorial Test-Design Process; Fault Model. Basics of Regression Testing (RTS), Selecting Regression Tests; Test Selection Using Execution Trace; Test Selection Using program slicing; Test Minimization; Test Prioritization; Tools for Regression Testing. Module 3.(12 hrs)

Test Adequacy Test Adequacy: Basics; Adequacy Criteria Based on Control Flow. Data-Flow Concepts; Adequacy Criteria Based on Data-Flow; Control Flow versus Data- Flow; The Subsumes Relation; Structural and Functional Testing; Scalability of Coverage Measurement. Text Books:

1. Srinivasan Desikan, Gopalaswamy Ramesh: Software testing Principles and Practices, 2nd

Edition, Pearson, 2007. Reference Books: 1. Aditya P Mathur: Foundations of Software Testing, Pearson Education, 2008. 2. Ron Patton: Software Testing, 2nd edition, Pearson, 2004. 3. Mauro Pezze and Michal Young. Software Testing and Analysis, Wiley, 2008.

AD HOC NETWORKS

Module-I(15 Hrs)

INTRODUCTION

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

AD HOC ROUTING PROTOCOLS

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)

Module-II(15 Hrs)

MULTICASTROUTING IN AD HOC NETWORKS

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

TRANSPORT LAYER, SECURITY PROTOCOLS

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

Module-III(10 Hrs)

QoS AND ENERGY MANAGEMENT

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

REFERENCE BOOKS:

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

2. C.K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems, Prentice Hall PTR ,2001 3. Charles E. Perkins, Ad Hoc Networking, Addison Wesley, 2000

GRID COMPUTING

Module-I(14 Hrs)

GRID COMPUTING

Introduction - Definition - Scope of grid computing

GRID COMPUTING INITIATIVES

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

Module-II(16 Hrs)

GRID COMPUTING APPLICATIONSMerging the Grid sources – Architecture with the Web Devices

Architecture.

TECHNOLOGIES

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

Module-III(10 Hrs)

GRID COMPUTING TOOL KITS

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.

NETWORK MANAGEMENT

Module-I(16 Hrs)

Network Architecture:

Layering & Protocols – OSI & Internet Architecture – Link & Medium Access protocols – IEEE 802

standards – Performance issues – Networks Adaptors.

Network Layer:

Circuit switching – packet switching – Internetworking – bridges – Internet protocol – Addressing –

Routing Protocols.

Module-II(15 Hrs)

End – To – End Protocol:

UDP – TCP – Congestion Control – Presentation aspects.

Applications:

Telnet – FTP – email – DNS – Multimedia Applications – Security.

Module-III(9 Hrs)

Network Management:

Monitoring & Control – SNMP, V2, V3, RMON, RMON2.

REFERENCES:

1. Peterson Davie, Morgan Kaufman, “Computer Networks – A Systems approach”, Harcourt Asia, New Delhi, 2000.

2. William Stallings, “SNMP, SNMPV2, SNMPV3, RMON1 and 2”, Addison Wesley, USA, 1999. 3. Kurose J.F & Ross K.W, “Computer Networking-A top down approach featuring the Internet”,

Addison Wesley, USA, 2001.

COMPILER DESIGN

Module-I( 14 Hrs)

INTRODUCTION

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

tools.

LEXICAL ANALYZER

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.

Module-II( 16 Hrs)

SYNTAX ANALYZER

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

generate parsers.

INTERMEDIATE CODE GENERATION

Intermediate languages - Declaration - Assignment statements - Boolean expressions - Flow control

statements –Back patching.

Module-III( 10 Hrs)

CODE GENERATION

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

management - Design of a simple code generator.

REFERENCE BOOKS:

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

2. Fischer Leblanc, Crafting Compiler, Benjamin Cummings, Menlo Park, 1988. 3. Kennath C.Louden, Compiler Construction Principles and Practice, Vikas publishing House,

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

AGENT BASED INTELLIGENT SYSTEMS

Module-I(15 Hrs)

INTRODUCTION

Definitions - Foundations - History - Intelligent Agents-Problem Solving-Searching - Heuristics -Constraint

Satisfaction Problems - Game playing.

KNOWLEDGE REPRESENTATION AND REASONING

Logical Agents-First order logic-First Order Inference-Unification-Chaining- Resolution Strategies-

Knowledge Representation-Objects-Actions-Events

Module-II(16 Hrs)

PLANNING AGENTS

Planning Problem-State Space Search-Partial Order Planning-Graphs-Nondeterministic Domains-

Conditional Planning-Continuous Planning-MultiAgent Planning.

AGENTS AND UNCERTAINITY

Acting under uncertainty – Probability Notation-Bayes Rule and use - Bayesian Networks-Other

Approaches-Time and Uncertainty-Temporal Models- Utility Theory - Decision Network – Complex

Decisions.

Module-III(9 Hrs)

5. HIGHER LEVEL AGENTS

Knowledge in Learning-Relevance Information-Statistical Learning Methods-Reinforcement Learning-

Communication-Formal Grammar-Augmented Grammars- Future of AI.

REFERENCE BOOKS:

1. Stuart Russell and Peter Norvig, “Artificial Intelligence - A Modern Approach”, 2nd

Edition, Prentice Hall, 2002

2. Michael Wooldridge, “An Introduction to Multi Agent System”, John Wiley, 2002. 3. Patrick Henry Winston, Artificial Intelligence, III Edition, AW, 1999. 4. Nils.J.Nilsson, Principles of Artificial Intelligence, Narosa Publishing House, 1992.

Enterprise Resource Planning

Module-I(9 Hrs)

INTRODUCTION:

Business Processes - Concepts of ERP- brief history of ERP- major components and their functions in

ERP system. Basic differences between manufacturing and services - Data Integration Issues

Module-II(15 Hrs)

IMPLEMENTATION ISSUES

endor/Package Selection- Rapid Implementation - People Issues - ERP and Business/Process Drivers -

Office Integration – Software Selection – Project management – Feasibility Issues – Project Initiation –

Risk Involved - User Education

ERP ARCHITECTURE:

Basic architectural Concepts - The system control interfaces – Services -Presentation interface –

Database Interface. ERP and Internet – ERP and E-Commerce

Module-III(16 Hrs)

ERP INTERFACES:

Description – Multi- client server solution - Open technology - User Interface - Application Integration -

Data base requirement – methodology - interfaces with other systems and systems design and

implementation aspects.

ERP MODULES:

The Development of Enterprise Resource Planning Systems - Marketing Information Systems and the

Sales Order Process - Production and Supply Chain Management Information Systems - Accounting in

ERP Systems - Human Resources - Processes with ERP Process Modeling - Process Improvement

REFERENCES:

1. Sumner, Mary, “Enterprise Resource Planning”, Prentice Hall, New Jersey, 2005

2. Leon, “Enterprise Resource Planning”, Tata McGraw Hill, New Delhi.

3. O’Leary, Daniel, “Enterprise Resource Planning Systems: Systems, Life Cycle, Electronic Commerce,

and Risk”, Cambridge University Press, Cambridge, 2000.

4 Ellen Monk, Bret Wagner,” Concepts in Enterprise Resource Planning”, Thomson Course Technology,

USA, 2005