ITI Fifth Semester B.E. Degree Examination, June/July 08 Operating systems Time: 3 hrs. Max. Marks:100 Note : Answer any FIVE full questions. 1 a. Whatis.an operating system? What are its goals? (04 Marks) b. Listout three main advantages of multiprocessor system. Distinguish between symmetric and asymmetric multiprocessing. (06 Marks) €. What are the major activities of an operating system with regard to i) Process management 1i) Memory management (06 Marks) «Distinguish between short-term and long-term schedulers. (04 Marks) 2 a, Whatis cooperating process? Give reasons for process cooperation. (05 Marks) b. Whatare threads? Explain different multithreading models, (07 Marks) ©. Consider the following set of processes with the length of the CPU burst time given in SMB BRinjoaded from 4-Z.Shiksha-com oe oe 2) 10 Draw Gantt charts illustrating the execution of these processes using FCFS and SJF scheduling. Also calculate average turnaround time for each of these scheduling algorithms. (08 Marks) 3. a, What are monitors? Explain monitor solution to the dining philosopher problem, (10 Marks) b. Describe the solution for classical synchronization bounded bufler problem using semaphores, (10 Marks) 4, What are the necessary and sufiicient conditions for deadlock? Briefly explein, (06 Marks) b. Consider the following snapshot of a system Allocation Max Available ABC ABC ABC Py O12 012 520 Py 000 750 P 354 336 Py 632 652 Py - O14 656 Answer the following questions using Banker's algorithm. i) What is the content of the matrix need? ii) Js the system in asa ¢. Describe the methods for recovery form Deadloc! 1 ie state? If yes . write the safe sequence. (09 Marks) (05 Marks) of?a, With an example, explain the concept of paging. In paging what is the worst case and average intemaf fragmentation per process? (10 Marks) b, Consider a paging system with TLB and pege table stored in memory. If hit ratio of TLB i 80 percent and it takes 20 nanoseconds (o search TLB and 100 nanoseconds t access memory, find the effective memory access time. (04 Marks) ©. Consider the following page reference stream 7, 0, 1,2, 0,3,0,4, 2,3, 0 Calculate the number of page faults when number of frames is equal to 3, using FIFO and optimal page replacement algorithms. (06 Marks) a. Withadiagram explain the steps involved in handling a page fault. (08 Marks) b. Mention different file attributes and file types (06 Marks) ©. Explain indexed disk space allocation, (06 Marks) a. Consider a disk queue with requests for 1/0 to blocks on following cylinders in order. 98, 183,37, 122, 14, 124, 65, 67, If the disk bead is initially a 53, calculate the total head movements when the following scheduling are used i) FCFS ii) SSTF (G8 Marks) b, Explain goals of protection, (05 Marks) ¢. Mention most common program and system threats. Briefly explain one program threat and one system threat. (07 Marks) Write short notes on + Compsyiricacies {rn SaANs NiRemrRA ieayaipented memory stam ¢. Interprocess: communteation d,‘Aafdware synchronization tools test and set and snap instructions. (10 Marks)USN cs: Fifth Semester B.E Degree Examination, Dec. 07 / Jan. 08 Operating Systems Time: 3 hrs. Max. Marks: 100 Note : 1. Answer any FIVE full questions. 2. Draw neat diagrams wherever required. 1 a. Explain the fundamental difference between i) N/W Operating Systems and Distributed OS ii) Web — Based computing an Embedded computing. (08 Marks b. What do you mean by cooperating processes? Describe four advantages of cooperatin processes. (06 Marks c. What are the different categories of system programs? Explain, (06 Marks 2 a What do you understand by PCB? Where is PCB used? What are its contents? Explain. (08 Marks b, Explain direct and indirect communications with respect to message passing system. “ (05 Marks «, LQwnloaded froma Aarhus slas.e2@i@and long term schedulers (06 Marks 3 a. Consider the following set of processes, with CPU burst time (in ms) : [_ Process [Arrival time (in ms) | Burst time PO 0 6 [Pr 1 [ 3 P2 z 1 Ps 3 4 | i) Draw the Gantt chart illustrating the execution of above processes using Shortest Remaining — Time First (SRTF) and non-preemptive Shortest-Job-First (SJF). ii) Find the turn around time for cach process for SRTF and SJF, hence show thet, SRT! is faster than SJF. (10 Marks b. What are Semaphores? Explain two primitive semaphore operations. What are th advantages of semaphores? (06 Marks c. Explain sny one synchronization problem for testing newly proposed synchronizatio scheme. (04 Marks 4 a Why is deadlock state more critical than starvation in a multiprogramming environment Describe a resource allocation graph, i) with « dead lock ii) with a cycle but no dea lock. (08 Marks b. What are the two options for breaking a deadlock? Explain each clearly. (07 Marks ¢. What is wait — for graph? Explain how it is useful for detection of deadlock. (05 Marks 5 a. Whai do you mean by fragmentation? Explain difference between internal and exter: fragmentation, (06 Mark Consider the following page reference strinj |, 2,3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, | UF6 a. Define the following terns with respect to disk scheduling. i) Constant Linear Velocity (CLV) iii) Seek time ii) Constant Angular Velocity(CAV). iv) Rotational lateney. b. Suppose that a disk has 50 cylinders named 0 to 49. The read/write head is serving at cylinder 15. The queue of pending requests are in order : 4, 40, 11, 35, For cach scheduling algorithms : FCFS, SSTF, and LOOK. i) Show the graphical representation for above scheduling algorithms. ii) Find the average head movement for above scheduling algorithms. c. What is the need — to — know principle? Why is it important for a protection adhere to this principle? 7a. What is boot block and bad block? Explain the techniques used for handling bad b. Name 3 system threads, Explain any one. ‘ ¢. Discuss the various components of a LINUX 08. 8 Write a note on : User threads V/s Kemel threads. Symmetric multiprocessing V/s Asymmetric multiprocessing, Monitors with respect to process synchronization. Operating — System Services. ‘ Downloaded from A-ZShiksha.com