Record as per Format MSRIT.F702 M.S.

RAMAIAH INSTITUTE OF TECHNOLOGY, BANGALORE – 560 054 Lesson Plan Department: Information Science and Engineering Semester: V . B.E , ‘C’ Section Preparation Date: 10-07-2010 Review Date: Term :16th Aug to Dec 2010 Exam Hours: 03 Exam Marks: 100 Duration of Final Exam: 3 Hrs

Subject: Operating System Subject Code: IS54 Prepared by: D.Jagadeesh Sai Reviewed by: No. of Lecture Hours/Week : 04 Total No. of Lecture Hours : 52 (42+10) IA Marks: 50 Credits: 3:0:1

Objectives of operating system 1. To understand basic concepts of operating system. 2. To understand the services the operating system provides to the user. 3. To develop prototype for critical section problem. 4. Study techniques for efficient memory utilization and deadlock handling. 5. Learn the techniques supported by various operating systems through case study. Scope/ Outcome of Operating System Students will 1. Understand the importance of operating system. 2. Analyze the performance of various CPU scheduling algorithms . 3. Develop mechanisms for handling process synchronization and deadlock problems. 4. Understand the various structures of file directories. 5. Become familiar with the working of various operating systems. Lesson/ Session No Objective Topics Duration

UNIT I Objective of this unit is to learning common features of operating system and understanding what an operating system does for the user. Understanding the process concept and interprocess communication. Learning different CPU scheduling algorithms and analyzing their performance. Batch Systems, Concepts of multi programming Time-sharing, parallel, distributed and real - time systems. Operating system components and services. System calls and system programs. Virtual machines. Process concept, process scheduling, Cooperating processes, threads and intercrosses communication. CPU scheduling criteria, scheduling algorithms 1 Hr 1 Hr 1 Hr 1 Hr 1 Hr 1 Hr

1 2 3 4 5 6

1 Hr Recovery from dead lock contd .system model. File system structure. 1 Hr critical regions and monitors 1 Hr Dead locks . UNIT II Process synchronization and deadlock are the serious problems of operating system. protection and consistency semantics. synchronization hardware 1 Hr semaphores.logical and physical address space 1 Hr swapping.Demanding paging and its performance 1 Hr Page replacement algorithms. classical problems of synchronization. Thrashing 1 Hr Students will realize the advantages of efficient utilization of memory. UNIT IV Objective Objective of this unit is to uunderstanding file system structure. disk scheduling methods. 1 Hr Objective 9 10 11 12 13 14 15 16 Outcome Objective 17 18 19 20 21 22 23 24 Outcome practice session on Page replacement algorithms 1 Hr Allocation of frames. Handling and prevention of deadlock for better resource utilization UNIT III The objective of this unit is to learn different memory management techniques. They will also learn various storage management techniques and execution of programs larger than memory size using demand paging concept. contiguous allocation. Recovery from dead lock. Directory implementation Disk structure. Secondary Storage Structure Protection and Security-File concept.processor scheduling and real-time scheduling 1 Hr At the end of this unit students will be familiar with operating system concepts. 1 Hr Deadlock prevention 1 Hr Deadlock avoidance 1 Hr Detection. allocation and access methods. characterization. 1 Hr Virtual Memory . allocation methods. 1 Hr 1 Hr 1 Hr 1 Hr 1 Hr 1 Hr . Understand strategies for concurrency management using semaphores and deadlock handling. Free space management. Memory management . 1 Hr paging and segmentation 1 Hr Segmentation with paging in MULTICS and Intel 386. access methods Directory structure. Algorithm evaluation. The critical section problem. backup and recovery. Learning mass storage structures. This unit discusses the various process synchronization problems.Combined approach 1 Hr Students will learn to design solutions for process synchronization problems.7 8 Outcome Scheduling algorithms. They will know how to choose a particular scheduling algorithm based on their application. 1 Hr multiple. strategies for implementing virtual memory concept and understanding advantages of virtual memory in any system. 25 26 27 28 29 30 File systems.

Goals of protection. domain of protection 1 Hr Access matrix and its implementation. Protection . exit. Swap-space management. 1 Hr Swap-space management. stat. Implement the CPU scheduling algorithms for priority 2hr Scheduling and Round robin Scheduling. Disk reliability. wait. LAB The objective is to implement the various concepts of operating system to know how the operating system works write programs using the following system calls of UNIX 2hr operating system: fork. Implement the Banker’s algorithm for deadlock-avoidance 2hr Implement the FIFO and Optimal Page replacement algorithms 2hr implement the FIFO and SCAN disk scheduling algorithms 2hr Implement producer-consumer problem using semaphores 2hr Implement readers-writers problem using semaphores 2hr Implement paging using TLB 2hr Students will become familiar with functionality of the operating system. 1 Hr Process management. They will be become familiar with techniques and need for free space management UNIT V The objective of this unit is to understanding the need for protection in operating system. Scheduling 1 Hr Memory management 1 Hr File systems 1 Hr Input and output 1 Hr Inter-process communication 1 Hr Discussion on question papers 1 Hr Case studies will give an insight on the features supported by different operating system. Design principles. opendir. Students will become aware of the system threats and program threats. 2hr 44 45 46 47 48 49 50 51 52 Outcome Implement the CPU scheduling algorithms for FCFS 2hr Scheduling and SJF Scheduling. Internal Assessment Details . getpid. close. exec. Kernel modules. Disk reliability contd 1 Hr Students will know to choose the appropriate allocation methods and directory structures in various applications. grep. 1 Hr Access matrix implementation & Revocation of access 1 Hr Linux history. Implementation of protection mechanisms in operating system and case studies on different operating system. Write programs to simulate UNIX commands ls. readidr.31 32 Outcome Objective 33 34 35 36 37 38 39 40 41 42 Outcome Objective 43 Disk management.

7 edition.Dhamdhere D. “Operating Systems – A Concept Based Approach”. Pearson Education. 2008 TERM: August 2010-Dec 20109 Section V semester ‘C’ Sections Staff (Name & Signature with Date) Jagadeesh Sai HOD (Signature with Date) . “Modern Operating Systems”. “Operating System Concepts”. S. 2003. Tata McGraw Hill. Gagne. Reference Books: 1.Tanenbaum A. Silberschatz. 2006. Addison-Wesley. M. Galvin...Internal Test1 Internal Test2 Internal Test3 Max Marks: Max Marks: Max Marks: 25 25 25 Final Marks: Average of best of two tests Lab test Surprise test Max Marks: Max Marks: 15 10 TEXT BOOKS 1. 2 nd edition. 2. 3rdedition.

Sign up to vote on this title
UsefulNot useful