VI SEMESTER

COMPILER CONSTRUCTION
Sub code: 07CS61/07IS61 Hours/Week:4+1+0 Total Hours: 48 Exam Hours: 3 Credits: 04 CIE:50 SEE: 50

UNIT I 9 Hrs Introduction to compilers: Compilers and translators, why do we need translators?, the structure of a compiler, Lexical Analysis, Syntax analysis, Intermediate Code generation, Optimization, Code generation, Bookkeeping, Error handling, Compiler-writing tools, Bootstrapping Lexical Analysis: - The role of lexical analyzer, A simple approach to the design of lexical analyzer, Lex tool, Syntax Analysis-I: Shift reduce parsing, Computation of FIRST and FOLLOW sets. UNIT II 10 Hrs Basic Parsing Techniques: Top down parsing. Automatic Construction of efficient parsers: LR parsers, The canonical collection of LR(0) items, Constructing SLR parsing tables, Constructing canonical LR parsing tables, Constructing LALR parsing tables, Using ambiguous grammars, An automatic parser generator, Implementation of LR parsing tables, Constructing LALR sets of items. UNIT III 10 Hrs Syntax Directed Translation: Syntax directed translation schemes, Implementation of Syntax-directed translators, Intermediate code, Postfix notation, Parse trees and syntax trees, Three-address code, quadruples, and triples, Translation of assignment statements, Boolean expressions, Statements that alter the flow of control, Postfix translations, Translation with a top-down parser. More about Translation: Procedure calls & Record Structures, Symbol Tables: The contents of a symbol table, Data structures for symbol tables, Representing scope information. UNIT IV 10 Hrs Run time Storage Administration: Implementation of simple stack allocation scheme, Implementation of block structured languages;Error Detection and Recovery: Errors, Lexical-phase errors, Syntactic-phase errors, Semantic errors.Intermediate code generation Intermediate languages, Graphical representation, Three-address code, Implementation of three address statements (Quadruples, Triples, Indirect triples). UNIT V 9 Hrs Code optimization: Introduction, Basic blocks & flow graphs, Transformation of basic blocks, Dag representation of basic blocks, The principle sources of optimization, Loops in flow graph, Peephole optimization. Code generations Issues in the design of code generator, a simple code generator, Register allocation & assignment. TEXT BOOKS 1. Principles of Compiler Design Alfred V. Aho, Jeffrey D. Ullman, Narosa Publishing 2. Compilers Principles, Techniques and Tools, Aho, Ravi Sethi, JD Ullman, Pearson Education/Prentice Hall of India REFERENCE BOOKS Allen I.Holub, Compiler Design in C, PHI. 2. The Theory and Practical of Compiler Writing, Jean-Paul Trembly, Paul G. Sorenson, BSPublications 3. Compiler Construction : Principle and Practice by Louden ,Cengage Publications.

FILE STRUCTURES
Sub code: 08IS62 Hours/Week: 4+1+0 Total Hours: 48 Exam Hours: 03 Credits: 04 CIE: 50 SEE: 50

Unit-I Introduction 12 Hrs File Structures: The Heart of the file structure Design, A Short History of File Structure Design, A Conceptual Toolkit; Fundamental File Operations: Physical Files and Logical Files, Opening Files, Closing Files, Reading and Writing, Seeking, Special Characters, The Unix Directory Structure, Physical devices and Logical Files, File-related Header Files, UNIX file System Commands; Secondary Storage and System Software: Disks, Magnetic Tape, Disk versus Tape; CD-ROM: Introduction, Physical Organization, Strengths and Weaknesses; Storage as Hierarchy, A journey of a Byte, Buffer Management, Input /Output in UNIX. Fundamental File Structure Concepts, Managing Files of Records

