(Please write your Exam Roll No) Exam Roll No. END TERM EXAMINATION ‘FIFTH SEMESTER [BCA] DECEMBER 2016 Paper Code: BCA-301 Subject: Operating Systems Time: 3 Hours Maximum Marks: 75 Qi @ Q3 a4 Select one question from each Unit. Attempt the following: (2.5x10=25) (a) What are the main functions of operating system? (b) Is it possible to have a deadlock involving only one process? Explain. (c) Explain the various states of a process. (d) Differentiate between logical and physical address. (e) Explain thrashing. (), What is Belady’s anomaly? (g) Explain Race condition. (h) Explain RAID. (i) What are the various types of devices? Explain. () Differentiate between starvation and deadlock. Unit-1 (a) Define operating systems. Discuss in detail how the operating system can be classified into different categories? (8.5) (b) Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), how would each of the first-fit, best fit, and worst- fit algorithms place processes of 212 KB, 417 KB, 112 KB and 426 KB (in order)? Which algorithm makes the most efficient use of memory?(4) (a) Under what circumstances do page faults occur? Describe the actions taken by the operating system when a page fault occurs. (4.5) (b) Consider the reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, ©, 1, 7, 0, 1. If3 frames are there in the memory then how many page faults will be there using FIFO, Optimal and LRU page replacement algorithms? (8) Unit-I ‘ Consider the following set of processes, with the length of the CPU-burst time given in nanoseconds: Process | Arrival Time | Burst Time | Priority | Py oO 10 3 P2 1 - 1 a 2 3.4 Py 4 1 4 Ps 6 5 2 Time Quantum = 2ns. Calculate the average waiting time and average turnaround time using FIFO, SJF(Preemptive and Non-Preemptive), RR, Priority Algorithm. (12.5) P.T.O. BCAA PiyaOs 6 Qq7 8 Q9 £24 (a) Explain PCB. (8.5) (b) Explain Dining Philosophers Problem in detail. (4) Unit-II Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 147, and the previous request was at cylinder 125, The queue of pending requests, in FIFO order, is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all FIFO, SSTF, SCAN, LOOK, C-SCAN, C-LOOK. (12.5) (a) Consider the following snap shot of a system: Process| Allocation Max Available A [Bi cip/aTaiclpvatatci{D Po |ofoli/2fololi/2{/ils{2to Pi {ilojofolil7{[slo Pp |il[3{s|4/2{3ls5l6 [ps Tole|sl2loléels|2 Ps ofovil4{foleltsle Answer the following questions using the banker's algorithm: (8.5) () What is the content of Need matrix? (ii) Is the system in safe state? (iif a request from process p1 arrives for (0, 4, 2, 0). Can be request be granted immediately. (b) What are the various ways for deadlock prevention? Explain, (4) Unit-IV (a) How will you protect files of a user from other user in a computer? Discuss. (6) (b] Describe directory structure of a file system. (6.5) List the advantages and disadvantages of the following File-Allocation methods: (12.5) (a) Contiguous Memory allocation (b) Linked Allocation (6) Indexed Allocation