73 No of Pages 13 Course Code : 121503 Roll’ (To he filled in.by the candidate) PSG COLLEGE OF TECHNOLOGY, COIMBATORE - 641 004 SEMESTER EXAMINATIONS, — FEBRUARY / MARCH - 2015 BT ech — INFORMATION TECHNOLOGY Semester : 121503, OPERATING SYSTEMS Time :3 Hours Maximum Marks: 100 INSTRUCTIONS: 1. Answer ALL questions from GROUP - L 2. Answer any’ 4 questions ftom GROUP - IL 3. Answerany ONE. question’ from GROUP = IIL 4. Ignore the box titled as “Answers fi Group III in the Main Answer Book. ‘GROUP -1 Marks: 10x3=30 ‘Whai are the three main puposes of an aperaiing sysiem? 2, Write the actions fora Kernel takes to context switch between processes 3. Differentiate, between bounded and unbounded capacity in the Interprocess ‘Communication. Define Sleeping barber problem. ‘Why are segmentation and paging sometimes combinad inte one scheme?, Define Belady's anomaly. Give an exam ple Define seek time and rotational latency. ‘What are the advantages of RAID technology? ‘What problems could occur. a system allowed a file system to be mounted COA Ons ‘simultaneously at more than one location ? 10, List ihe ways to share files between direciories in operating systems. GROUP - 1 Marks : 4x 12.5 =50 11. Describe the essential properties of the following types of operating systems: i) Batch i) Interactive ii) Time sharing iv) Real time v) Network vi) Distributed Page No: |673 No of Pages 13 Course Code : 121503 12, a) Explain in detail the different process states with neat diagram. 6) b) Given memory partitions of 100K, 500K, 200K, 300K, and 600K jin order), how would each‘of the Firstti, Best-ft, and Worst-fit algorithms ‘place processes of 212K, 417K, 112K, and 426K (in order)? Which algorithm makes the most éificient use of memory? (65) 13, .Gonsider the following snapshot of a system: Allocation Max ‘Available ABCD ABCD ABCD PO 00 48 @o12 15.20 PL 4000 1750 P2435 4 23.56 Peo 6 3 2 O65 2 Pa 0044 0656 Answer the following questions using the banker's algorithm, a) What is the content of the matrix Need? ) Is the system in a safe siate? if yes, write the séquence. ¢) Ht @ request trom process P1 arrives tof (0,4,2,0), can thé request be granted immediately? I granted, write the sequence. 14.0Suppose that a diskdrive has 200-cylinders, numbered 0 to 199. The drive’is currently serving a request at cylinder 100. The queue of pending requests, in FIFO order, is 95, 180, 34, 119,11, 123, 62, 64 Starting from the. cument head position, what is the total distance (in cylinders} that the disk arm moves to satisty all the pending requests, for each of Ihe. tallowing disk scheduling algorithms? Also draw the diagram and write the order of requests tor each schaduling algorithms: a) FCFS b) SSTF c) SCAN @) SCAN @) LOOK 2) CLOOK 15. Discuss in detail the following allocation methods in file system implementation, ‘a) Contiguous Allocation ) Linked Allocation ) Indexed Allocation Page Nez?73 No of Pages 13 Course Code : 121503 GROUP - II Marks : 1x 20=20 16, Consider the following page relerence string: 1,2,3,4,2)1,5,6,2, 1,2,3°7, 6, 3,2, 1, 23,6. How many page faults would occur for the following replacement.algarithms, assuming three, four, five and six frames? Allframes are initially @mpty, so first unique pages willall cast one fault each a) LRU replacement b) FIFO replacement ©) Optimal replacement 17. Consider the following sat of protesses, with the length of the CPU-burst time given in milliseconds: Process Burst Time Priority, PA 10 # P2 1 1 Ps 2 3 Pa 1 4 PS & 2 The prozesses are assumed to have arrived in the order P1, P2,P3, P4, PS, all at‘time 0. ) Draw four Gantt chats illustrating the execution of these processes using, FOFS,SJF, a nonpreemptive priority (a smaller prierity number implies a higher prierity), and ARiquantum = 1) scheduling. b).Whatis the tumaround time of each process tor each of the scheduling algorithms in part a? Find the average turnaround time for all scheduling algorithms, ) What is thee waiting time. of each process for each of the scheduling algorithms in part a? Find the average Waiting time for all scheduling algorithms. dj Which of the schedules in part a results in the minimal average waiting time (over all processes)? “END FDRL Page No:3