Field and Record Organization, Using Classes to Manipulate Buffers, Using Inheritance for Record Buffer Classes, Managing Fixed Length, Fixed Field Buffers, An Object-Oriented Class for Record Files, Record Access, More about Record Structures, Encapsulating Record Operations in a Single Class, File Access and File Organization. Unit-II Organization of Files for Performance, Indexing 10 Hrs Data Compression, Reclaiming Space in files, Internal Sorting and Binary Searching, Keysorting; What is an Index? A Simple Index for EntrySequenced File, Using Template Classes in C++ for Object I/O, Object-Oriented support for Indexed, Entry-Sequenced Files of Data Objects, Indexes that are too large to hold in Memory, Indexing to provide access by Multiple keys, Retrieval Using Combinations of Secondary Keys, Improving the Secondary Index structure: Inverted Lists, Selective indexes, Binding. Unit-III Cosequential Processing and the Sorting of Large Files 10 Hrs A Model for Implementing Cosequential Processes, Application of the Model to a General Ledger Program, Extension of the Model to include Mutiway Merging, A Second Look at Sorting in Memory, Merging as a Way of Sorting Large Files on Disk. Unit- IV Multi-Level Indexing and B-Trees 10 Hrs The invention of B-Tree, Statement of the problem, Indexing with Binary Search Trees; Multi-Level Indexing, B-Trees, Example of Creating a B-Tree, An Object-Oriented Representation of B-Trees, BTree Methods; Nomenclature, Formal Definition of B-Tree Properties, Worst-case Search Depth, Deletion, Merging and Redistribution, Redistribution during insertion; B* Trees, Buffering of pages; Virtual BTrees; Variablelength Records and keys. Indexed Sequential File Access and Prefix B + Trees Indexed Sequential Access, Maintaining a Sequence Set, Adding a Simple Index to the Sequence Set, The Content of the Index: Separators Instead of Keys, The Simple Prefix B+ Tree and its maintenance, Index Set Block Size, Internal Structure of Index Set Blocks: A Variable-order B- Tree, Loading a Simple Prefix B+ Trees, B-Trees, B+ Trees and Simple Prefix B+ Trees in Perspective. Unit-V Hashing 6 Hrs Introduction, A Simple Hashing Algorithm, Hashing Functions and Record Distribution, How much Extra Memory should be used?, Collision resolution by progressive overflow, Buckets, Making deletions, Other collision resolution techniques, Patterns of record access. Text Books: 1. Michael J. Folk, Bill Zoellick, Greg Riccardi: File Structures-An Object Oriented Approach with C++, 3rd Edition, Addison-Wesley, 1998. Reference Books: 1. K.R. Venugopal, K.G. Srinivas, P.M. Krishnaraj File Structures Using C++, Tata McGraw-Hill, 2008. 2. Scot Robert Ladd C++ Components and Algorithms, BPB Publications, 1993. 3. Raghu Ramakrishan and Johannes Gehrke Database Management Systems, 3rd Edition, McGraw Hill, 2003.

COMPUTER NETWORKS II
Sub code: 08IS63/08CS63 Hours/Week: 4+1+0 Total Hours: 48 Exam Hours: 03 Credits: 04 CIE: 50 SEE: 50

UNIT I: THE NETWORK LAYER 10 hrs Network Layer Design Issues, Routing Algorithms, Congestion Control Algorithms, Quality of Service, Internetworking the Network Layer in the Internet: The IP Protocol, IP Addresses: subnets,subnetmask. UNIT II: THE TRANSPORT LAYER The transport service, Elements of transport protocols, The Internet transport protocol: UDP, the Internet transport protocol: TCP. UNIT III: THE APPLICATION LAYER DNS, Electronic Mail, The World Wide Web: Architectural Overview, Static Web Documents, Dynamic Web Documents, HTTP, Multimedia: Introduction to digital Audio, Audio Compression, Voice over IP. 10 hrs

10 Hrs

UNIT IV: Network Security 09 Hrs Network Security, Principles of Cryptography, Authentication, Integrity, Access Control.

