iagonal cross lines on the remaining blank pages. 1. On completing your answers, compulsorily draw dis 2. Any revealing of identification, Important Note : treated as malpractice. i 5 i 4 = & 3 2 i 4 USN 06CS53 Fifth Semester B.E. Degree Examination, December 2010 Operating Systems ‘Time: 3 hrs. Max. Marks:100 Note: Answer any FIVE full questions, selecting at least TWO questions from each part. PART—A Define an operating system. Explain two view points of OS role. (05 Marks) What are OS operations? Explain. si (06 Marks) Define a virtual machine (VM), With a neat diagram, explain the working of a VM. What are the benefits of a VM? (09 Marks) Define IPC (Inter process communication). What are the different methods used for logical implementation of a message passing system? Explain any one. (06 Marks) Discuss three common ways of establishing relationship between the user thread and kernel thread. (06 Marks) Consider the following set of processes, with the length of CPU burst in milliseconds. Process | Py [P, | Ps | Ps [Ps Arrival time | 00 | 02 | 03 | 06 | 30 Burst time | 10| 12 | 14 | 16 | 05 i) Draw a Gantt chart that illustrates the execution of these processes using the preemptive shortest job first (SIF) algorithm, Hence find the average waiting time. ii) Draw a Gantt chart that illustrate the execution of these processes"using preemptive priority scheduling algorithm. Given priority of each process is P)= 4, P2=3,P3=5, Py= 1 and Ps= 1. Also find the average waiting time. (08 Marks) What do you mean by a binary semaphore and a counting semaphore? Along with the necessary ‘C’-struct, explain the implementation of wait() and signal() semaphore operations. (10 Marks) With the necessary syntax, describe the term monitor. Explain the solution to the classical dining philosopher's problem, using monitor. (10 Maris) Define the terms: safe state and safe sequence. Give an algorithm to find whether or not a system is in a safe state. (0 Marks) Consider the following snapshot of the system. Allocation. Max Available AB C8 i ee ee = con-He>| ecavoct H-wuc+al BRRRONT oonHoD aavicts wanna aNacny Using the Bankers algorithm, answer the following: i) Whatis the content of a matrix NEED? i) Is the system in SAFE state? If yes, give the SAFE state. If a request from a process P; arrives for (0,4,2,0), can the request be granted immediately? (40 Marks) 1of206CSS3 PART What do you mean by a address binding? Explain with the necessary steps, the binding of instructions and data to memory addresses. (08 Marks) ‘Ona system using demand paged memory it takes 0.12 j1s to satisfy a memory request, if the page is in memory. If the page is not in memory the request takes 5000 11s. What would the page fault rate need to be to achieve an effective access time 1000 jis? Assume the system is only running a single process and the CPU is idle during the page swaps. (08 Marks) ‘What do you mean by a copy-on-write? Where is it used? Explain in brief. (04 Marks) ‘What do you mean by a free space list? With suitable examples, explain any two methods of implementation of a free space list. (08 Marks) What are the major methods used for allocating a disk space? Explain each, with suitable examples. (12. Marks) Discuss the steps in handling a page fault, with the help of a neat diagram. (10 Marks) . Given the page reference string: 09018187871282782383 ‘Three frames allocated for the program. in the main memory. Determine the number of page faults using i) LRU policy ii) Optimal replacement policy. (10 Marks) Discuss the directory implementation using i) Linear list. ii) Hash table (10 Marks) ‘What are the components that the kemel module support under Linux? Explain in detail. (10 Marks) weeee 20f2