You are on page 1of 62

AFFILIATED INSTITUTIONS

ANNA UNIVERSITY OF TECHNOLOGY CHENNAI CHENNAI 600 113 REGULATIONS - 2010 CURRICULUM AND SYLLABUS FOR I SEMESTER (FULL TIME)

M.E.COMPUTER SCIENCE AND ENGINEERING
SEMESTER I SL. COURSE NO CODE THEORY 281110 1 2 241101 3 241102 4 243101 5 241103 PRACTICAL 6 241151 7 241152

COURSE TITLE Operations Research Computer Architecture Data Structures and Algorithms Object Oriented Software Engineering Computer Networks and Management Data Structures Lab Networking Lab TOTAL

L 3 3 3 3 3 0 0 15

T 1 0 0 0 0 0 0 1

P 0 0 0 0 0 3 3 6

C 4 3 3 3 3 2 2 20

281110

OPERATIONS RESEARCH

LTPC 3 104 UNIT I QUEUEING MODELS 9 Poisson Process – Markovian Queues – Single and Multi-server Models – Little’s formula – Machine Interference Model – Steady State analysis – Self Service Queue. UNIT II ADVANCED QUEUEING MODELS 9 Non- Markovian Queues – Pollaczek Khintchine Formula – Queues in Series – Open Queueing Networks –Closed Queueing networks. UNIT III SIMULATION 9 Discrete Even Simulation – Monte – Carlo Simulation – Stochastic Simulation – Applications to Queueing systems. UNIT IV LINEAR PROGRAMMING 9 Formulation – Graphical solution – Simplex method – Two phase method - Transportation and Assignment Problems. UNIT V NON-LINEAR PROGRAMMING 9 Lagrange multipliers – Equality constraints – Inequality constraints – Kuhn - Tucker conditions – Quadratic Programming. L + T: 45+15 =60 TEXT BOOKS: 1. Winston.W.L. “Operations Research”, Fourth Edition, Thomson – Brooks/Cole, 2003. 2. Taha, H.A. “Operations Research: An Introduction”, Ninth Edition, Pearson Education Edition, Asia, New Delhi, 2002. REFERENCES: 1. Robertazzi. T.G. “Computer Networks and Systems – Queuing Theory and Performance Evaluation”, Third Edition, Springer, 2002 Reprint. 2. Ross. S.M., “Probability Models for Computer Science”, Academic Press, 2002.

241101 UNIT I

COMPUTER ARCHITECTURE FUNDAMENTALS OF COMPUTER DESIGN AND PIPELINING

LT PC 3 0 0 3 9

Fundamentals of Computer Design – Measuring and reporting performance – Quantitative principles of computer design. Instruction set principles – Classifying ISA – Design issues. Pipelining – Basic concepts – Hazards – Implementation – Multicycle operations. UNIT II INSTRUCTION LEVEL PARALLELISM WITH DYNAMIC APPROACHES 9 Concepts – Dynamic Scheduling – Dynamic hardware prediction – Multiple issue – Hardware based speculation – Limitations of ILP – Case studies. UNIT III INSTRUCTION LEVEL PARALLELISM WITH SOFTWARE APPROACHES 9 Compiler techniques for exposing ILP – Static branch prediction – VLIW – Advanced compiler support – Hardware support for exposing more parallelism – Hardware versus software speculation mechanisms – Case studies. UNIT IV MULTIPROCESSORS AND MULTICORE ARCHITECTURES 9 Symmetric and distributed shared memory architectures – Performance issues – Synchronisation issues – Models of memory consistency – Software and hardware multithreading – SMT and CMP architectures – Design issues – Case studies. UNIT V MEMORY AND I/O 9 Cache performance – Reducing cache miss penalty and miss rate – Reducing hit time – Main memory and performance – Memory technology. Types of storage devices – Buses – RAID – Reliability, availability and dependability – I/O performance measures – Designing an I/O system. TOTAL : 45 PERIODS REFERENCES: 1. John L. Hennessey and David A. Patterson, “ Computer Architecture – A quantitative approach”, Morgan Kaufmann / Elsevier, 4th. edition, 2007. 2. David E. Culler, Jaswinder Pal Singh, “Parallel Computing Architecture : A hardware/ software approach” , Morgan Kaufmann / Elsevier, 1997. 3. William Stallings, “ Computer Organization and Architecture – Designing for Performance”, Pearson Education, Seventh Edition, 2006. 4. Behrooz Parhami, “Computer Architecture”, Oxford University Press, 2006.

S. Ronald L.241102 DATA STRUCTURES AND ALGORITHMS LTPC 3003 UNIT I COMPLEXITY ANALYSIS & ELEMENTARY DATA STRUCTURES 9 Asymptotic notations – Properties of big oh notation – asymptotic notation with several parameters – conditional asymptotic notation – amortized analysis – NP-completeness – NPhard – recurrence equations – solving recurrence equations – arrays – linked lists – trees.Tree-vertex splitting – Job sequencing with deadlines – Optimal storage on tapes UNIT V DYNAMIC PROGRAMMING AND BACKTRACKING 9 Multistage graphs – 0/1 knapsack using dynamic programming – Flow shop scheduling – 8queens problem – graph coloring – knapsack using backtracking TOTAL : 45 PERIODS REFERENCES: 1.Sahni and S. UNIT IV GREEDY & DIVIDE AND CONQUER 9 Quicksort – Strassen’s matrix multiplication – Convex hull . 1999. 2001. S.Sahni and Dinesh Mehta. Charles E. Galgotia. 5. 1999. Bratley. UNIT III SEARCH STRUCTURES 9 Binary search trees – AVL trees – 2-3 trees – 2-3-4 trees – Red-black trees – B-trees – splay trees – Tries. ”Introduction to Algorithms”. Computer Algorithms / C++. Data Structures and algorithms in C++. E. Thomas H. PHI 2003. G. 1988. 3. Algorithmics: Theory and Practice. 4. Galgotia. . E. Horowitz. Printice –Hall.Corman. Second Edition. Brassard and P. Fundamentals of Data structures in C++. Horowitz. Rivest. 2. Second Edition. Thomson learning – vikas publishing house. Rajasekaran. Adam Drozdex. UNIT II HEAP STRUCTURES 9 Min-max heaps – Deaps – Leftist heaps –Binomial heaps – Fibonacci heaps – Skew heaps Lazy-binomial heaps.Leiserson.

2004. Software Engineering 7th ed. Pearson Education. . 2005. Applying UML and Patterns. Pearson Education. Object-Oriented Software Engineering. Alan H Dutoit. 2. Stephen Schach. 3rd ed. 2007. McGraw-Hill. Craig Larman. Bernd Bruegge.243101 OBJECT ORIENTED SOFTWARE ENGINEERING L TPC 3 0 03 UNIT I INTRODUCTION 9 System Concepts – Software Engineering Concepts – Development Activities – Managing Software Development – Unified Modeling Language – Project Organization – Communication UNIT II ANALYSIS 9 Requirements Elicitation – Concepts – Activities – Management – Analysis Object Model – Analysis Dynamic Models UNIT III SYSTEM DESIGN 9 Decomposing the system – Overview of System Design – System Design Concepts – System Design Activities – Addressing Design Goals – Managing System Design UNIT IV OBJECT DESIGN AND IMPLEMENTATION ISSUES Reusing Pattern Solutions – Specifying Interfaces – Mapping Models to Code – Testing 9 UNIT V MANAGING CHANGE 9 Rationale Management – Configuration Management – Project Management – Software Life Cycle TOTAL : 45 PERIODS REFERENCES: 1. 2nd ed. 3.

Data Transfer Protocol. BRFQ. UNIT V PROTOCOLS FOR QoS SUPPORT 8 RSVP – Goals & Characteristics. Cisco Press. William Stallings.Queuing Discipline. WFQ – Random Early Detection. Components.241103 COMPUTER NETWORKS AND MANAGEMENT LTPC 3003 UNIT I HIGH SPEED NETWORKS 9 Frame Relay Networks – Asynchronous transfer mode – ATM Protocol Architecture.Queuing Models – Single Server Queues – Effects of Congestion – Congestion Control – Traffic Management – Congestion Control in Packet Switching Networks – Frame Relay Congestion Control. Warland & Pravin Varaiya. Ltd. UNIT III TCP AND ATM CONGESTION CONTROL 10 TCP Flow control – TCP Congestion Control – Retransmission – Timer Management – Exponential RTO backoff – KARN’s Algorithm – Window management – Performance of TCP over ATM. Fibre Channel – Wireless LAN’s. FQ. 2002. 2. “MPLS and VPN architecture”. “HIGH SPEED NETWORKS AND INTERNET”. RM cell formats. ATM logical Connection. Differentiated Services. UNIT IV INTEGRATED AND DIFFERENTIATED SERVICES 9 Integrated Services Architecture – Approach. Services. Jean Harcourt Asia Pvt. 2003. “HIGH PERFORMANCE COMMUNICATION NETWORKS”. Label Stacking. PS. Jim Guichard and Jeff Apcar. Pearson Education. Protocol details – RTP – Protocol Architecture. RSVP operations. High Speed LAN’s: Fast Ethernet. Traffic and Congestion control in ATM – Requirements – Attributes – Traffic Management Frame work. . Irvan Pepelnjk. UNIT II CONGESTION AND TRAFFIC MANAGEMENT 9 Queuing Analysis. Gigabit Ethernet. 2001. Traffic Control – ABR traffic Management – ABR rate control. GPS. ABR Capacity allocations – GFR traffic management. TOTAL : 45 PERIODS TEXT BOOKS: 1. REFERENCES: 1. Data Flow.. II Edition. ATM Cell – ATM Service Categories – AAL. Second Edition. RTCP. Protocol Mechanisms – Multiprotocol Label Switching – Operations. Volume 1 and 2.

TCP Sockets b. Simulation of Sliding Window Protocol 3. TOTAL : 30 PERIODS . Tries 7. 0/1 Knapsack using Dynamic Programming 10. ns2. Quick Sort 8. B-Tree 6. AVL Tree 5. Applications using Sockets 2. Development of applications such as DNS/ HTTP/ E – mail/ Multi . Deaps 3. Simulation of Network Management Protocols 6.user Chat 5. Study of Network Simulator Packages – such as opnet. Socket Programming a. UDP Sockets c. Graph coloring using backtracking TOTAL : 30 PERIODS 241152 NETWORKING LAB LTPC 0032 1. Convex hull 9. etc. Leftist Heap 4. Min Heap 2.241151 DATA STRUCTURES LAB LTPC 0032 1. Simulation of Routing Protocols 4.

2010 CURRICULUM AND SYLLABUS FOR II SEMESTER (FULL TIME) M.E.AFFILIATED INSTITUTIONS ANNA UNIVERSITY OF TECHNOLOGY CHENNAI CHENNAI 600 113 REGULATIONS . COURSE NO CODE THEORY 1 241204 2 241205 3 241206 4 241207 5 241208 6 E1 PRACTICAL 7 241253 8 241254 COURSE TITLE Data Base Technology Advanced Operating Systems Advanced System Software Information Security Web Technology Elective I Operating System Lab Web Technology Lab TOTAL L 3 3 3 3 3 3 0 0 18 T 0 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 3 3 6 C 3 3 3 3 3 3 2 2 22 .COMPUTER SCIENCE AND ENGINEERING SEMESTER II SL.

LIST OF ELECTIVES FOR M. NO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 COURSE CODE 241071 241072 241073 241074 250077 241075 241076 241077 241078 241079 241080 241081 241082 241083 241084 241085 241086 241087 241088 241089 COURSE TITLE Mobile Computing Grid Computing Theory of Computation Soft Computing Distributed Computing Multimedia Systems XML and Web Services Bio Informatics Network Security Embedded Systems Digital Imaging Software Quality Assurance Adhoc Networks Data Warehousing and Data Mining Performance Evaluation of Computer Systems and Networks Agent Based Intelligent Systems Visualization Techniques Advanced Databases Software Project Management Component Based Technology L 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 T 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 C 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 .COMPUTER SCIENCE AND ENGINEERING* SL.E.