UNIT V: Network Security continued and Network Management 09Hrs Attacks and countermeasures. Introduction to network management, Infrastructure of Network Management; The Internet Standard Management Frame work: Structure of Management Information (SMI), Management Information Base (MIB), SNMP Protocol Operation and Transport Mappings, Security and Administration, ASN.l Text Books: 1. Andrew S. Tanenbaum Computer Networks, 4th Edition, PHI.( chapters of the book: 5,6,7) 2. Computer Networking, Kurose and Ross, Pearson Education, 2002.(chapters of the book:7,8) Reference Books: 1. William Stallings: Data and Computer Communication, 8th Edition, Pearson Education, 2007. 2. Larry L. Peterson and Bruce S. David Computer Networks - A Systems Approach, 4th Edition, Elsevier, 2007. 3. Behrouz A. Forouzan Data Communications and Networking, 4th Edition, Tata McGrawHill, 2006. 4. Wayne Tomasi Introduction to Data Communications and Networking, Pearson Education, 2005. 5. Nader F. Mir Computer and Communication Networks, Pearson Education, 2007.

SOFTWARE ENGINEERING
Sub code: 08IS64/08CS64 Hours/Week: 4+1+0 Total Hours: 48 Exam Hours: 03 Credits: 04 CIE: 50 SEE: 50

UNIT I 10 Hrs Introduction what is software engineering, A system approach, an engineering approach, Modeling process life cycle Meaning of Software Process, Software life cycle models, waterfall model, waterfall with prototyping, prototype Model, V model, transformational model, Phased development model, spiral model, process improvement models, the capability maturity model (CMM). Chapter 1 of text book 1, 1.1 to 1.8 and chapter 2 of text book 1, 2.1,2.2, chapter 12 of text book 1, 12.5 UNIT II 10Hrs Requirement analysis Requirement analysis and specification, structured analysis techniques, dataflow diagrams, data definitions, process descriptions, structure of requirement document, requirement validation and measurement Chapter 4 of text book 1, 4.1-4.3, 4.9-4.11, Chapter 8,9 and 10 of text book 2.

UNIT III 10 Hrs Software design and detail design Conceptual and technical designs, decomposition and modularity, issues in design creation, characteristics of good design, design evaluation and validation, design documentation. Chapter 5 of text book 1 excluding sections 5.3,5.6,5.9,5.10 UNIT IV 09Hrs Coding and Testing Coding, standards for programming, Guidelines for programming, Documentation, Testing, Software faults and failures, Testing Issues, Black box testing, white box testing, Verification and validation of software, unit testing, integration testing, Test planning. Chapter 8 of text book 1 excluding sections 8.5,8.7-8.10 UNIT V 09Hrs Planning and managing software projects Tracking Progress,Project personnel, Effort Estimation Risk Management, the project plan. Chapter 3 of text book1 sections 3.1-3.5 TEXT BOOKS 1. Pfleeger Lawrence Shari: Software Engineering, Theory and Practice: 2nd Edition. Pearson Education Asia (LPE) 2001. 2. Hawryszkiewycz I T: Introduction to System Analysis and Design: 3rd Edition Prentic Hall India 1994. REFERENCE BOOK 1. Rajib Mall Fundamentals of Software Engineering.

ENGINEERING MANAGEMENT AND ENTREPRENEURSHIP

Sub code: 08ISH65 Hours/Week: 3+1+0 Total Hours: 36 Credits: 03 CIE: 50 SEE: 50

