ME CSE II Semester Syllabus

ME CSE II Semester Syllabus

CS9221 DATABASE TECHNOLOGY

UNIT I DISTRIBUTED DATABASES

Distributed Databases Vs Conventional Databases – Architecture – Fragmentation – Query

Processing – Transaction Processing – Concurrency Control – Recovery.

UNIT II OBJECT ORIENTED DATABASES

Introduction to Object Oriented Data Bases - Approaches - Modeling and Design - Persistence –

Query Languages - Transaction - Concurrency – Multi Version Locks - Recovery.

UNIT III EMERGING SYSTEMS

Enhanced Data Models - Client/Server Model - Data Warehousing and Data Mining - Web

Databases – Mobile Databases.

UNIT IV DATABASE DESIGN ISSUES

ER Model - Normalization - Security - Integrity - Consistency - Database Tuning - Optimization

and Research Issues – Design of Temporal Databases – Spatial Databases.

UNIT V CURRENT ISSUES

Rules - Knowledge Bases - Active And Deductive Databases - Parallel Databases – Multimedia

Databases – Image Databases – Text Database

REFERENCES:

1. Elisa Bertino, Barbara Catania, Gian Piero Zarri, “Intelligent Database Systems”,

Addison-Wesley, 2001.

2. Carlo Zaniolo, Stefano Ceri, Christos Faloustsos, R.T.Snodgrass, V.S.Subrahmanian,

“Advanced Database Systems”, Morgan Kaufman, 1997.

3. N.Tamer Ozsu, Patrick Valduriez, “Principles Of Distributed Database Systems”,

    Prentice Hal International Inc., 1999.

4. C.S.R Prabhu, “Object-Oriented Database Systems”, Prentice Hall Of India, 1998.

5. Abdullah Uz Tansel Et Al, “Temporal Databases: Theory, Design And Principles”,

    Benjamin Cummings Publishers, 1993.

6. Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”, Mcgraw

    Hill, Third Edition 2004.

7. Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”,

    Fourth Ediion, Mcgraw Hill, 2002.

8. R. Elmasri, S.B. Navathe, “Fundamentals Of Database Systems”, Pearson Education,

    2004.

CS9222 ADVANCED OPERATING SYSTEMS

UNIT I

INTRODUCTION 9

Overview - Functions of an Operating System – Design Approaches – Types of Advanced Operating System - Synchronization Mechanisms – Concept of a Process, Concurrent Processes – The Critical Section Problem, Other Synchronization Problems – Language Mechanisms for Synchronization – Axiomatic Verification of Parallel Programs – Process Deadlocks - Preliminaries – Models of Deadlocks, Resources, System State – Necessary and Sufficient conditions for a Deadlock – Systems with Single-Unit Requests, Consumable

Resources, Reusable Resources.

UNIT II

DISTRIBUTED OPERATING SYSTEMS

Introduction – Issues – Communication Primitives – Inherent Limitations - Lamport’s Logical Clock; Vector Clock; Causal Ordering; Global State; Cuts; Termination Detection. Distributed Mutual Exclusion – Non-Token Based Algorithms – Lamport’s Algorithm - Token-Based Algorithms – Suzuki-Kasami’s Broadcast Algorithm – Distributed Deadlock Detection – Issues – Centralized Deadlock-Detection Algorithms - Distributed Deadlock-Detection Algorithms.

Agreement Protocols – Classification - Solutions –Applications.

UNIT III

DISTRIBUTED RESOURCE MANAGEMENT

Distributed File systems – Architecture – Mechanisms – Design Issues – Distributed Shared Memory – Architecture – Algorithm – Protocols - Design Issues. Distributed Scheduling – Issues – Components – Algorithms.

UNIT IV

FAILURE RECOVERY AND FAULT TOLERANCE

Basic Concepts-Classification of Failures – Basic Approaches to Recovery; Recovery in Concurrent System; Synchronous and Asynchronous Checkpointing and Recovery; Check pointing in Distributed Database Systems; Fault Tolerance; Issues - Two-phase and Nonblocking Commit Protocols; Voting Protocols; Dynamic Voting Protocols;

