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 £ 1 a, Define an operating system. Explain two view points of OS role. (05 Marks) q b. What are OS operations? Explain, (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) @ 2 a. Define IPC (Inter process communication). What are the different methods used for logical 43 implementation of a message passing system? Explain any one. (06 Marts) Ze b, Discuss three common way se of establishing relationship between the user thread and kemel de thread. Liownloaded from A-Z’Shiksha.com (06 Marks) 2o c. Consider the following set of processes, with the length of CPU burst in milliseconds. ze Process P, [P2 [Ps [Pa] Ps ao Arrival time | 00 [02 | 03 | 06 | 30 ee Burst time [10 | 12 | 14[ 16] 05 23 i) Draw a Gantt chart that illustrates the execution of these processes using the Hi preemptive shortest job first (SJF) algorithm. Hence find the average waiting time. £8 ii) Draw a Gantt chart that illustrate the execution of these processes using preemptive 3 3 priority scheduling algorithm. Given priority of each process is P;= 4, P2=3,P3=5, 35 Pa= 1 and Ps~ 1. Also find the average waiting time. (08 Marks) 7 q 3 a What do you mean by a binary semaphore and a counting semaphore? Along with the 23 necessary “C’-struct, explain the implementation of wait) and signal() semaphore 23 operations. (10 Marks) ee b. With the necessary syntax, describe the term monitor. Explain the solution to the classical aE dining philosopher's problem, using monitor. (10 Marks) Be 22 4 a. Define the terms: safe state and safe sequence. Give an algorithm to find whether or not 2 a3 system is in a safe state. (0 Marks) a3 b. Consider the following snapshot of the system, il Allocation Max Available aS ‘AP BicHED. ACB CHI D: AGB aenC ace: a2 gees tgseetriy eee eecte. (pear peers leer ieee eran eae)06CS53 PART-B 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 us to satisfy a memory request if the page is in memory. Ifthe page is not in memory the request takes 5000 js, What would the page fault rate need to be to achieve an effective access time 1000 js? 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 @ 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) i WShiksha pices downloaded from. Nad Shiksha.com i) Linear list ii) Hash table (10 Marks) ‘What are the components that the kernel module support under Linux? Explain in detail. (10 Marks) 2of2Iyy@. fa le uUsN | | | "5 06CS53 Fifth Semester B.E. Degree Examination, May/June 2010 Operating Systems Da Time: 3 hrs. Max. Marks:100 Note: Answer any FIVE full questions, selecting at least TWO questions from each part. PART-A 1a. Explain the following terms i) Bootstrap program ii) Caching iii) Trap iv) Job pool vy) Symmetric multiprocessing. (10 Marks) b. Explain two sets of operating system services that are helpful to user as well as efficient operation of system, (05 Marks) ©. Write and explain the sequence of system calls for copying a file to another (new) file. (05 Marks) 2. a. What is PCB? Enumerate and explain various fields in PCB. (04 Marks) What is multithreading? Explain the benefits of multithreaded programming, (05 Marks) s c. Consider the following set of processes: a ‘Arrival time | Burst time Download 2 SIF, non-preemptive SJF and RR (Quantum — 1) scheduling schemes. above. thus find the best scheme in this particular case. satisfy. advantages of semaphore? 4 a. Explain how resource-allocation graph is used to describe deadlocks. ag of s 2. Any reveal PART-B c. Define the algorithms TestAndSet( ) and swap( ). Show that they satisfy mutual excl i) Draw Gantt charts showing the execution of these processes using FCFS, preemptive ii) Compute the turn around time and waiting time for each process for each of the schemes iii) Compute the average tum around time and average waiting time in each scheme and (11 Marks) Define race condition. List the requirements that a solution to critical section problem must (05 Marks) b. What are semaphores? Explain two primitive semaphore operations. What are the (07 Marks) ion (08 Marks) (05 Marks) What are the different methods for handling deadlocks? Explain Banker's algorithm. (11 Marks) c. “A safe state is not a deadlock state but a deadlock state is an unsafe state”. Explain. (04 Marks) 5 a. What do you mean by dynamic storage allocation problem? Explain possible solutions to this problem, b. Explain the concept of forward-mapped page table. (04 Marks) (04 Marks) c. Consider the following reference string : 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0,3, 2, 1,2,.0,1,7,0, 1 Assuming three frames, all initially empty, how many page faults would occur for i) LRU. ii) FIFO iii) Optimal page replacement algorithms? Which of the algorithms is most efficient in this case? 1 of2 (12 Marks)a, b co a 06CS53 What is meant by ‘consistency semantics"? Explain the consistency semantics as implemented in a modem O. 8. (07 Marks) ith the help of a neat diagram, describe Tree -structured directory ii) Acyclic ~ graph directory. (08 Marks) Explain virtual file system(VFS). (05 Marks) Suppose the|pisitipnaal@elihdenfyjat\S37 Sketch thd graphical representation for the queue of pending requests in the order ~ 98, 183, 37, 122, 14, 124, 65, 67 for FCFS, SSTF and LOOK scheduling schemes. Give your comment on this scenario for the above schemes, (2 Marks) Describe the access matrix model used for protection in a computer system. (08 Marks) Write short notes on Components of Linux system Processes and threads Conflict resolution mechanism of Linux Linux file system. (20 Maris): etreeSe tiimetmtiacon RE