Exam Hours: 03 UNIT I Management Introduction Meaning - nature and characteristics of Management, Scope and Functional areas of management - Management as a science, art of profession Management & Administration - Roles of Management, Levels of Management, Development of Management Thought - early management approaches - Modern management approaches. Planning Nature, importance and purpose of planning process Objectives - Types of plans (Meaning Only) - Decision making importance of planning - steps in planning & planning premises - Hierarchy of plans. 08 Hours UNIT II Organizing and Staffing Nature and purpose of organization Principles of organization - Types of organization Departmentation CommitteesCentralization Vs Decentralization of authority and responsibility - Span of control - MBO and MBE (Meaning Only) Nature and importance of staffing-Process of Selection & Recruitment (in brief). 08 Hours UNIT III Directing & Controlling Meaning and nature of directing Leadership styles, Motivation Theories, Communication - Meaning and importance coordination, meaning and importance and Techniques of Co-Ordination. Meaning and steps in controlling - Essentials of a sound control system - Methods of establishing control (in brief) 08 Hrs 08 Hours UNIT IV Entrepreneur Meaning of Entrepreneur; Evolution of the Concept, Functions of an Entrepreneur, Types of Entrepreneur, Intrapreneur - an emerging' Class, Concept. of Entrepreneurship -Evolution of Entrepreneurship, Development of Entrepreneurship; Stage in entrepreneurship in India ; Entrepreneurship-its Barriers. Small Scale Industries Definition; Characteristics; Need and rationale; Objective; Scope; role of SSI in Economics Development. Advantage of SSI Steps to start and SSI-Government Policy towards SSI; Different Policies of Liberalization, Privatization , Globalization on SSI effect of WTO/GATT Supporting Agencies of Government for SSI, Meaning, Nature of Support ; Objectives ; Functions ; Types of Help; Ancillary Industry and Tiny Industry (Definition Only). 07 Hours UNIT V Institutional Support Different Schemes ; TECKSOK; KIADB; KSSIDC; KSIMC;DIC single Window Agency; SISI; NSIC;SIDBI;KSFC. Preparation of Project Meaning of the project; Project Identification; Project Selection ; Project Report; Need and Significance of Report; Contents; Formulation; Guidelines by Planning Commissions for project report; 05 Hours TEXT BOOKS 1. Principles of Management, P C Tripathi, P N Reddy, TMH, 2008 2. Enterpreneurship and Management, S Nagendra, V S Manjunath, Sanguine Technical Publishers, 2008. REFERENCE BOOKS 1. Entrepreneurship Development, Poornima M Chavanthimath, small business Enterprises, Pearson Education, 2006 2. Dynamics of Entrepreneurial development and management, Vasant Deasi, Himalaya Publishing House.

1.

COMPUTER NETWORKS LAB

Sub Code: 08ISL67 L-T-P: 0-0-2 SEE Duration: 3 Hours Student should implement the exercises using the concepts 1. Simulation of a point-to-point networks. 2. FTP TELNET 3. TCP & UDP 4. Ethernet LAN 5. Simulation of a simple ESS 6. LRC CCITJ 7. FIFOS & IPC. 8. Congestion Control. 9. RSA algorithm Note: Out of the exercises executed in the regular laboratory classes, each students will be allotted one question by taking lots in the SEE, which he has to execute individually. Credits: 1 CIE: 50 SEE: 50

FILE STRUCTURE LAB

Sub Code: 08ISL68 L-T-P: 0-0-2 SEE Duration: 3 Hours Credits: 1 CIE: 50 SEE: 50

Student should implement the exercises using the concepts 1. I/O Redirection & pipes. 2. Implement fixed length & variable length record structures. 3. Simple Index 4. Co-sequential match. 5. K-way merge algorithm 6. B-tree 7. B+tree 8. Hashing Note: Out of the exercises executed in the regular laboratory classes, each students will be allotted one question by taking lots in the SEE, which he has to execute individually.

ELECTIVE CORE-B

OPTIMIZATION TECHNIQUES
Sub code: 08ISE661 Hours/Week: 3+1+0 Total Hours: 36 Exam Hours: 03 Credits: 03 CIE: 50 SEE: 50