“Database Management Systems”. Gian Piero Zarri.Tamer Ozsu. S.Recovery.241204 DATA BASE TECHNOLOGY 3003 UNIT I DISTRIBUTED DATABASES 5 Distributed Databases Vs Conventional Databases – Architecture – Fragmentation – Query Processing – Transaction Processing – Concurrency Control – Recovery. Elmasri. “Database System Concepts”. Prentice Hall Of India. N. 7.Modeling and Design . Prentice Hal International Inc. 3. UNIT V CURRENT ISSUES 10 Rules .Optimization and Research Issues – Design of Temporal Databases – Spatial Databases. “Fundamentals Of Database Systems”. 6. 1999.B. “Intelligent Database Systems”.S.Security .Web Databases – Mobile Databases.Subrahmanian.Knowledge Bases . Henry F Korth. Mcgraw Hill.Consistency . UNIT III EMERGING SYSTEMS 10 Enhanced Data Models . Raghu Ramakrishnan. Barbara Catania. Mcgraw Hill.Approaches . R. Christos Faloustsos. UNIT II OBJECT ORIENTED DATABASES 10 Introduction to Object Oriented Data Bases . 5. Navathe. Johannes Gehrke. 2004. 2001.Client/Server Model .Concurrency – Multi Version Locks . 4.Snodgrass.S. R. 1997. Sudharshan. Abraham Silberschatz.Persistence – Query Languages . V. . Carlo Zaniolo. “Object-Oriented Database Systems”. “Temporal Databases: Theory. Stefano Ceri.T. Elisa Bertino.Active And Deductive Databases . Pearson Education. 10 UNIT IV DATABASE DESIGN ISSUES ER Model . 1993. 1998. C. Fourth Ediion. Morgan Kaufman.Transaction .. Patrick Valduriez. “Advanced Database Systems”. 2. Benjamin Cummings Publishers.Data Warehousing and Data Mining . Abdullah Uz Tansel Et Al.Database Tuning . Addison-Wesley. Design And Principles”.Integrity .R Prabhu. Third Edition 2004. “Principles Of Distributed Database Systems”. 2002.Normalization . S. 8.Parallel Databases – Multimedia Databases – Image Databases – Text Database TOTAL : 45 PERIODS REFERENCES: 1.

Reusable Resources.Two-phase and Nonblocking Commit Protocols.Process Deadlocks . UNIT IV FAILURE RECOVERY AND FAULT TOLERANCE 9 Basic Concepts-Classification of Failures – Basic Approaches to Recovery. Addison Wesley. Second Edition.Preliminaries – Models of Deadlocks. UNIT II DISTRIBUTED OPERATING SYSTEMS 9 Introduction – Issues – Communication Primitives – Inherent Limitations . Termination Detection. Concurrent Processes – The Critical Section Problem. Synchronous and Asynchronous Checkpointing and Recovery.Token-Based Algorithms – Suzuki-Kasami’s Broadcast Algorithm – Distributed Deadlock Detection – Issues – Centralized Deadlock-Detection Algorithms .Distributed Deadlock-Detection Algorithms. Gagne. “Operating System Concepts”. Andrew S. TOTAL = 45 TEXT BOOKS: 1. 2. Sixth Edition. UNIT III DISTRIBUTED RESOURCE MANAGEMENT 9 Distributed File systems – Architecture – Mechanisms – Design Issues – Distributed Shared Memory – Architecture – Algorithm – Protocols . Resources. “Modern Operating Systems”. . McGraw-Hill. 2003. 2000 REFERENCES: .Synchronization Mechanisms – Concept of a Process. Check pointing in Distributed Database Systems. Mukesh Singhal and N. Vector Clock. Distributed Scheduling – Issues – Components – Algorithms. Issues . Galvin. Fault Tolerance. System State – Necessary and Sufficient conditions for a Deadlock – Systems with Single-Unit Requests. G. Addison Wesley Publishing Co. Tanenbaum. Shivaratri. Cuts.Functions of an Operating System – Design Approaches – Types of Advanced Operating System . Distributed Mutual Exclusion – Non-Token Based Algorithms – Lamport’s Algorithm .Solutions –Applications. Abraham Silberschatz. Dynamic Voting Protocols. 1. Global State. Agreement Protocols – Classification .Lamport’s Logical Clock. G. Consumable Resources. Database Operating Systems – Introduction – Concurrency Control – Distributed Database Systems – Concurrency Control Algorithms. 2001.Design Issues. Voting Protocols. UNIT V MULTIPROCESSOR AND DATABASE OPERATING SYSTEMS 9 Structures – Design Issues – Threads – Process Synchronization – Processor Scheduling – Memory Management – Reliability / Fault Tolerance. “Advanced Concepts in Operating Systems”. Other Synchronization Problems – Language Mechanisms for Synchronization – Axiomatic Verification of Parallel Programs ..241205 ADVANCED OPERATING SYSTEMS LTPC 3003 UNIT I INTRODUCTION 9 Overview . Peter B. Causal Ordering. Recovery in Concurrent System.

System Boot UNIT II 10 Introduction and Overview – Symbol table structure – Local and Global Symbol table management Intermediate representation – Issues – High level.6.0-3. 5. James E Smith and Ravi Nair. Muchnick.8.3) 3. 3. 4. Steven S. First Edition 2004 2. LIR – ICAN for Intermediate code – Optimization – Early optimization – loop optimization UNIT III 9 Procedure optimization – in-line expansion – leaf routine optimization and shrink wrapping – register allocation and assignment – graph coloring – data flow analysis – constant propagation – alias analysis – register allocation – global references – Optimization for memory hierarchy Code Scheduling – Instruction scheduling – Speculative scheduling – Software pipelining – trace scheduling – Run-time support – Register usage – local stack frame – run-time stack – Code sharing – position–independent code UNIT IV 9 Introduction to Virtual Machines (VM) – Pascal P-Code VM – Object-Oriented VMs – Java VM Architecture – Common Language Infrastructure – Dynamic Class Loading – Security – Garbage Collection – Optimization UNIT V 8 Emulation – Interpretation and Binary Translation – Instruction Set Issues – Process Virtual Machines – Profiling – Migration – Grids – Examples of real world implementations of system software TEXT BOOKS: 1. 5. Device Drivers. Sebesta..9. 2.3.10. 5) (Sections 1. 10. 9. 10. 12. 2006.5. 9.1-10. 2005.0-2. 10. (Unit 3) (Sections 6.5. (Units 4. low level intermediate languages – MIR. Elsevier.0-5. India.3.3.2. Virtual Memory. HIR. 6.0-1. “Virtual Machines”. Morgan Koffman – Elsevier Science. 6.6. 7th ed.5-6.6. “Concepts of Programming Languages”. “Advanced Compiler Design Implementation”.5-5. Robert W.3. medium level. Process Creation – Overview of I/O Systems. Pearson Education.241206 ADVANCED SYSTEM SOFTWARE LTPC 3003 UNIT I Basic Compiler Functions – Grammars – Lexical Analysis – Syntactic Analysis – Code Generation – Heap Management – Parameter Passing Methods – Semantics of Calls and Returns – Implementing Subprograms – Stack Dynamic Local Variables – Dynamic binding of method calls to methods – Overview of Memory Management.2.2) .6. 2.0-6.

. 5th ed. 6th ed. Terrance W Pratt. Zvonko Vranesic. Wiley. Ravi Sethi.. 2006. “Compilers”. 3. Silberschatz.. 2003 . 2002. Alfred V Aho. Safwat Zaky. 4. Gagne.REFERENCES: 1. T V Gopal. McGraw Hill. Carl Hamacher. Marvin V Zelkowitz. 1986. Jeffrey D Ullman. 2. Galvin. “Computer Organization”. Pearson Education. “Operating System Concepts”. “Programming Languages”. Pearson Education. 4th ed.

Matt Bishop . .Key management – Session and Interchange keys. Auditing and Intrusion Detection UNIT V Network Security. Cipher Techniques UNIT III 9 Systems: Design Principles. Policy-Security policies. Third Edition. “Principles of Information Security”.241207 INFORMATION SECURITY LTPC 3003 UNIT I 9 An Overview of Computer Security. Representing Identity. Second Edition. UNIT IV Malicious Logic. Whitman. Pearson Education. Storing and Revoking Keys. Mark Merkow. System Security. Cryptographic Key Infrastructure.Pfleeger and Shari Lawrence . Digital Signatures. Access Control Mechanisms. Access Control Matrix. 3. Second Edition. User Security and Program Security 9 9 TEXT BOOK: 1. James Breithaupt “ Information Security : Principles and Practices” First Edition. Pearson Education William Stallings. Pearson Education REFERENCES: 1. Pearson Education. “Security in Computing ”. Information Flow and Confinement Problem.“Computer Security art and science ”. Confidentiality UNIT II 9 Cryptography. “Cryptography and Network Security: Principles and Practices”. Vulnerability Analysis. Key exchange and generation. Charles P. 2. 4.

Chris Bates. “ Web Technology – A computer Science perspective”. Persoson Education. UNIT V 9 Building Web applications . “Web Programming – Building Internet Applications.241208 WEB TECHNOLOGY LTPC 3 00 3 UNIT I 9 Web essentials – clients – servers . 2. . UNIT IV 9 Representing Web data – data base connectivity – JDBC – Dynamic Web pages – XML – DTD – XML schema – DOM – SAX – Xquery. 2006. 2007. TEXT BOOKS: 1. “Wiley India. Jeffrey C Jackson.communication – markup languages – XHTML – simple XHTML pages style sheets – CSS UNIT II 9 Client side programming – Java script language – java script objects – host objects : Browsers and the DOM UNIT III 9 Server side programming – java servlets – basics – simple program – separating programming and presentation – ASP/JSP .cookies – sessions – open source environment – PHP – MYSQL – case studies.JSP basics ASP/JSP objects – simple ASP/JSP pages.

Pb B. while inside a synchronized method or while inside a method called by a synchronized method).valid PROGRAM 2 – Multithreading . and smokes it for a random amount of time. The agent then blocks. No semaphores are allowed.241253 OPERATING SYSTEM LAB 0 0 3 2 MULTIPROCESSOR OPERATING SYSTEMS PROGRAM 1 – Semaphores . and the cycle repeats. Each smoker thread executes in a smoker object. and Pc. Each of the four threads invokes a synchronized monitor method for its synchronization.valid AAAABCBC -.Multiprocessor operating systems Assume there are three processes: Pa.invalid. paper. The three smoker threads are initially blocked. No calls to nap inside a synchronized method are allowed (do not nap while holding the monitor object's lock. Do not mechanically translate semaphore code into monitor code! The agent thread executes in an agent object created from an agent class. c) The total number of B's and C's which have been output at any given point in the output string cannot exceed the number of A's which have been output up to that point. Pb. that is. unblocking the agent on completion of smoking the cigarette. A driver class with a main method constructs the objects and starts the threads. violates a) -. a smoker needs three ingredients: tobacco. violates b) ABACAC AABCABC -. and matches. only synchronized methods.invalid. The unblocked smoker removes the two ingredients from the table. All smoker objects are created from one smoker class whose constructor is used to specify the ingredient possessed by the smoker object. . No synchronized blocks are allowed. Only Pa can output the letter A. makes a cigarette.invalid.valid AB -. once a C is output. Examples AACB -. that is. violates c) AABCAAABC -. The agent places two randomly chosen (different) ingredients on the table and unblocks the one smoker who has the remaining ingredient.Multiprocessor operating systems The Cigarette Smokers Problem Consider a simulation with three smoker threads and one agent thread. another has only tobacco. Utilizing only semaphores (and no other variables) the processes are synchronized so that the output satisfies the following conditions: a) A B must be output before any C's can be output. But to make a cigarette. another C cannot be output until a B is output. another B cannot be output until a C is output. One of the smoker threads has only paper. No busy waiting is allowed. b) B's and C's must alternate in the output string. after the first B is output. Write a multi-class multithreaded Java program that uses a monitor to synchronize the agent thread and the three smoker threads. and the third has only matches. Similarly. Each smoker continuously makes a cigarette and smokes it. Use a single monitor object instantiated from a class Control for synchronization. The agent thread has an infinite supply of all three materials. and Pc C. The agent then puts out another random two of the three ingredients.

