Final Assessment Test - November 2016 oy WIT Course: £2002 - Operating Systems mmm 1258 NOR(G)'5602 Slot: E2¢TE2 Time: Three Hours Max. Marks: 100 ‘Answer ALL Questions (10X 10 = 100 Marks) Describe the evolution of the various operating systems features beginning from mainframe systems onwards. Consider the below set of processes with their attival time, burst time, priority and time quantum. Apply preemptive SIF, preemptive Priority and round robin CPU scheduling algorithms for the below processes and calculate the average response time, average waiting time and average turnaround time for each of the algorithm. Assume that the time quantum for round robin algorithm is 2ms. PROCESS ARRIVAL TIME BURST TIME PRIORITY Pr 2 al rise alr ales wlel sla The dining philosophers prob ep around a circular table. Each Between each pair of plates ol i eating and thinking. When a pilin pei slicierty ung. he tries to acq chopsticks, one at a time, in either order. If successful in acquiring two chopsticks, then puts down the chopsticks. ‘and continues to think. Suppose that all five e thelr left chopstick simultaneousty. None will be able to take their right chopstick, and there wll be a deadock Write a DEADLOCK FREE algorithm using semaphores to synchronize the philosophers Suppose that a system is in an unsafe state. Show that it is possible for the processes to complete their execution without entering a deadlock state. Given six memory partitions of 300 KB, 600 KB, 350 KB, 200 KB, 750 KB, and 125 KB (in order), illustrate ‘memory allocation using first-it, best-fit, and worst fit algorithms for processes of size 115 KB, 500 KB, ‘358 KB, 200 KB, and 375 KB (in order), Prove that the page replacement strategy that suffers from Belady’s anomaly cannot be optimal. Describe the various methods for allocating disk space for files. Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 2100. The queue of pending requests, in order, is 2000, 1200, 2200, 2800, 500, 1600, 300, 11500, 4900 and 3600. Calculate the seek time for LOOK and C-LOOK disk scheduling algorithms. Explain the architecture of Windows operating systems as a layered system of modules. Explain the salient features of the Real Time Operating Systems. e2ene>