UNIT-I Introduction and Classical Optimization Techniques: Statement of an Optimization problem design vector design constraints constraint surface objective function objective function surfaces classification of Optimization problems. Classical Optimization Techniques Single variable Optimization multi variable Optimization without constraints necessary and sufficient conditions for minimum/maximum multivariable Optimization with equality constraints.Solution by method of Lagrange multipliers multivariable Optimization with inequality constraints Kuhn Tucker conditions. 08 Hrs UNIT-II Linear Programming Standard form of a linear programming problem geometry of linear programming problems definitions and theorems solution of a system of linear simultaneous equations pivotal reduction of a general system of equations motivation to the simplex method simplex algorithm. 07 Hrs UNIT-III Transportation Problem Finding initial basic feasible solution by north west corner rule, cost method and Vogels approximation method testing for optimality of balanced transportation problems. 07 Hrs UNIT-IV Unconstrained Nonlinear Programming: One dimensional minimization methods: Classification, Fibonacci method and quadratic interpolation method. Unconstrained Optimization Techniques Univariate method, Powells method and steepest descent method. Constrained Nonlinear Programming: Characteristics of a constrained problem. Classification, Basic approach of Penalty Function method; Basic approached of Interior and Exterior penalty function methods. Introduction to convex Programming Problem. 07 Hrs UNIT-V Dynamic Programming: Dynamic programming multistage decision processes types concept of sub optimization and the principle of optimality computational procedure in dynamic programming examples illustrating the calculus method of solution examples illustrating the tabular method of solution. 07 Hrs TEXT BOOKS: 1. 2. Engineering optimization: Theory and practice by S.S. Rao, New Age International (P) Limited, 3rd edition, 1998. Introductory Operations Research by H.S. Kasene & K.D. Kumar, Springer(India), Pvt.LTd.

REFERENCE BOOKS: 1. 2. 3. 4. Optimization Methods in Operations Research and Systems Analysis by K.V. Mital and C. Mohan, New Age International (P) Limited, Publishers, 3rd editions, 1996. Operations Research by Dr. S. D. Sharma. Operations Research : An Introduction by H.A. Taha, PHI Pvt. Ltd., 6th edition Linear Programming by G. Hadley

ARTIFICIAL INTELLIGENCE
Sub code: 08ISE662 Hours/Week: 3+1+0 Total Hours: 36 Exam Hours: 03 Credits: 03 CIE: 50 SEE: 50

UNIT - 1 1. INTRODUCTION: What is AI? Intelligent Agents: Agents and environment; Rationality; the nature of environment; the structure of agents. Problem-solving: Problem-solving agents; Example problems; Searching for solution; uninformed search strategies. 2. INFORMED SEARCH, EXPLORATION, CONSTRAINT SATISFACTION, ADVERSIAL SEARCH: Informed search strategies; Heuristic functions; On-line search agents and unknown environment. Constraint satisfaction problems; Backtracking search for CSPs. Adversial search: Games 7 HOURS UNIT - 2 1.LOGICAL AGENTS : Knowledge-based agents; The wumpus world as an example world; Logic; propositional logic Reasoning patterns in propositional logic; Effective propositional inference; Agents based on propositional logic. 2. FIRST-ORDER LOGIC, INFERENCE IN FIRST-ORDER LOGIC 1: Representation revisited; Syntax and semantics of first-order logic; Using first-order logic; Knowledge engineering in first-order logic. Propositional versus first-order inference; Unification and lifting. 8 HOURS UNIT 3 1. INFERENCE IN FIRST-ORDER LOGIC 2: Forward chaining; Backward chaining; Resolution. 2.KNOWLEDGE REPRESENTATION: Ontological engineering; Categories and objects; Actions, situations, and events; Mental events and mental objects; The Internet shopping world; Reasoning systems for categories; Reasoning with default information; Truth maintenance systems. 7 HOURS UNIT - 4 1. PLANNING, UNCERTAINTY, PROBABILISTIC REASONING: Planning: The problem; Planning with state-space approach; Planning graphs; Planning with propositional logic. Uncertainty: Acting under certainty; Inference using full joint distributions; Independence; Bayes rule and its use. 2.PROBABILISTIC REASONING: Representing knowledge in an uncertain domain; The semantics of Bayesian networks; Efficient representation of conditional distributions; Exact inference in Bayesian networks. 7 HOURS UNIT - 5 LEARNING, AI: PRESENT AND FUTURE: Learning: Forms of Learning; Inductive learning; Learning decision trees; Ensemble learning; Computational learning theory. AI: Present and Future: Agent components; Agent architectures; Are we going in the right direction? What if AI does succeed? 7 HOURS TEXT BOOK: 1. Artificial Intelligence: A Modern Approach Stuart Russel, Peter Norvig, 2nd Edition, Pearson Education, 2003. REFERENCE BOOKS: 1. Artificial Intelligence - Elaine Rich, Kevin Knight, 2nd Edition, Tata McGraw Hill, 1991. 2. Principles of Artificial Intelligence Nils J. Nilsson, Elsevier, 1980.

