You are on page 1of 3

ADVANCED OPERATING SYSTEM Objectives To know the components of the operating systems To have thorough knowledge of process management

nt ,Storage Management ,I/O and File systems To have thorough knowledge of Distributed operating systems Concepts. Program Outcomes a. Apply basic principles and practices of computing grounded in mathematics and science to successfully complete software related projects. c. Demonstrate problem solving and design skills including the ability to formulate problems and their solutions, think creatively and communicate effectively. d. Demonstrate an ability to use techniques, skills, and modern computing tools to implement and organize computing works under given constraints. Skill Set Analyze the requirements of operating system. Demonstrate the scheduling mechanisms. Design the algorithm for memory management techniques Assessment Pattern S.No 1 2 3 4 5 6 Blooms Taxonomy Remember Understand Apply Analyze Evaluate Create Total Test I 10 20 20 20 20 10 100 Test II 10 20 20 20 20 10 100 Model Examination 10 20 20 20 20 10 100 End Semester Examination 10 20 20 20 20 10 100


1. 2. 3. 4. 5.

Define process What is process control block? State the features virtual memory. List the different types of page replacement. State the different types of allocation methods.

Understand 1. How to represent process control block? 2. Describe the approaches of creating process cooperation? 3. Classify the methods of thread cancellation ? 4. Explain the challenges in process synchronization? 5. How do you create Binary semaphore? Apply

1. Demonstrate the process of fragmentation with paging.


Illustrate the functionalities of segmentation

Analyze/ Evaluate

1. Compare the various page replacement algorithm. 2. Differentiate wait-die scheme and wound-wait scheme in deadlock prevention..
Create 1. Design an algorithm for demand paging.

Unit I Process Management Operating system and services - Process structure and PCB- Microkernels - Threads Inter process communication - CPU scheduling approaches - Process synchronization semaphores Deadlocks handling deadlocks. 10 Hours Unit II Memory Management Memory management- Paging- Segmentation-Virtual memory- Demand paging Page replacement algorithms. 10 Hours Unit III File and Disk Management File Systems Access Methods Directory Structure and Implementation File System Mounting File Sharing Protection - File System Structure and Implementation Allocation Methods - Free-Space Management - Disk Structure Disk Scheduling and Management 10 Hours Unit IV Distributed Operating System Introduction-Remote procedure call Logical clocks Vector clocks Distributed mutual exclusion Non token based algorithms Token based algorithms Issues in deadlock detection and resolution Deadlock detection algorithms Election algorithms -Byzantine agreement problem Load distributing algorithms Performance comparison. Distributed File System design issues 10 Hours Unit V Case Study (Linux / Windows) Case study (Linux / Windows) Design and implementation of OS - process model and structure in OS memory management - file system - I/O management and device drivers. 10 Hours Total: 50+10 Hours References 1. Abraham Silberschatz, Peter B. Galvin and Greg Gagne, Operating System Concepts. New Delhi: Addison Wesley Publishing Company, 2004. 2. Mukesh Singhal, and Niranjan Shivratri, Distributed operating system. New Delhi: TMH, 2001. 3. William Stallings, Operating Systems Internals and Design Principles. New Delhi: Pearson Education, 2003. 4. Naji, Linux OS. New Delhi: Prentice Hall of India, 2003. 5. Mukesh Singhal and Niranjan G.Shivaratri, Advanced Concepts in Operating Systems. New Delhi: McGraw-Hill, 1994. 6. NPTEL Course Material :- % 20 Systems/New_index1.html.