UNIT V MULTIPROCESSOR AND DATABASE OPERATING SYSTEMS

Structures – Design Issues – Threads – Process Synchronization – Processor Scheduling – Memory Management – Reliability / Fault Tolerance; Database Operating Systems – Introduction – Concurrency Control – Distributed Database Systems – Concurrency Control Algorithms.

TEXT BOOKS:

1. Mukesh Singhal and N. G. Shivaratri, “Advanced Concepts in Operating Systems”,

McGraw-Hill, 2000

REFERENCES: .

1. Abraham Silberschatz, Peter B. Galvin, G. Gagne, “Operating System Concepts”,

   Sixth Edition, Addison Wesley Publishing Co., 2003.

2. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison

    Wesley, 2001.

CS9223 ADVANCED SYSTEM SOFTWARE

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, Virtual Memory, Process  Creation – Overview of I/O Systems, Device Drivers, System Boot

UNIT II

Introduction and Overview – Symbol table structure – Local and Global Symbol table management Intermediate representation – Issues – High level, medium level, low level intermediate languages – MIR, HIR, LIR – ICAN for Intermediate code – Optimization – Early optimization – loop optimization

UNIT III

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

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

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. Steven S. Muchnick, “Advanced Compiler Design Implementation”, Morgan Koffman –

    Elsevier Science, India, First Edition 2004

2. James E Smith and Ravi Nair, “Virtual Machines”, Elsevier, 2005. (Units 4, 5) (Sections

    1.0-1.6, 2.0-2.5, 2.8, 3.0-3.6, 4.2, 5.0-5.3, 5.5-5.6, 6.0-6.3, 6.5-6.6, 10.2, 10.3)

3. Robert W. Sebesta, “Concepts of Programming Languages”, 7th ed., Pearson Education,

   2006. (Unit 3) (Sections 6.9, 9.3, 9.5, 10.1-10.3, 12.10.2)

CS9224 INFORMATION SECURITY

UNIT I

An Overview of Computer Security, Access Control Matrix, Policy-Security policies, Confidentiality policies, Integrity policies and Hybrid policies.

UNIT II

Cryptography- Key management – Session and Interchange keys, Key exchange and generation, Cryptographic Key Infrastructure, Storing and Revoking Keys, Digital Signatures, Cipher Techniques

UNIT III

Systems: Design Principles, Representing Identity, Access Control Mechanisms, Information Flow and Confinement Problem.

UNIT IV

Malicious Logic, Vulnerability Analysis, Auditing and Intrusion Detection

UNIT V

Network Security, System Security, User Security and Program Security

TEXT BOOK

1. Matt Bishop ,“Computer Security art and science ”, Second Edition, Pearson Education

REFERENCES

1. Mark Merkow, James Breithaupt “ Information Security : Principles and Practices” First

    Edition, Pearson Education,

2. Whitman, “Principles of Information Security”, Second Edition, Pearson Education

3. William Stallings, “Cryptography and Network Security: Principles and Practices”, Third

    Edition, Pearson Education.

4. “Security in Computing ”, Charles P.Pfleeger and Shari Lawrence Pfleeger, Third

    Edition.

CS9225 WEB TECHNOLOGY

UNIT I

Web essentials – clients – servers - communication – markup languages – XHTML – simple XHTML pages style sheets – CSS

UNIT II

Client side programming – Java script language – java script objects – host objects : Browsers and the DOM

UNIT III

Server side programming – java servlets – basics – simple program – separating programming and presentation – ASP/JSP - JSP basics ASP/JSP objects – simple ASP/JSP pages. 

UNIT IV

Representing Web data – data base connectivity – JDBC – Dynamic Web pages – XML – DTD – XML schema – DOM – SAX – Xquery.

UNIT V

Building Web applications - cookies – sessions – open source environment – PHP – MYSQL – case studies.

TEXT BOOKS