FUNDAMENTALS OF VLSI DESIGN

Sub code: 08ISE663 Hours/Week: 3+1+0 Total Hours: 36 Exam Hours: 03 UNIT-I Credits: 03 CIE: 50 SEE: 50

Basic MOS technology: Integrated circuits era. Enhancement and depletion mode MOS transistors. nMOS fabrication. CMOS fabrication. Thermal aspects of processing. BiCMOS technology. Production of E-beam masks. 7 Hrs

UNIT-II MOS Transistor Theory: Introduction, threshold voltage equation ,body effect, MOS Device Design Equations, subthreshold region, channel length modulation, mobility variation, tunneling , punch through, hot electron effect. The Complementary CMOS Inverter DC Characteristics, Static Load MOS Inverters, The Differential Inverter, The Transmission Gate, Tristate Inverter, 7 Hrs UNIT III Circuit design processes: MOS layers. Stick diagrams. Design rules and layout lambda-based design and other rules. Examples. Layout diagrams, Symbolic diagrams. Basic CMOS Technology : p well/ n well/ twin well process ,Current CMOS enhancement (oxide isolation, LDD, refractory gate, multilayer Interconnect ), Circuit elements, resistor, Capacitor, interconnects, Tutorial exercises. Basic Physical Design of Simple logic gates 8Hrs UNIT IV Basic circuit concepts: Sheet resistance. Area capacitances. Capacitance calculations. The delay unit. Inverter delays. Driving capacitive loads. Propagation delays. Wiring capacitances. Tutorial exercises Scaling of MOS circuits: Scaling models and factors. Limits on scaling. Limits due to current density and noise. 12 7 Hrs UNIT-V CMOS Logic Structures: CMOS Complementary Logic, BICMOS Logic, PseudoNMOS LOGIC, Dynamic CMOS Logic, Clocked CMOS Logic, Pass Transistor Logic, CMOS Domino Logic, Cascaded Voltage Switch Logic. 7 Hrs Text Books: 1. Douglas A. Pucknell & Kamran Eshraghian, Basic VLSI Design PHI 3rd Edition (original Edition 1994), 2005. 2. Neil H. E. Weste and K. Eshragian, Principles of CMOS VLSI Design: A Systems Perspective, 2nd edition, Pearson Education (Asia) Pvt. Ltd., 2000.

DIGITAL IMAGE ALGORITHMS AND ANALYSIS

Sub code: 08ISE664 Hours/Week: 3+1+0 Total Hours: 36 Exam Hours: 03 Credits: 03 CIE: 50 SEE: 50

UNIT-1 7 Hrs Digital Image Fundamentals Fundamental Steps in Digital Image Processing, Components of an Image Processing System, Elements of Visual Perception, Image Sampling and Quantization, Some Basic Relationships Between Pixels, Linear and Nonlinear Operations. Image Enhancement in the Spatial Domain Gray Level Transformations, Histogram Processing, Enhancement Using Arithmetic/Logic Operations. UNIT-2 7 Hrs Basics of Spatial Filtering, Smoothing Spatial Filters, Sharpening Spatial Filters,Combining Spatial Enhancement Methods.Image Enhancement in the Frequency Domain Introduction to the Fourier Transform and the Frequency Domain

UNIT-3 7 Hrs Smoothing Frequency-Domain Filters, Sharpening Frequency Domain Filters, Homomorphic Filtering. Image Segmentation Detection of Discontinuities, Edge Linking and Boundary Detection, Thresholding, Region-Based Segmentation UNIT-4 7 Hrs