g. The program shall communicate with a graphical user interface. where the current time shall be displayed. the alarm is enabled again when a new alarm time is set. Testing LAN Connections Real time operating systems PROGRAM 5 – Real time operating systems A real-time program implementing an alarm clock shall be developed. Network operating systems PROGRAM 4 – Network operating systems Establish a Lab setup for the following network operating systems based programs based on the skills in networking on your own. the alarm shall be activated when the alarm is enabled. Exploring Local Area Network Configuration Options 3. Exercises 1. E. Identifying Local Area Network Hardware 2. Sharing Resources 5.Multiprocessor operating systems Write a multi-class multithreaded Java program that simulates multiple sleeping barbers. Each customer is instantiated from a single Customer class. . Acknowledgement of an alarm shall lead to the alarm being disabled. each barber is instantiated from a single Barber class. an activated alarm must be acknowledged. all in one barbershop that has a finite number of chairs in the waiting room. using C and Simple_OS] The program shall fulfill the following requirements: Clock with alarm functionality shall be implemented. It shall be possible to set the alarm time. [Alarm clock. Verifying TCP/IP Settings 4. using a command which is sent from the graphical user interface. It shall be possible to terminate the program. for identifying networking hardware. and where the alarm time shall be displayed when the alarm is enabled. an alarm which is not acknowledged shall be repeated every 10 seconds. the alarm shall be enabled when the alarm time is set. It shall be possible to set the time. identifying different kinds of network cabling and network interface cards can be done.PROGRAM 3 – Multiple sleeping barbers . and when the current time is equal to the alarm time.

(A superposed computation is one that does not a_ect the underlying system. Observe and implement the implication of nested transactions.Database operating systems PROGRAM 6 – Transactions and Concurrency -Database operating systems Exercises Assume any application(e. Consider a distributed system that consists of two processes which communicate with each other. Distributed operating systems PROGRAM 7 – Distributed operating systems 1. Investigate and implement the ObjectStore's concurrency options. [Hint: Use vector clocks. Design a superimposed computation which detects that there exists an interleaving of underlying events in this system where at some state P ^Q holds.e.banking) on your own and do the following exercises. Assume that neither P nor Q are stable (i. 2.“java LotteryClient n”.] . Design a RMI Lottery application.) State any assumptions you make. the server program “LotteryServer” will generate n set of Lottery numbers. i.e. closed). it may \read" but not \write" the state of the underlying system. FD. 2. representing the money you will spend on Lottery in sterling pounds. Implement the concurrency conflict that occurs between multiple client applications. or pseudo code). coding. 1. Each time you run the client program -. test/debug.g. 3. there should be specifications. Write this program in a proper engineering manner. and documentation. Here n is a positive integer. Let P be a state predicate on the local state of one process and Q be a state predicate on the local state of the other process. design (flow chart. Events in a superposed computation may occur in at the same instant as the underlying events and/or at di_erent instants.

Creation of XML document for a specific domain 8. railway/air/bus ticket reservation system with set of ASP/JSP pages # Using sessions and cookies as part of the web application 5. Session. tables and other tags 2. check boxes. radio buttons. Client side Programming # Java script for displaying date and comparing two dates # Form Validation including text field. ADO etc # Writing online applications such as shopping. list box and other controls 4. links. Application. Creation of HTML pages with frames. Request. Any online application with database access 7. Writing Servlet Program using HTTP Servlet 6. Usage of ASP/JSP objects response. Sample web application development in the open source environment . Usage of internal and external CSS along with HTML pages 3.241254 WEB TECHNOLOGY LAB LTPC 003 2 1. Writing DTD or XML schema for the domain specific XML document 9. Parsing an XML document using DOM and SAX Parsers 10. Server.

2. “Principles of Mobile Computing”. Pearson Education. UNIT IV NETWORK LAYER 9 Mobile IP – Dynamic Host Configuration Protocol – Routing – DSDV – DSR – AODV – ZRP – ODMR.241071 MOBILE COMPUTING LTPC 3003 UNIT I WIRELESS COMMUNICATION FUNDAMENTALS 9 Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks. UNIT III WIRELESS NETWORKS 9 Wireless LAN – IEEE 802. Pearson Education. 2003. Pearson Education. 2. Lothar Merk. Uwe Hansmann. REFERENCES: 1. First Edition. UNIT V TRANSPORT AND APPLICATION LAYERS 7 TCP over Wireless Networks – Indirect TCP – Snooping TCP – Mobile TCP – Fast Retransmit / Fast Recovery – Transmission/Timeout Freezing – Selective Retransmission – Transaction Oriented TCP – WAP – WAP Architecture – WDP – WTLS – WTP – WSP – WML –WML Script – WAE – WTA.K. Kaveh Pahlavan. Martin S. “AdHoc Mobile Wireless Networks”. “Principles of Wireless Networks”. 4. Burkhardt. First Edition. “Wireless Communications and Networks”. 2002. Springer. “Mobile Communications”. . 2003. 2003. Second Edition. UNIT II TELECOMMUNICATION SYSTEMS 11 GSM – System Architecture – Protocols – Connection Establishment – Frequency Allocation – Routing – Handover – Security – GPRS. Pearson Education. Jochen Schiller. William Stallings. C. Nicklons and Thomas Stober.11 Standards – Architecture – Services – HIPERLAN – Adhoc Network – Blue Tooth.Toh. “Pervasive Computing”. TOTAL = 45 TEXT BOOKS: 1. 2002. 3. Prasanth Krishnamoorthy. 2003. Pearson Education. First Edition.

Anthony J. 2003. Hey.NET for Grid computing on Mobile devices. “Grid Computing: Making the Global Infrastructure a reality “. REFERENCES: 1. Present and Future – Applications of grid computing organizations and their roles. Geoffrey Fox.G. UNIT II GRID COMPUTING ARCHITURE 8 Grid Computing anatomy – Next generation of Grid computing initiatives–Merging the Grid services architecture with Web services architecture. UNIT III GRID COMPUTING TECHNOLOGIES 11 OGSA – Sample use cases that drive the OGSA platform components – OGSI and WSRF– OGSA Basic Services – Security standards for grid computing. TOTAL = 45 TEXT BOOKS: 1. “Grid Computing”. . Ahmar Abbas. Pearson/PHI PTR-2003.2003. UNIT V HIGH LEVEL GRID SERVICES 9 High level grid services – OGSI . Fran Berman. Joshy Joseph & Craig Fellenstein. UNIT IV GRID COMPUTING TOOL KIT 10 Globus Toolkit –Versions – Architecture –GT Programming model –A sample grid service implementation.241072 GRID COMPUTING LTPC 3003 UNIT I INTRODUCTION TO GRID COMPUTING 7 Introduction – The Grid – Past. “Grid Computing: A Practical Guide to Technology and Applications”. John Wiley and sons. Charles River media. 2.NET middleware Solution Mobile OGSI.

LTPC 3003 UNIT I AUTOMATA 9 Introduction to formal proof – Additional forms of Proof – Inductive Proofs –Finite Automata – Deterministic Finite Automata – No deterministic Finite Automata – Finite Automata with Epsilon Transitions. UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9 Regular Expression – FA and Regular Expressions – Proving Languages not to be regular – Closure Properties of Regular Languages – Equivalence and Minimization of Automata. UNIT III CONTEXT FREE GRAMMAR AND LANGUAGES 9 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. UNIT IV PROPERTIES OF CONTEXT FREE LANGUAGES 9 Normal Forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing Machines – Programming Techniques for TM. UNIT V INDECIDABILITY 9 A Language That Is Not Recursive Enumerable – An Undecidable Problem that Is RE – Undecidable Problems about TM – Post’s Correspondence Problem, The Class P And NP. TOTAL = 45 TEXT BOOKS: 1. J.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata Theory, Languages and Computations”, Second Edition, Pearson Education, 2003.

241073

THEORY OF COMPUTATION

REFERENCES: 1. 2. 3. H.R.Lewis and C.H.Papadimitriou, “Elements of the theory of Computation”, Second Edition, PHI, 2003. J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, TMH, 2003. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997.

241074

SOFT COMPUTING

LTPC 3003 UNIT I INTRODUCTION TO SOFT COMPUTING AND NEURAL NETWORKS 9 Evolution of Computing - Soft Computing Constituents – From Conventional AI to Computational Intelligence - Machine Learning Basics UNIT II GENETIC ALGORITHMS 9 Introduction to Genetic Algorithms (GA) – Applications of GA in Machine Learning - Machine Learning Approach to Knowledge Acquisition. UNIT III NEURAL NETWORKS 9 Machine Learning Using Neural Network, Adaptive Networks – Feed forward Networks – Supervised Learning Neural Networks – Radial Basis Function Networks - Reinforcement Learning – Unsupervised Learning Neural Networks – Adaptive Resonance architectures – Advances in Neural networks. UNIT IV FUZZY LOGIC 9 Fuzzy Sets – Operations on Fuzzy Sets – Fuzzy Relations – Membership Functions- Fuzzy Rules and Fuzzy Reasoning – Fuzzy Inference Systems – Fuzzy Expert Systems – Fuzzy Decision Making. UNIT V NEURO-FUZZY MODELING 9 Adaptive Neuro-Fuzzy Inference Systems – Coactive Neuro-Fuzzy Modeling – Classification and Regression Trees – Data Clustering Algorithms – Rulebase Structure Identification – Neuro-Fuzzy Control – Case studies. TOTAL = 45 TEXT BOOKS: 1. Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, “Neuro-Fuzzy and Soft Computing”, Prentice-Hall of India, 2003. 2. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”, Prentice Hall, 1995. 3. James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and Programming Techniques”, Pearson Edn., 2003. REFERENCES: 1. 2. 3. 4. 5. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998. David E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine Learning”, Addison Wesley, 1997. S. N. Sivanandam, S. Sumathi and S. N. Deepa, “Introduction to Fuzzy Logic using MATLAB”, Springer, 2007. S.N.Sivanandam · S.N.Deepa, “ Introduction to Genetic Algorithms”, Springer, 2007. Jacek M. Zurada, “Introduction to Artificial Neural Systems”, PWS Publishers, 1992.

250077

DISTRIBUTED COMPUTING LTPC 3003

UNIT I

COMMUNICATION IN DISTRIBUTED ENVIRONMENT

8

Introduction – Various Paradigms in Distributed Applications – Remote Procedure Call – Remote Object Invocation – Message-Oriented Communication – Unicasting, Multicasting and Broadcasting – Group Communication. UNIT II DISTRIBUTED OPERATING SYSTEMS 12

Issues in Distributed Operating System – Threads in Distributed Systems – Clock Synchronization – Causal Ordering – Global States – Election Algorithms –Distributed Mutual Exclusion – Distributed Transactions – Distributed Deadlock – Agreement Protocols . UNIT III DISTRIBUTED RESOURCE MANAGEMENT 10

Distributed Shared Memory – Data-Centric Consistency Models – Client-Centric Consistency Models – Ivy – Munin – Distributed Scheduling – Distributed File Systems – Sun NFS. UNIT IV FAULT TOLERANCE AND CONSENSUS 7

Introduction to Fault Tolerance – Distributed Commit Protocols – Byzantine Fault Tolerance – Impossibilities in Fault Tolerance. UNIT V CASE STUDIES 8

Distributed Object-Based System – CORBA – COM+ – Distributed Coordination-Based System – JINI. Total= 45 REFERENCES: 1. George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems Concepts and Design”, Third Edition, Pearson Education Asia, 2002. 2. Hagit Attiya and Jennifer Welch, “Distributed Computing: Fundamentals, Simulations and Advanced Topics”, Wiley, 2004. 3. Mukesh Singhal, “Advanced Concepts In Operating Systems”, McGrawHill Series in Computer Science, 1994. 4. A.S.Tanenbaum, M.Van Steen, “Distributed Systems”, Pearson Education, 2004. 5. M.L.Liu, “Distributed Computing Principles and Applications”, Pearson Addison Wesley, 2004.

Ralf Steinmetz and Klara Nahrstedt . Multimedia Applications Development using DVI technology. K. Ralf Steinmetz and Klara Nahrstedt.M. “Multimedia Systems”. and Networks. Milovacovic.Establishment PhaseRun-Time Phase-Management Architectures. 9 Types-Multimedia Total No of periods: 45 TEXT BOOKS: 1. Multimedia Communication Systems: Techniques. Standards. Dragorad A. Multimedia. Pearson. 2.B.. 2002.. 4. 1992. 3.ATM Networks-MAN-WAN. Drew. A. Zoran S. Media Coding and Content Processing. Tata McGraw Hill. UNIT V SYNCHRONIZATION Synchronization in Multimedia Systems-Presentation-Synchronization Synchronization Methods-Case Studies-MHEG-MODE-ACME. UNIT III FILE SYSTEMS AND NETWORKS 9 Traditional and Multimedia File Systems-Caching Policy-Batching-Piggy backing-EthernetGigabit Ethernet-Token Ring-100VG Any LAN-Fiber Distributed Data Interface (FDDI). . McGraw Hill. Prentice hall. D. Prentice Hall. Bojkovic. Ze-Nian Li and Mark S. 1st Edition. UNIT II OPERATING SYSTEMS 9 Real-Time Processing-Scheduling-Interprocess Communication-Memory and ManagementServer Architecture-Disk Management. Milovacovic . 2002 5. 1999.241075 MULTIMEDIA SYSTEMS LTPC 3003 UNIT I INTRODUCTION AND QOS 9 Introduction-QOS Requirements and Constraints-Concepts-Resources. REFERENCES: 1. Mark J. 2004. Vaughan T. Sandra K. Springer. R. I Edition 2004. Fundamentals of Multimedia. UNIT IV COMMUNICATION 9 Transport Subsystem-Protocol Support for QOS-Transport of Multimedia-Computer Supported Cooperative Work-Architecture-Session Management-MBone Applications. Rao.

UNIT V XML AND CONTENT MANAGEMENT 9 Semantic Web – Role of Meta data in web content – Resource Description Framework – RDF schema – Architecture of semantic web – content management workflow – XLANG – WSFL .Coyle. Web Services and the Data Revolution”. M. 2. “. Computer Science and Engineering. Software Engineering and M. Pearson Education. Russ Basiura and Mike Batongbacal. 2003. Prentice Hall. “Developing Enterprise Web Services: An Architect's Guide”.NET Web Services”. 2002. M. “Beginning Java Web Services”. Henry Bequet and Meeraj Kunnumpurath.E. “XML. Ron Schmelzer et al.Tech. REFERENCES 1. TOTAL: 45 PERIODS TEXT BOOK 1.241076 XML AND WEB SERVICES 3003 (Common to M. . 2004. Sandeep Chatterjee and James Webber. Pearson Education. 4.E. Information Technology) UNIT I XML TECHNOLOGY FAMILY 9 XML – benefits – Advantages of XML over HTML – EDI – Databases – XML based standards – DTD – XML Schemas – X – Files – XML processing – DOM – SAX – presentation technologies – XSL – XFORMS – XHTML – voice XML – Transformation – XSLT – XLINK – XPATH – XQ UNIT II ARCHITECTING WEB SERVICES 9 Business motivations for web services – B2B – B2C – Technical motivations – limitations of CORBA and DCOM – Service – oriented Architecture (SOA) – Architecting web services – Implementation view – web services technology stack – logical view – composition of web services – deployment view – from application server to peer to peer – process view – life in the runtime UNIT III WEB SERVICES BUILDING BLOCK 9 Transport protocols for web services – messaging with web services – protocols – SOAP – describing web services – WSDL – Anatomy of WSDL – manipulating WSDL – web service policy – Discovering web services – UDDI – Anatomy of UDDI – Web service inspection – Ad – Hoc Discovery – Securing web services. Keith Ballinger. Pearson Education. Computer Communication. “Professional ASP .NET Web Services Architecture and Implementation”. 2002. UNIT IV IMPLEMENTING XML IN E – BUSINESS 9 B2B – B2C Applications – Different types of B2B interaction – Components of e – business XML systems – ebXML – Rosetta Net Applied XML in vertical industry – web services for mobile devices. Frank P. Apress. “XML and Web Services”. 2. 2004. 3. 2003.E. Apress.

UNIT III STATISTICS AND DATA MINING 9 Statistical concepts – Microarrays – Imperfect Data – Randomness – Variability – Approximation – Interface Noise – Assumptions – Sampling and Distributions – Hypothesis Testing – Quantifying Randomness – Data Analysis – Tool selection statistics of Alignment – Clustering and Classification – Data Mining – Methods – Selection and Sampling – Preprocessing and Cleaning – Transformation and Reduction – Data Mining Methods – Evaluation – Visualization – Designing new queries – Pattern Recognition and Discovery – Machine Learning – Text Mining – Tools. Bryan Bergeron. Pearson Education.Issues – Security – Intellectual property. Total = 45 REFERENCES 1.241077 BIO INFORMATICS LTPC 3003 UNIT I INTRODUCTORY CONCEPTS The Central Dogma – The Killer Application – Parallel Universes – Watson’s Definition – Top Down Versus Bottom up – Information Flow – Convergence – Databases – Data Management – Data Life Cycle – Database Technology – Interfaces – Implementation – Networks – Geographical Scope – Communication Models – Transmissions Technology – Protocols – Bandwidth – Topology – Hardware – Contents – Security – Ownership – Implementation – Management. UNIT II SEARCH ENGINES AND DATA VISUALIZATION 9 The search process – Search Engine Technology – Searching and Information Theory – Computational methods – Search Engines and Knowledge Management – Data Visualization – sequence visualization – structure visualization – user Interface – Animation Versus simulation – General Purpose Technologies. Second Edition. . UNIT IV PATTERN MATCHING 9 Pairwise sequence alignment – Local versus global alignment – Multiple sequence alignment – Computational methods – Dot Matrix analysis – Substitution matrices – Dynamic Programming – Word methods – Bayesian methods – Multiple sequence alignment – Dynamic Programming – Progressive strategies – Iterative strategies – Tools – Nucleotide Pattern Matching – Polypeptide pattern matching – Utilities – Sequence Databases. “Bio Informatics Computing”. UNIT V MODELING AND SIMULATION 9 Drug Discovery – components – process – Perspectives – Numeric considerations – Algorithms – Hardware – Issues – Protein structure – AbInitio Methods – Heuristic methods – Systems Biology – Tools – Collaboration and Communications – standards . 2003.

Applications . 3rd Edition.Principles & Practice.Digital Signatures . Pearson Education. 241078 NETWORK SECURITY LTPC 3003 UNIT I INTRODUCTION 9 Attacks .Attwood and D. Toha Wiley & Sons. of Periods: 45 TEXT BOOK: 1.J.Web Security. REFERENCES: 1. Bruce.Conventional Encryption .Electronic Mail Security . Perry Smith. UNIT V SYSTEM SECURITY Intruders – Viruses – Worms – Firewalls Design Principles – Trusted Systems. 2003. Prentice Hall.IP Security . Pfleeger & Pfleeger. “Internet Security”. Cryptography & Network Security . 2nd Edition. UNIT II PUBLIC KEY ENCRYPTION 9 RSA .Mechanisms . 2003.Classical And Modern Techniques – Encryption Algorithms . 1996. T. 2.2. 1999. Longman Essen.Number Theory Concepts UNIT III MESSAGE AUTHENTICATION Hash Functions . Wiley. Man Young Rhee. UNIT IV NETWORK SECURITY PRACTICE Authentication. 3rd Edition 2002. “Introduction to Bio Informatics. Stallings. 3.Authentication Protocols. Schneier. Applied Cryptography.K. “Security in Computing”. .Services .Confidentiality.Digest Functions . 9 9 9 Total No.Elliptic Curve Cryptography .

2003. C. ” ARM System Developers Guide”. Pont. UNIT III OPTIMIZING ASSEMBLY CODE 9 Profiling and cycle counting – instruction scheduling – Register allocation – conditional execution – looping constructs – bit manipulation – efficient switches – optimized primitives. 2nd. UNIT IV PROCESSES AND OPERATING SYSTEMS 9 Multiple tasks and processes – Context switching – Scheduling policies – Interprocess communication mechanisms – Exception and interrupt handling . 2nd. Andrew N Sloss. edition.Performance issues. 2006. 2008. “Embedded System Design” .241079 EMBEDDED SYSTEMS LTPC 3003 UNIT I EMBEDDED COMPUTING 9 Challenges of Embedded Systems – Embedded system design process. . UNIT V EMBEDDED SYSTEM DEVELOPMENT 9 Meeting real time constraints – Multi-state systems and function sequences. Wayne Wolf. Embedded software development tools – Emulators and debuggers. 2007. “Embedded C”. Steve Heath. ARM and Thumb Instruction sets UNIT II EMBEDDED C PROGRAMMING 9 C-looping structures – Register allocation – Function calls – Pointer aliasing – structure arrangement – bit fields – unaligned data and endianness – inline functions and inline assembly – portability issues. Pearson Education . “Computers as Components : Principles of Embedded Computer System Design”. Elsevier. 3. D. 2. 4. TOTAL = 45 REFERENCES 1. Embedded processors – ARM processor – Architecture. Morgan Kaufmann / Elsevier. Design methodologies – Case studies – Complete design of example embedded systems. Wright. Michael J. edition. Morgan Kaufmann / Elsevier. Symes.

Second Edition. Person Educaiton. DCT – Smoothing and Sharpening filters – Homomorphic Filtering. “Fundamentals of Digital Image Processing”. “Image Processing. UNIT II IMAGE ENHANCEMENT 9 Spatial Domain Gray level Transformations Histogram Processing Spatial Filtering – Smoothing and Sharpening. Milan Sonka. 3.Gonzalez and Richard E. 2003.241080 DIGITAL IMAGING LTPC 3003 UNIT I FUNDAMENTALS OF IMAGE PROCESSING 9 Introduction – Steps in Image Processing Systems – Image Acquisition – Sampling and Quantization – Pixel Relationships – Colour Fundamentals and Models. FFT. Feature Analysis and Extraction. UNIT III IMAGE SEGMENTATION AND FEATURE ANALYSIS 9 Detection of Discontinuities – Edge Operators – Edge Linking and Boundary Detection – Thresholding – Region Based Segmentation – Morphological WaterSheds – Motion Segmentation. . . “Digital Image Processing” Second Edition. Image operations – Arithmetic.Jain. TOTAL = 45 REFERENCES: 1.Woods. Pearson Education. Rafael C. Vaclav Hlavac and Roger Boyle. 2. UNIT IV MULTI RESOLUTION ANALYSIS AND COMPRESSIONS 9 Multi Resolution Analysis : Image Pyramids – Multi resolution expansion – Wavelet Transforms. UNIT V APPLICATIONS OF IMAGE PROCESSING 9 Image Classification – Image Recognition – Image Understanding – Video Motion Analysis – Image Fusion – Steganography – Digital Compositing – Mosaics – Colour Image Processing.. Thomson Learning. Analysis and Machine Vision”. Geometric and Morphological. 2003. Image Compression : Fundamentals – Models – Elements of Information Theory – Error Free Compression – Lossy Compression – Compression Standards. 2001 Anil K.Frequency Domain : Filtering in Frequency Domain – DFT. File Formats.

“Software Quality Theory and Management”. Alan C Gillies. 2009. 1. assessment and enhancement UNIT III 9 Testing strategies – white box and black box approach – integration testing – system and acceptance testing – performance testing – regression testing . Second edition. 2. 2006 4. Software testing – principles and practices .test selection. 2003 . Aditya Mathur. Pearson education. minimization and prioritization for regression testing – test adequacy.internationalization testing – adhoc testing – website testing – usability testing – accessibility testing Test plan – management – execution and reporting – software test automation – automated testing tools UNIT IV 9 Hierarchical models of software quality – software quality metrics –function points -Software product quality – software maintenance quality – effect of case tools – software quality infrastructure – procedures – certifications – configuration management – documentation control. UNIT V 9 Project progress control – costs – quality management standards – project process standards – management and its role in SQA – SQA unit TOTAL = 45 REFERENCES 1. Pearson education. Ron Patton. Foundations of software testing. Software testing . second edition. Pearson education. Cengage Learning. Software quality assurance – from theory to implementation .challenges – objectives – quality factors – components of SQA – contract review – development and quality plans – SQA components in project life cycle – SQA defect removal policies – Reviews UNIT II 9 Basics of software testing – test generation from requirements – finite state models – combinatorial designs . 2008 3.Daniel Galin. Pearson Education. 2007 5. Srinivasan Desikan and Gopalaswamy Ramesh.241081 SOFTWARE QUALITY ASSURANCE LTPC 3003 UNIT I 9 Introduction to software quality .

2007. Classifications of MAC protocols. MAC Protocols – Issues. “ Ad Hoc Wireless Networks – Architectures and Protocols”. QoS in WSN.11s Architecture – Opportunistic routing – Self configuration and Auto configuration – Capacity Models – Fairness – Heterogeneous Mesh Networks – Vehicular Mesh Networks. Pearson Education. Morgan Kaufman Publishers. Ad Hoc Transport Layer Issues. C. 2004. and Split TCP.Smanoj. Multi channel MAC & Power control MAC protocol. Gathering. Mesh based. “Wireless Sensor Networks”.241082 AD-HOC NETWORKS LTPC 3003 UNIT I AD-HOC MAC Introduction – Issues in Ad-Hoc Wireless Networks. UNIT II AD-HOC NETWORK ROUTING & TCP Issues – Classifications of routing protocols – Hierarchical and Power aware.Siva Ram Murthy and B. Data dissemination. 3. . Feng Zhao and Leonidas Guibas. “Wireless Mesh Networking”. MAC Protocols – self-organizing. REFERENCES: 1. 2. Localization – Indoor and Sensor Network Localization. 4. “Ad Hoc Mobile Wireless Networks”. AODV. Tree based. C. TCP Over Ad Hoc – Feedback based. Thomas Krag and Sebastin Buettrich. Ad Hoc TCP.K. UNIT III WSN -MAC Introduction – Sensor Network Architecture. O’Reilly Publishers. 2002.Toh. Hybrid TDMA/FDMA and CSMA based MAC. 2004. TCP-BuS. UNIT V MESH NETWORKS Necessity for Mesh Networks – MAC enhancements – IEEE 802. UNIT IV WSN ROUTING. TCP with explicit link. LOCALIZATION & QOS Issues in WSN routing – OLSR. Pearson Education. Multicast routing – Classifications.

Easter Economy Edition. Shyam Diwakar and V.Efficient and Scalable Frequent Item set Mining Methods – Mining Various Kinds of Association Rules – Association Mining to Correlation Analysis – ConstraintBased Association Mining. Michael Steinbach and Vipin Kumar “Introduction to Data Mining”. Cleanup. Gupta “Introduction to Data Mining with Case Studies”. Jiawei Han and Micheline Kamber “Data Mining Concepts and Techniques” Second Edition. 4. UNIT III 9 Classification and Prediction: . Multimedia. G. 2006. Soman. UNIT IV 9 Cluster Analysis: . Ajay “Insight into Data mining Theory and Practice”. 2006. 6. Data Mining & OLAP”. Text and Web Data: Multidimensional Analysis and Descriptive Mining of Complex Data Objects – Spatial Data Mining – Multimedia Data Mining – Text Mining – Mining the World Wide Web. Spatial. UNIT V Mining Object.241083 DATA WAREHOUSING AND DATA MINING LTPC 3003 UNIT I 9 Data Warehousing and Business Analysis: . UNIT II 9 Data Mining: . and Transformation Tools –Metadata – reporting – Query tools and Applications – Online Analytical Processing (OLAP) – OLAP and Multidimensional Data Analysis.Issues Regarding Classification and Prediction – Classification by Decision Tree Introduction – Bayesian Classification – Rule Based Classification – Classification by Back propagation – Support Vector Machines – Associative Classification – Lazy Learners – Other Classification Methods – Prediction – Accuracy and Error Measures – Evaluating the Accuracy of a Classifier or Predictor – Ensemble Methods – Model Section.Data warehousing Components –Building a Data warehouse – Mapping the Data Warehouse to a Multiprocessor Architecture – DBMS Schemas for Decision Support – Data Extraction.Data Mining Functionalities – Data Preprocessing – Data Cleaning – Data Integration and Transformation – Data Reduction – Data Discretization and Concept Hierarchy Generation.Types of Data in Cluster Analysis – A Categorization of Major Clustering Methods – Partitioning Methods – Hierarchical methods – Density-Based Methods – Grid-Based Methods – Model-Based Clustering Methods – Clustering High-Dimensional Data – ConstraintBased Cluster Analysis – Outlier Analysis. Tenth Reprint 2007. K. Tata McGraw – Hill Edition. Smith “Data Warehousing. Easter Economy Edition. 2. Pang-Ning Tan. Alex Berson and Stephen J. Association Rule Mining: . Prentice Hall of India. 9 . Elsevier. 2007. 5. Total = 45 REFERENCES 1. Reprinted 2008.P. K. 3. Pearson Education. Prentice Hall of India.

Delay. UNIT III 9 Markovian FIFO Queuing Systems – M/M/1 – M/M/a – M/M/∞ .Elsevier. Bertsekas. Nedic and A.Pearson Education.Michel. Network Analysis . 2 nd Edition.Capacity Regions . UNIT IV 9 Multi-User Uplinks/Downlinks . Massachusetts .Stochastic process –Link Delay components – Queuing Models – Little’s Theorem – Birth & Death process – Queuing Disciplines.2003 3.Fortier. TEXT BOOKS 1.Mir Computer and Communication Networks.Average Power Constraints . Nader F.Flow Control with Infinite Demand . Athena Scientific.Energy-Delay Tradeoffs Virtual Cost Queues . Ozdaglar.M/G/1 – M/M/m/m and other Markov-Non-Markovian and self-similar models – Network of Queues –Burke’s Theorem – Jackson’s Theorem.241084 PERFORMANCE EVALUATION OF COMPUTER SYSTEMS AND NETWORKS LTPC 3003 UNIT I 9 Performance Characteristics – Requirement Analysis: Concepts –User. Capacity Requirements – Flow Analysis – Identifying and Developing Flows –Flow Models –Flow Prioritization –Specification.2003 REFERENCES 1. Bertsekas & Gallager . James D.Flow Control with Finite Demand . Paul J. Elsevier.Energy Optimality. Network Requirements – Process –Developing RMA . Introduction to Probability Models by Sheldon Ross (8th edition) Academic Press. second edition . Howard E.2003 2. Architecture and Design .Auxiliary Variables . A.McCabe .Opportunistic Scheduling for Stability and Max Throughput .Throughput Optimality and Backpressure UNIT V 9 Performance of Optimal Lyapunov Networking . Convex Analysis and Optimization.2007 3. Device. UNIT II 9 Random variables . 2003 2.Multi-Hop Routing . Cambridge . New York . D. Data Networks . Computer Systems Performance Evaluation and Prediction.Pearson Education.Mobile Networks .2003 .General Utility Optimization.

J. UNIT IV AGENTS AND UNCERTAINITY 9 Acting under uncertainty – Probability Notation-Bayes Rule and use .Utility Theory .Nilsson. Narosa Publishing House. 1999. “An Introduction to Multi Agent System”. Stuart Russell and Peter Norvig. 2002 REFERENCES: 1. AW. III Edition.Game playing. Patrick Henry Winston.A Modern Approach”. UNIT II KNOWLEDGE REPRESENTATION AND REASONING Logical Agents-First order logic-First Order Inference-Unification-ChainingStrategies-Knowledge Representation-Objects-Actions-Events 9 Resolution UNIT III PLANNING AGENTS 9 Planning Problem-State Space Search-Partial Order Planning-Graphs-Nondeterministic Domains-Conditional Planning-Continuous Planning-MultiAgent Planning. 3. Principles of Artificial Intelligence.Foundations . Prentice Hall. Michael Wooldridge. Nils.History .Heuristics Constraint Satisfaction Problems .241085 AGENT BASED INTELLIGENT SYSTEMS LTPC 3003 UNIT I INTRODUCTION 9 Definitions .Decision Network – Complex Decisions. Artificial Intelligence. 2. 2002. 1992.Intelligent Agents-Problem Solving-Searching . John Wiley.Bayesian Networks-Other Approaches-Time and Uncertainty-Temporal Models. 2nd Edition.Future of AI. “Artificial Intelligence . Total No of periods: 45 TEXT BOOK: 1. . UNIT V HIGHER LEVEL AGENTS 9 Knowledge in Learning-Relevance Information-Statistical Learning Methods-Reinforcement Learning-Communication-Formal Grammar-Augmented Grammars.

Interaction UNIT II FOUNDATIONS FOR DATA VISUALIZATION 9 Visualization stages – Experimental Semiotics based on Perception Gibson‘s Affordance theory – A Model of Perceptual Processing – Types of Data. Robert Spence “Information visualization – Design for interaction”.Mackinlay and Ben Shneiderman. “Readings in Information Visualization Using Vision to think”. 2004. 2 nd Edition. UNIT IV MULTIDIMENSIONAL VISUALIZATION 9 One Dimension – Two Dimensions – Three Dimensions – Multiple Dimensions – Trees – Web Works – Data Mapping: Document Visualization – Workspaces. 2007 REFERENCES: 1.Card. Colin Ware. UNIT III COMPUTER VISUALIZATION 9 Non-Computer Visualization – Computer Visualization: Exploring Complex Information Spaces – Fisheye Views – Applications – Comprehensible Fisheye views – Fisheye views for 3D data – Non Linear Magnificaiton – Comparing Visualization of Information Spaces – Abstraction in computer Graphics – Abstraction in user interfaces.241086 VISUALIZATION TECHNIQUES LTPC 3003 9 UNIT I VISUALIZATION Introduction – Issues – Data Representation – Data Presentation . Stuart.K. Pearson Education. UNIT V CASE STUDIES 9 Small interactive calendars – Selecting one from many – Web browsing through a key hole – Communication analysis – Archival analysis TOTAL = 45 TEXT BOOKS: 1. Morgan Kaufmann Publishers. Jock. .D. 2nd edition. “Information Visualization Perception for Design” Margon Kaufmann Publishers. 2.

“Principles of Multimedia Database Systems”.Location Dependent Data Distribution . Pearson Education. “Database System Concepts”. 2006. A.”An Introduction to Database Systems”. Thomas Cannolly and Carolyn Begg. 2. 4. UNIT III XML DATABASES XML Databases: XML Data Model – DTD .Distributed Systems – Parallel Databases: I/O Parallelism – Inter and Intra Query Parallelism – Inter and Intra operation Parallelism – Distributed Database Concepts . C.Date. R.XML Schema . TOTAL = 45 REFERENCES 1. Pearson Education. “Fundamentals of Database Systems”. Sudharshan. Pearson Education/Addison Wesley. Languages and Design: ODMG Model – ODL – OQL – Object Relational and Extended – Relational Systems : Object Relational feature sin SQL/Oracle – Case Studies. Fifth Edition..B. 5.Mobile Database Recovery Schemes UNIT V MULTIMEDIA DATABASES Multidimensional Data Structures – Image Databases – Text/Document Databases.XML Querying – Web Databases – JDBC – Information Retrieval – Data Warehousing – Data Mining UNIT IV MOBILE DATABASES Mobile Databases: Location and Handoff Management .Subramanian.S. 2006. Harcourt India Pvt Ltd.241087 ADVANCED DATABASES LTPC 3003 UNIT I PARALLEL AND DISTRIBUTED DATA BASES Database System Architectures: Centralized and Client-Server Architectures – Server System Architectures – Parallel Systems.Effect of Mobility on Data Management . Abraham Silberschatz.Distributed Data Storage – Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing – Three Tier Client Server ArchitectureCase Studies.Mobile Transaction Models . “ Mobile Database Systems”. Vijay Kumar. 2001. Elmasri.Kannan and S.Swamynathan. Henry F Korth. UNIT II OBJECT AND OBJECT RELATIONAL DATABASES Concepts for Object Databases: Object Identity – Object structure – Type Constructors – Encapsulation of Operations – Methods – Persistence – Type and Class Hierarchies – Inheritance – Complex Objects – Object Database Standards.J. 2007.Concurrency Control Transaction Commit Protocols. V. 2007. “ Database Systems. Third Edition. Fifth Edition. Eighth Edition. S. McGraw Hill. S. Navathe. . 3. 6. Implementation and Management”. A Practical Approach to Design. 2006.Video Databases – Audio Databases – Multimedia Database Design. John Wiley & Sons.

A Practitioner’s approach. Process and Project – Definition – Product Life Cycle – Project Life Cycle Models. UNIT V ENGINEERING AND PEOPLE ISSUES IN PROJECT MANAGEMENT 9 Phases (Requirements. 1. 2001.1993. Gopalaswamy. 5.1986. 2.Roger.”Managing the Software Process “. Development. UNIT III UMBRELLA ACTIVITIES IN PROJECTS Metrics – Configuration Management – Software Quality Assurance – Risk Analysis. Tata McGraw Hill.1997. Humphrey.McGraw Hill.”Software Engineering”. Testing . Maintenance.”Software Project Management”. . Wheelwright and Clark.241088 SOFTWARE PROJECT MANAGEMENT LTPC 3003 UNIT I BASIC CONCEPTS 9 Product.”Revolutionising product development”. TOTAL=45 REFERENCES: Ramesh. "Managing Global Projects". UNIT II FORMAT PROCESS MODELS AND THEIR USE 9 Definition and Format model for a process – The ISO 9001 and CMM Models and their relevance to Project Management – Other Emerging Models like People CMM. Pressman. 9 UNIT IV IN STREAM ACTIVITIES IN PROJECTS 9 Project Initiation – Project Planning – Execution and Tracking – Project Wind up – Concept of Process/Project Database. Bob Hughes and Mike Cotterell. 4.The Free Press. 3. Deployment) – Engineering Activities and Management Issues in Each Phase – Special Considerations in Project Management for India and Geographical Distribution Issues.Addison Wesley. Design.Watts.

NET components assemblies – appdomains – contexts – reflection – remoting. “Enterprise Java Beans”. “Component Software: publishers. UNIT IV COM AND .241089 COMPONENT BASED TECHNOLOGY LTPC 3003 UNIT I INTRODUCTION 9 Software Components – objects – fundamental properties of Component technology – modules – interfaces – callbacks – directory services – component architecture – components and middleware.NET TECHNOLOGIES 9 COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces – connectable objects – OLE containers and servers – Active X controls – . Beyond Object-Oriented Programming”. UNIT III CORBA TECHNOLOGIES 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. Wiley . TOTAL = 45 TEXT BOOKS: 1. UNIT V COMPONENT FRAMEWORKS AND DEVELOPMENT 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 . Third Edition . UNIT II JAVA COMPONENT TECHNOLOGIES 9 Threads – Java Beans – Events and connections – properties – introspection – JAR files – reflection – object serialization – Enterprise Java Beans – Distributed Object models – RMI and RMI-IIOP. . Pearson Education REFERENCES: 1.assembly tools. Ed Roman. 2004. 2003.

2010 CURRICULUM AND SYLLABUS FOR III SEMESTER (FULL TIME) M.E. COURSE NO CODE THEORY 1 E2 2 E3 3 E4 PRACTICAL 4 241397 COURSE TITLE Elective II Elective III Elective IV Project Work (Phase I) TOTAL L 3 3 3 0 9 T 0 0 0 0 0 P 0 0 0 12 12 C 3 3 3 6 15 .COMPUTER SCIENCE AND ENGINEERING SEMESTER III SL.AFFILIATED INSTITUTIONS ANNA UNIVERSITY OF TECHNOLOGY CHENNAI CHENNAI 600 113 REGULATIONS .

E. NO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 COURSE CODE 241071 241072 241073 241074 250077 241075 241076 241077 241078 241079 241080 241081 241082 241083 241084 241085 241086 241087 241088 241089 COURSE TITLE Mobile Computing Grid Computing Theory of Computation Soft Computing Distributed Computing Multimedia Systems XML and Web Services Bio Informatics Network Security Embedded Systems Digital Imaging Software Quality Assurance Adhoc Networks Data Warehousing and Data Mining Performance Evaluation of Computer Systems and Networks Agent Based Intelligent Systems Visualization Techniques Advanced Databases Software Project Management Component Based Technology L 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 T 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 C 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 .COMPUTER SCIENCE AND ENGINEERING* SL.LIST OF ELECTIVES FOR M.

Kaveh Pahlavan. 2003. Prasanth Krishnamoorthy.Toh. “Pervasive Computing”. Burkhardt. Pearson Education. Jochen Schiller. 2. Pearson Education. “Mobile Communications”.11 Standards – Architecture – Services – HIPERLAN – Adhoc Network – Blue Tooth. REFERENCES: 1. 3. . William Stallings. First Edition. “Principles of Mobile Computing”. UNIT III WIRELESS NETWORKS 9 Wireless LAN – IEEE 802.K. 2. First Edition. 2002. Pearson Education. 2002. UNIT II TELECOMMUNICATION SYSTEMS 11 GSM – System Architecture – Protocols – Connection Establishment – Frequency Allocation – Routing – Handover – Security – GPRS. 4. C. Uwe Hansmann. Nicklons and Thomas Stober. “Wireless Communications and Networks”. TOTAL = 45 TEXT BOOKS: 1. Second Edition. Pearson Education. Lothar Merk. UNIT V TRANSPORT AND APPLICATION LAYERS 7 TCP over Wireless Networks – Indirect TCP – Snooping TCP – Mobile TCP – Fast Retransmit / Fast Recovery – Transmission/Timeout Freezing – Selective Retransmission – Transaction Oriented TCP – WAP – WAP Architecture – WDP – WTLS – WTP – WSP – WML –WML Script – WAE – WTA.241071 MOBILE COMPUTING LTPC 3003 UNIT I WIRELESS COMMUNICATION FUNDAMENTALS 9 Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks. 2003. UNIT IV NETWORK LAYER 9 Mobile IP – Dynamic Host Configuration Protocol – Routing – DSDV – DSR – AODV – ZRP – ODMR. Martin S. Pearson Education. First Edition. “AdHoc Mobile Wireless Networks”. 2003. Springer. 2003. “Principles of Wireless Networks”.

UNIT III GRID COMPUTING TECHNOLOGIES 11 OGSA – Sample use cases that drive the OGSA platform components – OGSI and WSRF– OGSA Basic Services – Security standards for grid computing. Pearson/PHI PTR-2003. John Wiley and sons. Hey. Geoffrey Fox.NET for Grid computing on Mobile devices. Present and Future – Applications of grid computing organizations and their roles. Fran Berman. 2. Anthony J.G. “Grid Computing: A Practical Guide to Technology and Applications”.241072 GRID COMPUTING LTPC 3003 UNIT I INTRODUCTION TO GRID COMPUTING 7 Introduction – The Grid – Past. UNIT IV GRID COMPUTING TOOL KIT 10 Globus Toolkit –Versions – Architecture –GT Programming model –A sample grid service implementation. Joshy Joseph & Craig Fellenstein. 2003. UNIT V HIGH LEVEL GRID SERVICES 9 High level grid services – OGSI . REFERENCES: 1. UNIT II GRID COMPUTING ARCHITURE 8 Grid Computing anatomy – Next generation of Grid computing initiatives–Merging the Grid services architecture with Web services architecture. .2003. TOTAL = 45 TEXT BOOKS: 1. Ahmar Abbas.NET middleware Solution Mobile OGSI. “Grid Computing”. “Grid Computing: Making the Global Infrastructure a reality “. Charles River media.

R. UNIT III CONTEXT FREE GRAMMAR AND LANGUAGES 9 CFG – Parse Trees – Ambiguity in Grammars and Languages – Definition of the Pushdown Automata – Languages of a Pushdown Automata – Equivalence of Pushdown Automata and CFG. UNIT IV PROPERTIES OF CONTEXT FREE LANGUAGES 9 Normal Forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing Machines – Programming Techniques for TM. .Lewis and C.Papadimitriou.D Ullman. The Class P And NP. 1997. “Introduction to Languages and the Theory of Computation”. 3.Martin. UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9 Regular Expression – FA and Regular Expressions – Proving Languages not to be regular – Closure Properties of Regular Languages – Equivalence and Minimization of Automata.Hopcroft. Second Edition. J. 2003. Languages and Computations”.Motwani and J. 2003. PHI. Pearson Education. Thomson Brokecole. TOTAL = 45 TEXT BOOKS: 1.E. 2003. H. UNIT V INDECIDABILITY 9 A Language That Is Not Recursive Enumerable – An Undecidable Problem that Is RE – Undecidable Problems about TM – Post’s Correspondence Problem. J.R. “Introduction of the Theory and Computation”.LTPC 3003 UNIT I AUTOMATA 9 Introduction to formal proof – Additional forms of Proof – Inductive Proofs –Finite Automata – Deterministic Finite Automata – No deterministic Finite Automata – Finite Automata with Epsilon Transitions. Second Edition. “Introduction to Automata Theory. Micheal Sipser. TMH. 241073 THEORY OF COMPUTATION REFERENCES: 1.H. Deterministic Pushdown Automata. Third Edition. “Elements of the theory of Computation”. 2.

Deepa. N.Soft Computing Constituents – From Conventional AI to Computational Intelligence . 2007. 2. Mitchell Melanie. S. Goldberg. Optimization and Machine Learning”. “ Introduction to Genetic Algorithms”. James A. Eiji Mizutani.Reinforcement Learning – Unsupervised Learning Neural Networks – Adaptive Resonance architectures – Advances in Neural networks. 2. S. TOTAL = 45 TEXT BOOKS: 1. 2003. 1992.Machine Learning Approach to Knowledge Acquisition. Prentice Hall. David E.241074 SOFT COMPUTING LTPC 3003 UNIT I INTRODUCTION TO SOFT COMPUTING AND NEURAL NETWORKS 9 Evolution of Computing . Pearson Edn. Jyh-Shing Roger Jang. 4. Springer. “Neural Networks Algorithms. Springer.Fuzzy Rules and Fuzzy Reasoning – Fuzzy Inference Systems – Fuzzy Expert Systems – Fuzzy Decision Making. Jacek M. UNIT III NEURAL NETWORKS 9 Machine Learning Using Neural Network. “Neuro-Fuzzy and Soft Computing”.. Zurada. UNIT IV FUZZY LOGIC 9 Fuzzy Sets – Operations on Fuzzy Sets – Fuzzy Relations – Membership Functions. 1995. Addison Wesley. Prentice-Hall of India. 2003. Sumathi and S.N. Klir and Bo Yuan.Machine Learning Basics UNIT II GENETIC ALGORITHMS 9 Introduction to Genetic Algorithms (GA) – Applications of GA in Machine Learning . “Introduction to Artificial Neural Systems”. Skapura. Freeman and David M. “Fuzzy Sets and Fuzzy Logic-Theory and Applications”. 3. N. 5. and Programming Techniques”. George J. Sivanandam. 1998. UNIT V NEURO-FUZZY MODELING 9 Adaptive Neuro-Fuzzy Inference Systems – Coactive Neuro-Fuzzy Modeling – Classification and Regression Trees – Data Clustering Algorithms – Rulebase Structure Identification – Neuro-Fuzzy Control – Case studies. 2007. Applications.N. Chuen-Tsai Sun. “An Introduction to Genetic Algorithm”. Adaptive Networks – Feed forward Networks – Supervised Learning Neural Networks – Radial Basis Function Networks .Sivanandam · S. “Introduction to Fuzzy Logic using MATLAB”. REFERENCES: 1. Deepa. “Genetic Algorithms in Search. S. 3. 1997. PWS Publishers. Prentice Hall. .

“Distributed Systems Concepts and Design”. UNIT IV FAULT TOLERANCE AND CONSENSUS 7 Introduction to Fault Tolerance – Distributed Commit Protocols – Byzantine Fault Tolerance – Impossibilities in Fault Tolerance. 5. “Distributed Computing: Fundamentals. 1994. 2002. UNIT V CASE STUDIES 8 Distributed Object-Based System – CORBA – COM+ – Distributed Coordination-Based System – JINI.L. Hagit Attiya and Jennifer Welch. 4.Van Steen. . Multicasting and Broadcasting – Group Communication. Pearson Education. Total= 45 REFERENCES: 1. “Distributed Computing Principles and Applications”. M. “Distributed Systems”. 2004.S. Tim Kindberg. McGrawHill Series in Computer Science. Pearson Education Asia. UNIT II DISTRIBUTED OPERATING SYSTEMS 12 Issues in Distributed Operating System – Threads in Distributed Systems – Clock Synchronization – Causal Ordering – Global States – Election Algorithms –Distributed Mutual Exclusion – Distributed Transactions – Distributed Deadlock – Agreement Protocols . Pearson Addison Wesley. Wiley. Mukesh Singhal. 3.250077 DISTRIBUTED COMPUTING LTPC 3003 UNIT I COMMUNICATION IN DISTRIBUTED ENVIRONMENT 8 Introduction – Various Paradigms in Distributed Applications – Remote Procedure Call – Remote Object Invocation – Message-Oriented Communication – Unicasting. Jean Dollimore. A. Third Edition. 2. George Coulouris. 2004. 2004. “Advanced Concepts In Operating Systems”.Liu. Simulations and Advanced Topics”. UNIT III DISTRIBUTED RESOURCE MANAGEMENT 10 Distributed Shared Memory – Data-Centric Consistency Models – Client-Centric Consistency Models – Ivy – Munin – Distributed Scheduling – Distributed File Systems – Sun NFS.Tanenbaum. M.

2002 5. and Networks. 9 Types-Multimedia Total No of periods: 45 TEXT BOOKS: 1. Prentice Hall. Multimedia Applications Development using DVI technology. Mark J. . UNIT IV COMMUNICATION 9 Transport Subsystem-Protocol Support for QOS-Transport of Multimedia-Computer Supported Cooperative Work-Architecture-Session Management-MBone Applications. UNIT III FILE SYSTEMS AND NETWORKS 9 Traditional and Multimedia File Systems-Caching Policy-Batching-Piggy backing-EthernetGigabit Ethernet-Token Ring-100VG Any LAN-Fiber Distributed Data Interface (FDDI). 2. Media Coding and Content Processing. 2004. “Multimedia Systems”. Vaughan T. 3. Dragorad A.M. Multimedia Communication Systems: Techniques. Prentice hall. 1999. Ralf Steinmetz and Klara Nahrstedt. I Edition 2004. A. Pearson. Rao. 1992. Milovacovic . Fundamentals of Multimedia. 4. Milovacovic. UNIT II OPERATING SYSTEMS 9 Real-Time Processing-Scheduling-Interprocess Communication-Memory and ManagementServer Architecture-Disk Management. Ralf Steinmetz and Klara Nahrstedt . Multimedia. McGraw Hill. D.241075 MULTIMEDIA SYSTEMS LTPC 3003 UNIT I INTRODUCTION AND QOS 9 Introduction-QOS Requirements and Constraints-Concepts-Resources. K. Sandra K. REFERENCES: 1. Zoran S. Drew.. Standards. 1st Edition.B.ATM Networks-MAN-WAN. Bojkovic.. Tata McGraw Hill. R. Ze-Nian Li and Mark S.Establishment PhaseRun-Time Phase-Management Architectures. UNIT V SYNCHRONIZATION Synchronization in Multimedia Systems-Presentation-Synchronization Synchronization Methods-Case Studies-MHEG-MODE-ACME. Springer. 2002.

Russ Basiura and Mike Batongbacal. Pearson Education. 4. Web Services and the Data Revolution”. 2. 2.E. Computer Science and Engineering.Tech. 2003. Ron Schmelzer et al. REFERENCES 1. 2002. 2004. “XML and Web Services”. “Professional ASP . Software Engineering and M. .NET Web Services”. Sandeep Chatterjee and James Webber. Frank P. Apress. Keith Ballinger. UNIT IV IMPLEMENTING XML IN E – BUSINESS 9 B2B – B2C Applications – Different types of B2B interaction – Components of e – business XML systems – ebXML – Rosetta Net Applied XML in vertical industry – web services for mobile devices. “XML. M.E. UNIT V XML AND CONTENT MANAGEMENT 9 Semantic Web – Role of Meta data in web content – Resource Description Framework – RDF schema – Architecture of semantic web – content management workflow – XLANG – WSFL . Pearson Education. Apress.E. Henry Bequet and Meeraj Kunnumpurath. Pearson Education. M.Coyle. TOTAL: 45 PERIODS TEXT BOOK 1. 3.241076 XML AND WEB SERVICES 3003 (Common to M. “Developing Enterprise Web Services: An Architect's Guide”. 2004.NET Web Services Architecture and Implementation”. Prentice Hall. 2003. Information Technology) UNIT I XML TECHNOLOGY FAMILY 9 XML – benefits – Advantages of XML over HTML – EDI – Databases – XML based standards – DTD – XML Schemas – X – Files – XML processing – DOM – SAX – presentation technologies – XSL – XFORMS – XHTML – voice XML – Transformation – XSLT – XLINK – XPATH – XQ UNIT II ARCHITECTING WEB SERVICES 9 Business motivations for web services – B2B – B2C – Technical motivations – limitations of CORBA and DCOM – Service – oriented Architecture (SOA) – Architecting web services – Implementation view – web services technology stack – logical view – composition of web services – deployment view – from application server to peer to peer – process view – life in the runtime UNIT III WEB SERVICES BUILDING BLOCK 9 Transport protocols for web services – messaging with web services – protocols – SOAP – describing web services – WSDL – Anatomy of WSDL – manipulating WSDL – web service policy – Discovering web services – UDDI – Anatomy of UDDI – Web service inspection – Ad – Hoc Discovery – Securing web services. “. Computer Communication. 2002. “Beginning Java Web Services”.

UNIT II SEARCH ENGINES AND DATA VISUALIZATION 9 The search process – Search Engine Technology – Searching and Information Theory – Computational methods – Search Engines and Knowledge Management – Data Visualization – sequence visualization – structure visualization – user Interface – Animation Versus simulation – General Purpose Technologies. “Introduction to Bio Informatics.241077 BIO INFORMATICS LTPC 3003 UNIT I INTRODUCTORY CONCEPTS The Central Dogma – The Killer Application – Parallel Universes – Watson’s Definition – Top Down Versus Bottom up – Information Flow – Convergence – Databases – Data Management – Data Life Cycle – Database Technology – Interfaces – Implementation – Networks – Geographical Scope – Communication Models – Transmissions Technology – Protocols – Bandwidth – Topology – Hardware – Contents – Security – Ownership – Implementation – Management. 2003.Issues – Security – Intellectual property. Bryan Bergeron. Second Edition. Perry Smith.J. 2. Total = 45 REFERENCES 1. UNIT III STATISTICS AND DATA MINING 9 Statistical concepts – Microarrays – Imperfect Data – Randomness – Variability – Approximation – Interface Noise – Assumptions – Sampling and Distributions – Hypothesis Testing – Quantifying Randomness – Data Analysis – Tool selection statistics of Alignment – Clustering and Classification – Data Mining – Methods – Selection and Sampling – Preprocessing and Cleaning – Transformation and Reduction – Data Mining Methods – Evaluation – Visualization – Designing new queries – Pattern Recognition and Discovery – Machine Learning – Text Mining – Tools.K. Longman Essen. UNIT V MODELING AND SIMULATION 9 Drug Discovery – components – process – Perspectives – Numeric considerations – Algorithms – Hardware – Issues – Protein structure – AbInitio Methods – Heuristic methods – Systems Biology – Tools – Collaboration and Communications – standards . 1999. UNIT IV PATTERN MATCHING 9 Pairwise sequence alignment – Local versus global alignment – Multiple sequence alignment – Computational methods – Dot Matrix analysis – Substitution matrices – Dynamic Programming – Word methods – Bayesian methods – Multiple sequence alignment – Dynamic Programming – Progressive strategies – Iterative strategies – Tools – Nucleotide Pattern Matching – Polypeptide pattern matching – Utilities – Sequence Databases. T.Attwood and D. “Bio Informatics Computing”. Pearson Education. .

Toha Wiley & Sons.Web Security. 1996. Prentice Hall.Classical And Modern Techniques – Encryption Algorithms . Stallings. Cryptography & Network Security . 3. “Internet Security”. UNIT IV NETWORK SECURITY PRACTICE Authentication.IP Security .Authentication Protocols. of Periods: 45 TEXT BOOK: 1. 3rd Edition 2002. UNIT V SYSTEM SECURITY Intruders – Viruses – Worms – Firewalls Design Principles – Trusted Systems. Pfleeger & Pfleeger. Bruce. REFERENCES: 1. 2003. 2003.Mechanisms . UNIT II PUBLIC KEY ENCRYPTION 9 RSA .Principles & Practice.Number Theory Concepts UNIT III MESSAGE AUTHENTICATION Hash Functions .Services .Conventional Encryption . . Man Young Rhee. 9 9 9 Total No. 2nd Edition.Elliptic Curve Cryptography . Applications .Confidentiality. Applied Cryptography. 2.Digest Functions .241078 NETWORK SECURITY LTPC 3003 UNIT I INTRODUCTION 9 Attacks . “Security in Computing”. Pearson Education. 3rd Edition.Electronic Mail Security . Schneier. Wiley.Digital Signatures .

Morgan Kaufmann / Elsevier. 3. 2. Pearson Education . edition. 2008. Embedded software development tools – Emulators and debuggers. D. “Embedded System Design” . Steve Heath. UNIT III OPTIMIZING ASSEMBLY CODE 9 Profiling and cycle counting – instruction scheduling – Register allocation – conditional execution – looping constructs – bit manipulation – efficient switches – optimized primitives. edition. Pont. Embedded processors – ARM processor – Architecture. Andrew N Sloss. Elsevier. ” ARM System Developers Guide”. ARM and Thumb Instruction sets UNIT II EMBEDDED C PROGRAMMING 9 C-looping structures – Register allocation – Function calls – Pointer aliasing – structure arrangement – bit fields – unaligned data and endianness – inline functions and inline assembly – portability issues. Wright. C. Michael J. 2nd. Design methodologies – Case studies – Complete design of example embedded systems.Performance issues. TOTAL = 45 REFERENCES 1. “Embedded C”. Morgan Kaufmann / Elsevier. UNIT V EMBEDDED SYSTEM DEVELOPMENT 9 Meeting real time constraints – Multi-state systems and function sequences. 2006. Symes. Wayne Wolf. 4. . 2003. UNIT IV PROCESSES AND OPERATING SYSTEMS 9 Multiple tasks and processes – Context switching – Scheduling policies – Interprocess communication mechanisms – Exception and interrupt handling . 2nd. 2007.241079 EMBEDDED SYSTEMS LTPC 3003 UNIT I EMBEDDED COMPUTING 9 Challenges of Embedded Systems – Embedded system design process. “Computers as Components : Principles of Embedded Computer System Design”.

“Fundamentals of Digital Image Processing”. DCT – Smoothing and Sharpening filters – Homomorphic Filtering. Person Educaiton. Analysis and Machine Vision”. UNIT V APPLICATIONS OF IMAGE PROCESSING 9 Image Classification – Image Recognition – Image Understanding – Video Motion Analysis – Image Fusion – Steganography – Digital Compositing – Mosaics – Colour Image Processing. 2001 Anil K. 2003. Image Compression : Fundamentals – Models – Elements of Information Theory – Error Free Compression – Lossy Compression – Compression Standards. Rafael C.Woods. FFT. UNIT IV MULTI RESOLUTION ANALYSIS AND COMPRESSIONS 9 Multi Resolution Analysis : Image Pyramids – Multi resolution expansion – Wavelet Transforms. UNIT II IMAGE ENHANCEMENT 9 Spatial Domain Gray level Transformations Histogram Processing Spatial Filtering – Smoothing and Sharpening. Milan Sonka. “Digital Image Processing” Second Edition.241080 DIGITAL IMAGING LTPC 3003 UNIT I FUNDAMENTALS OF IMAGE PROCESSING 9 Introduction – Steps in Image Processing Systems – Image Acquisition – Sampling and Quantization – Pixel Relationships – Colour Fundamentals and Models. UNIT III IMAGE SEGMENTATION AND FEATURE ANALYSIS 9 Detection of Discontinuities – Edge Operators – Edge Linking and Boundary Detection – Thresholding – Region Based Segmentation – Morphological WaterSheds – Motion Segmentation. 2. Thomson Learning.Gonzalez and Richard E. . . Vaclav Hlavac and Roger Boyle. “Image Processing.Jain. 3. Second Edition. Image operations – Arithmetic. Feature Analysis and Extraction. File Formats. Geometric and Morphological. Pearson Education.Frequency Domain : Filtering in Frequency Domain – DFT. 2003.. TOTAL = 45 REFERENCES: 1.

Pearson education. 2007 5. 2008 3. 2003 . assessment and enhancement UNIT III 9 Testing strategies – white box and black box approach – integration testing – system and acceptance testing – performance testing – regression testing .Daniel Galin. 2009. Aditya Mathur. “Software Quality Theory and Management”.test selection. 2006 4. Cengage Learning.challenges – objectives – quality factors – components of SQA – contract review – development and quality plans – SQA components in project life cycle – SQA defect removal policies – Reviews UNIT II 9 Basics of software testing – test generation from requirements – finite state models – combinatorial designs . second edition. UNIT V 9 Project progress control – costs – quality management standards – project process standards – management and its role in SQA – SQA unit TOTAL = 45 REFERENCES 1. Ron Patton. 2. Pearson education. Foundations of software testing. 1. Software testing . minimization and prioritization for regression testing – test adequacy. Pearson education. Pearson Education. Alan C Gillies. Software testing – principles and practices .internationalization testing – adhoc testing – website testing – usability testing – accessibility testing Test plan – management – execution and reporting – software test automation – automated testing tools UNIT IV 9 Hierarchical models of software quality – software quality metrics –function points -Software product quality – software maintenance quality – effect of case tools – software quality infrastructure – procedures – certifications – configuration management – documentation control.241081 SOFTWARE QUALITY ASSURANCE LTPC 3003 UNIT I 9 Introduction to software quality . Second edition. Srinivasan Desikan and Gopalaswamy Ramesh. Software quality assurance – from theory to implementation .

Feng Zhao and Leonidas Guibas. 2. Ad Hoc Transport Layer Issues. Gathering. O’Reilly Publishers. 2004. “ Ad Hoc Wireless Networks – Architectures and Protocols”. LOCALIZATION & QOS Issues in WSN routing – OLSR. Tree based. Thomas Krag and Sebastin Buettrich. UNIT III WSN -MAC Introduction – Sensor Network Architecture. UNIT V MESH NETWORKS Necessity for Mesh Networks – MAC enhancements – IEEE 802.Smanoj. C. MAC Protocols – Issues. “Ad Hoc Mobile Wireless Networks”. 2007. “Wireless Sensor Networks”. 2004. 2002. 3. REFERENCES: 1.K. Pearson Education. Multi channel MAC & Power control MAC protocol.241082 AD-HOC NETWORKS LTPC 3003 UNIT I AD-HOC MAC Introduction – Issues in Ad-Hoc Wireless Networks. Multicast routing – Classifications. and Split TCP.Toh. UNIT IV WSN ROUTING. Data dissemination. AODV. . Ad Hoc TCP. QoS in WSN. Morgan Kaufman Publishers.11s Architecture – Opportunistic routing – Self configuration and Auto configuration – Capacity Models – Fairness – Heterogeneous Mesh Networks – Vehicular Mesh Networks. Mesh based. Hybrid TDMA/FDMA and CSMA based MAC.Siva Ram Murthy and B. Localization – Indoor and Sensor Network Localization. UNIT II AD-HOC NETWORK ROUTING & TCP Issues – Classifications of routing protocols – Hierarchical and Power aware. TCP with explicit link. Classifications of MAC protocols. Pearson Education. TCP-BuS. TCP Over Ad Hoc – Feedback based. MAC Protocols – self-organizing. 4. “Wireless Mesh Networking”. C.

9 . Prentice Hall of India. Soman. Text and Web Data: Multidimensional Analysis and Descriptive Mining of Complex Data Objects – Spatial Data Mining – Multimedia Data Mining – Text Mining – Mining the World Wide Web. UNIT II 9 Data Mining: . Jiawei Han and Micheline Kamber “Data Mining Concepts and Techniques” Second Edition. 2006. K. Association Rule Mining: . Tata McGraw – Hill Edition. UNIT V Mining Object. UNIT IV 9 Cluster Analysis: . Reprinted 2008. G. Data Mining & OLAP”. 4. Easter Economy Edition. Pearson Education.Data warehousing Components –Building a Data warehouse – Mapping the Data Warehouse to a Multiprocessor Architecture – DBMS Schemas for Decision Support – Data Extraction. Michael Steinbach and Vipin Kumar “Introduction to Data Mining”. and Transformation Tools –Metadata – reporting – Query tools and Applications – Online Analytical Processing (OLAP) – OLAP and Multidimensional Data Analysis. 6. 2. 5. Easter Economy Edition. Spatial. 2007. Multimedia. Pang-Ning Tan. Gupta “Introduction to Data Mining with Case Studies”. Cleanup. Smith “Data Warehousing. Ajay “Insight into Data mining Theory and Practice”. Total = 45 REFERENCES 1.241083 DATA WAREHOUSING AND DATA MINING LTPC 3003 UNIT I 9 Data Warehousing and Business Analysis: .Efficient and Scalable Frequent Item set Mining Methods – Mining Various Kinds of Association Rules – Association Mining to Correlation Analysis – ConstraintBased Association Mining. Shyam Diwakar and V. Tenth Reprint 2007. Alex Berson and Stephen J.Data Mining Functionalities – Data Preprocessing – Data Cleaning – Data Integration and Transformation – Data Reduction – Data Discretization and Concept Hierarchy Generation.Issues Regarding Classification and Prediction – Classification by Decision Tree Introduction – Bayesian Classification – Rule Based Classification – Classification by Back propagation – Support Vector Machines – Associative Classification – Lazy Learners – Other Classification Methods – Prediction – Accuracy and Error Measures – Evaluating the Accuracy of a Classifier or Predictor – Ensemble Methods – Model Section.P.Types of Data in Cluster Analysis – A Categorization of Major Clustering Methods – Partitioning Methods – Hierarchical methods – Density-Based Methods – Grid-Based Methods – Model-Based Clustering Methods – Clustering High-Dimensional Data – ConstraintBased Cluster Analysis – Outlier Analysis. 2006. K. 3. Elsevier. Prentice Hall of India. UNIT III 9 Classification and Prediction: .

Pearson Education. Nedic and A. TEXT BOOKS 1. Ozdaglar.Average Power Constraints . second edition . Computer Systems Performance Evaluation and Prediction.M/G/1 – M/M/m/m and other Markov-Non-Markovian and self-similar models – Network of Queues –Burke’s Theorem – Jackson’s Theorem. New York . Massachusetts .2007 3. Capacity Requirements – Flow Analysis – Identifying and Developing Flows –Flow Models –Flow Prioritization –Specification. 2 nd Edition.2003 . 2003 2.2003 2.Multi-Hop Routing . UNIT II 9 Random variables .Opportunistic Scheduling for Stability and Max Throughput . Elsevier.Mir Computer and Communication Networks. Bertsekas & Gallager . Data Networks .Capacity Regions .Elsevier. Nader F.Pearson Education.Delay. UNIT III 9 Markovian FIFO Queuing Systems – M/M/1 – M/M/a – M/M/∞ . Device. Paul J. D.Mobile Networks .Energy Optimality.Flow Control with Infinite Demand . Athena Scientific. Network Analysis .McCabe .Fortier. James D.2003 3. UNIT IV 9 Multi-User Uplinks/Downlinks .Stochastic process –Link Delay components – Queuing Models – Little’s Theorem – Birth & Death process – Queuing Disciplines. Convex Analysis and Optimization.Energy-Delay Tradeoffs Virtual Cost Queues . Architecture and Design .Flow Control with Finite Demand .Auxiliary Variables . Bertsekas.Throughput Optimality and Backpressure UNIT V 9 Performance of Optimal Lyapunov Networking .2003 REFERENCES 1. Network Requirements – Process –Developing RMA . Howard E. A. Cambridge . Introduction to Probability Models by Sheldon Ross (8th edition) Academic Press.241084 PERFORMANCE EVALUATION OF COMPUTER SYSTEMS AND NETWORKS LTPC 3003 UNIT I 9 Performance Characteristics – Requirement Analysis: Concepts –User.General Utility Optimization.Michel.

Total No of periods: 45 TEXT BOOK: 1.Bayesian Networks-Other Approaches-Time and Uncertainty-Temporal Models. AW. . 3. 2002 REFERENCES: 1.J. Michael Wooldridge.Heuristics Constraint Satisfaction Problems .Foundations . 2nd Edition. Patrick Henry Winston.241085 AGENT BASED INTELLIGENT SYSTEMS LTPC 3003 UNIT I INTRODUCTION 9 Definitions . Prentice Hall.Utility Theory .Intelligent Agents-Problem Solving-Searching . Artificial Intelligence. John Wiley. Principles of Artificial Intelligence. III Edition. UNIT II KNOWLEDGE REPRESENTATION AND REASONING Logical Agents-First order logic-First Order Inference-Unification-ChainingStrategies-Knowledge Representation-Objects-Actions-Events 9 Resolution UNIT III PLANNING AGENTS 9 Planning Problem-State Space Search-Partial Order Planning-Graphs-Nondeterministic Domains-Conditional Planning-Continuous Planning-MultiAgent Planning. 1999.History .Nilsson.A Modern Approach”.Future of AI. “Artificial Intelligence . 2002. Stuart Russell and Peter Norvig.Decision Network – Complex Decisions. Nils. UNIT V HIGHER LEVEL AGENTS 9 Knowledge in Learning-Relevance Information-Statistical Learning Methods-Reinforcement Learning-Communication-Formal Grammar-Augmented Grammars. “An Introduction to Multi Agent System”. 2. Narosa Publishing House.Game playing. 1992. UNIT IV AGENTS AND UNCERTAINITY 9 Acting under uncertainty – Probability Notation-Bayes Rule and use .

Stuart. “Information Visualization Perception for Design” Margon Kaufmann Publishers. Colin Ware. 2 nd Edition. 2nd edition.Interaction UNIT II FOUNDATIONS FOR DATA VISUALIZATION 9 Visualization stages – Experimental Semiotics based on Perception Gibson‘s Affordance theory – A Model of Perceptual Processing – Types of Data.241086 VISUALIZATION TECHNIQUES LTPC 3003 9 UNIT I VISUALIZATION Introduction – Issues – Data Representation – Data Presentation .Card. UNIT IV MULTIDIMENSIONAL VISUALIZATION 9 One Dimension – Two Dimensions – Three Dimensions – Multiple Dimensions – Trees – Web Works – Data Mapping: Document Visualization – Workspaces. Jock. 2. Robert Spence “Information visualization – Design for interaction”.K.D. “Readings in Information Visualization Using Vision to think”. UNIT III COMPUTER VISUALIZATION 9 Non-Computer Visualization – Computer Visualization: Exploring Complex Information Spaces – Fisheye Views – Applications – Comprehensible Fisheye views – Fisheye views for 3D data – Non Linear Magnificaiton – Comparing Visualization of Information Spaces – Abstraction in computer Graphics – Abstraction in user interfaces. . Morgan Kaufmann Publishers. 2007 REFERENCES: 1.Mackinlay and Ben Shneiderman. Pearson Education. UNIT V CASE STUDIES 9 Small interactive calendars – Selecting one from many – Web browsing through a key hole – Communication analysis – Archival analysis TOTAL = 45 TEXT BOOKS: 1. 2004.

5. Third Edition. “Database System Concepts”. Vijay Kumar.Date. S. Thomas Cannolly and Carolyn Begg.XML Schema . .Mobile Database Recovery Schemes UNIT V MULTIMEDIA DATABASES Multidimensional Data Structures – Image Databases – Text/Document Databases.Distributed Systems – Parallel Databases: I/O Parallelism – Inter and Intra Query Parallelism – Inter and Intra operation Parallelism – Distributed Database Concepts . UNIT III XML DATABASES XML Databases: XML Data Model – DTD . John Wiley & Sons. R.Mobile Transaction Models .S. UNIT II OBJECT AND OBJECT RELATIONAL DATABASES Concepts for Object Databases: Object Identity – Object structure – Type Constructors – Encapsulation of Operations – Methods – Persistence – Type and Class Hierarchies – Inheritance – Complex Objects – Object Database Standards. “Fundamentals of Database Systems”. V.Distributed Data Storage – Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing – Three Tier Client Server ArchitectureCase Studies. “ Database Systems.B. 4. 2007. “ Mobile Database Systems”. Sudharshan.XML Querying – Web Databases – JDBC – Information Retrieval – Data Warehousing – Data Mining UNIT IV MOBILE DATABASES Mobile Databases: Location and Handoff Management . 3. C. Pearson Education/Addison Wesley. Fifth Edition.Subramanian. McGraw Hill. Fifth Edition.Swamynathan.Location Dependent Data Distribution . Pearson Education.”An Introduction to Database Systems”. “Principles of Multimedia Database Systems”.Effect of Mobility on Data Management .Video Databases – Audio Databases – Multimedia Database Design. 2006. A Practical Approach to Design. Elmasri.241087 ADVANCED DATABASES LTPC 3003 UNIT I PARALLEL AND DISTRIBUTED DATA BASES Database System Architectures: Centralized and Client-Server Architectures – Server System Architectures – Parallel Systems. TOTAL = 45 REFERENCES 1. 2007. S. 2.J. Implementation and Management”. Navathe. Languages and Design: ODMG Model – ODL – OQL – Object Relational and Extended – Relational Systems : Object Relational feature sin SQL/Oracle – Case Studies.Kannan and S. 6. Eighth Edition. Harcourt India Pvt Ltd. Abraham Silberschatz. Pearson Education.Concurrency Control Transaction Commit Protocols. 2001.. 2006. Henry F Korth. 2006. A.

Process and Project – Definition – Product Life Cycle – Project Life Cycle Models.Watts.”Revolutionising product development”. UNIT III UMBRELLA ACTIVITIES IN PROJECTS Metrics – Configuration Management – Software Quality Assurance – Risk Analysis. 2001.Roger. Tata McGraw Hill. Deployment) – Engineering Activities and Management Issues in Each Phase – Special Considerations in Project Management for India and Geographical Distribution Issues. 1.McGraw Hill. Development. UNIT II FORMAT PROCESS MODELS AND THEIR USE 9 Definition and Format model for a process – The ISO 9001 and CMM Models and their relevance to Project Management – Other Emerging Models like People CMM.”Managing the Software Process “.1993. 9 UNIT IV IN STREAM ACTIVITIES IN PROJECTS 9 Project Initiation – Project Planning – Execution and Tracking – Project Wind up – Concept of Process/Project Database.1997. TOTAL=45 REFERENCES: Ramesh.241088 SOFTWARE PROJECT MANAGEMENT LTPC 3003 UNIT I BASIC CONCEPTS 9 Product.”Software Engineering”. "Managing Global Projects". Testing . 3.The Free Press. Pressman.”Software Project Management”. . Bob Hughes and Mike Cotterell.A Practitioner’s approach. UNIT V ENGINEERING AND PEOPLE ISSUES IN PROJECT MANAGEMENT 9 Phases (Requirements. Wheelwright and Clark. Gopalaswamy.1986. 4. Humphrey. Design.Addison Wesley. 2. 5. Maintenance.

UNIT III CORBA TECHNOLOGIES 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. Ed Roman. UNIT V COMPONENT FRAMEWORKS AND DEVELOPMENT 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 . UNIT IV COM AND . Third Edition . UNIT II JAVA COMPONENT TECHNOLOGIES 9 Threads – Java Beans – Events and connections – properties – introspection – JAR files – reflection – object serialization – Enterprise Java Beans – Distributed Object models – RMI and RMI-IIOP. 2004. Beyond Object-Oriented Programming”.assembly tools. 2003. TOTAL = 45 TEXT BOOKS: 1. Pearson Education REFERENCES: 1.NET components assemblies – appdomains – contexts – reflection – remoting. Wiley .241089 COMPONENT BASED TECHNOLOGY LTPC 3003 UNIT I INTRODUCTION 9 Software Components – objects – fundamental properties of Component technology – modules – interfaces – callbacks – directory services – component architecture – components and middleware. “Component Software: publishers. “Enterprise Java Beans”.NET TECHNOLOGIES 9 COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces – connectable objects – OLE containers and servers – Active X controls – . .

AFFILIATED INSTITUTIONS ANNA UNIVERSITY OF TECHNOLOGY CHENNAI CHENNAI 600 113 REGULATIONS . COURSE NO CODE PRACTICAL 1 241498 COURSE TITLE Project Work (Phase II) TOTAL L 0 0 T 0 0 P 24 24 C 12 12 .COMPUTER SCIENCE AND ENGINEERING SEMESTER IV SL.E.2010 CURRICULUM FOR IV SEMESTER (FULL TIME) M.