1. Jeffrey C Jackson, “ Web Technology – A computer Science perspective”, Persoson

    Education, 2007.

2. Chris Bates, “Web Programming – Building Internet Applications, “Wiley India, 2006.

ELECTIVES

CS9251 MOBILE COMPUTING

UNIT I

WIRELESS COMMUNICATION FUNDAMENTALS

Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks.

UNIT II

TELECOMMUNICATION SYSTEMS

GSM – System Architecture – Protocols – Connection Establishment – Frequency Allocation – Routing – Handover – Security – GPRS.

UNIT III

WIRELESS NETWORKS

Wireless LAN – IEEE 802.11 Standards – Architecture – Services – HIPERLAN – Adhoc Network – Blue Tooth.

UNIT IV

NETWORK LAYER

Mobile IP – Dynamic Host Configuration Protocol – Routing – DSDV – DSR – AODV – ZRP – ODMR.

UNIT V

TRANSPORT AND APPLICATION LAYERS

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.

TEXT BOOKS:

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

2. William Stallings, “Wireless Communications and Networks”, Pearson Education, 2002.

REFERENCES:

1. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”,

    First Edition, Pearson Education, 2003.

2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles

    of Mobile Computing”, Springer, 2003.

3. C.K.Toh, “AdHoc Mobile Wireless Networks”, First Edition, Pearson Education,

    2002.

4. Burkhardt, “Pervasive Computing”, First Edition, Pearson Education, 2003.

CS9252 GRID COMPUTING

UNIT I

INTRODUCTION TO GRID COMPUTING

Introduction – The Grid – Past, Present and Future – Applications of grid computing organizations and their roles.

UNIT II

GRID COMPUTING ARCHITURE

Grid Computing anatomy – Next generation of Grid computing initiatives–Merging the Grid services architecture with Web services architecture.

UNIT III GRID COMPUTING TECHNOLOGIES

OGSA – Sample use cases that drive the OGSA platform components – OGSI and WSRF– OGSA Basic Services – Security standards for grid computing.

UNIT IV GRID COMPUTING TOOL KIT

Globus Toolkit –Versions – Architecture –GT Programming model –A sample grid service implementation.

UNIT V HIGH LEVEL GRID SERVICES

High level grid services – OGSI .NET middleware Solution Mobile OGSI.NET for Grid computing on Mobile devices.

TEXT BOOKS:

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

REFERENCES:

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

Infrastructure a reality “, John Wiley and sons,2003.

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

Charles River media, 2003.

  

CS9253 THEORY OF COMPUTATION

UNIT I

AUTOMATA

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

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

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

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.  

TEXT BOOKS:

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

REFERENCES:

1. H.R.Lewis and C.H.Papadimitriou, “Elements of the theory of Computation”, Second

Edition, PHI, 2003.

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

TMH, 2003.

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

1997.

CS9254 SOFT COMPUTING

UNIT I

INTRODUCTION TO SOFT COMPUTING AND NEURAL NETWORKS 

Evolution of Computing - Soft Computing Constituents – From Conventional AI to Computational Intelligence - Machine Learning Basics 

UNIT II

GENETIC ALGORITHMS

Introduction to Genetic Algorithms (GA) – Applications of GA in Machine Learning - Machine Learning Approach to Knowledge Acquisition.

UNIT III

NEURAL NETWORKS

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

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

Adaptive Neuro-Fuzzy Inference Systems – Coactive Neuro-Fuzzy Modeling – Classification and Regression Trees – Data Clustering Algorithms – Rulebase Structure Identification – Neuro-Fuzzy Control – Case studies.

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. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998.

2. David E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine

Learning”, Addison Wesley, 1997.

3. S. N. Sivanandam, S. Sumathi and S. N. Deepa, “Introduction to Fuzzy

Logic using MATLAB”, Springer, 2007.

4. S.N.Sivanandam · S.N.Deepa, “ Introduction to Genetic Algorithms”, Springer, 2007.

5. Jacek M. Zurada, “Introduction to Artificial Neural Systems”, PWS Publishers, 1992.