Texture Texture Primitives, Structural Models of Texel Placement, Grammatical Models Shape Grammars, Tree Grammars, Array Grammars UNIT-5 8 Hrs Image Registration Registration methodology, Concept and algorithm, Role of image registration. TEXT BOOKS 1. Rafael C. Gonzalez, Richard E. Woods, Digital Image Processing, Second edition, Pearson education. 2. Dana Ballard and Chris Brown, Computer Vision, Prentice Hall- Inc. 3. joseph V. Hajnal, Derek L.G. Hill, David J. Hawkes Medical Image Registration, CRC Press. 4. Rick S. Blum, Zhaeng Liu, Multi-Sensor Image Fusion and Its Application, CRC Press. 5. G. W. Awcock and R. Thomas, Applied image processing, McGraw hill international edition.

DISTRIBUTED OPERATING SYSTEMS

Sub code: 08ISE665 Hours/Week: 3+1+0 Total Hours: 36 Exam Hours: 03 Credits: 03 CIE: 50 SEE: 50

UNIT I Process Synchronization: Introduction,Functions of an Operating System,Design Approaches,Layered Approach,The Kernel Based Approach,The Virtual Machine Approach,Why Advanced Operating Systems,Types of Advanced Operating Systems. Architectures of Distributed Systems: Introduction,Motivations,System Architecture Types,Distributed Operating Systems,Issues in Distributed Operating Systems,Globalknowledge,Naming,Scalability, Compatibility,Process Synchronization,Resource Management,Security,Structuring Client-server Computing Model,Remote Procedure Calls,Design Issues in RPC Theoretical Foundations: Introduction,Inherent Limitations of a Distributed System,Absence of a Global Clock,Absence of Shared Memory,Lamports Logical Clocks,A Limitations of Lamports Clocks ,Vector Clocks,Causal Ordering of Messages,Global State 8 Hours Unit 2 Distributed Mutual Exclusion: Introduction, The Classification of Mutual Exclusion Algorithms, A Simple Solution to Distributed Mutual Exclusion,Non- Token-Based Algorithms,Lamports Algoritham,The Ricart-Agrawala Algorithm,Maekawa,s Algorithm,Token-Based Algorithms,Suzuki-Kasamis Broadcast Algorithm,Singhals Heuristic Algorithm,Raymonds Tree- Based Algorithm Distributed Deadlock Detection: Introduction, Preliminaries, Deadlock Handling Strategies in Distributed Systems, Issues in Deadlock Detection and Resolution,Control Organizations for Distributed deadlock detection, Centralized Deadlock Detection Algorithms, Distributed Deadlock Detection Algorithms 8 Hours Unit 3 Agreement Protocols: Introduction, The System Model, A Classification of Agreement Problems, Solutions to the Byzantine Agreement Problem Distributed Shared Memory: Introduction,Architecture and Motivation, Algorithms for Implementing DSM, Memory Coherence, Coherence Protocols, Design Issues 7 Hours

Unit 4 Distributed Scheduling: Introduction, Motivation, Issues in Load Distributing, Components of a Load Distributing Algorithm, stability, Load Distributing Algorithms Failure Recovery and Fault Tolerance: Introduction, Basic Concepts, Classification of Failures, Backward and Forward Error Recovery, Backward Error Recovery: Basic Approaches, Recovery in Concurrent Systems, Consistent Set of Checkpoints, Synchronous checkpointing and recovery 7 Hours Unit 5 Checkpointing for distributed database systems, Recovery in replicated distributed database systems. Fault Tolerance: Introduction, Issues, Atomic Actions and Committing, Commit Protocols, The Two-Phase Commit Protocol, Voting protocol, Dynamic voting protocol, The majority based dynamic voting protocol, Dynamic vote reassignment protocol Text Book:

1. Advanced Concepts in Operating Systems: Mukesh Shingal and Niranjan G. Shivaratri. Reference Books: 1. Concurrency Control and Recovery in Database Systems: Bernstein P.A.Hazallacos and Goodmani M. Addison Wesley Co 1987. 2. Distributed Database: Ceri S. and Pelagatti S. McGraw-Hill 1984

Tata McGraw-Hill 1997