Back to the 2024 paper
Similar questions
OPERATING SYSTEMConsider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 124 65 67. Considering FCFS (first cum first served) scheduling, the total number of head movements is, if the disk head is initially at 53 is? (i) 600 (ii) 630 (iii) 620 (iv) 64020242mOPERATING SYSTEMSuppose a disk drive has cylinders, numbered 0 to 299. The current head position of the disk is at 90. The queue of pending requests, in FIFO order is 36, 79, 15, 120, 199, 270, 89, 170. Calculate the average cylinder movements for Shortest-Seek Time First (SSTF) algorithm. Mention the disadvantages of SSTF.20237mOperating SystemSuppose a disk has 100 cylinders, numbered from 0 to 99. At some time the disk arm is at cylinder 50, and there is a queue of disk access requests for cylinders 4, 34, 10, 7, 19, 73, 2, 15, 6 and 20. Assuming that shortest seek-time first (SSTF) is being used for scheduling the disk access. Calculate the total time taken to satisfy all requests if it takes 1 millisecond to move from one cylinder to adjacent one.20227mOperating SystemSuppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending request, in FIFO order is: 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 Starting from the current head position, applying Shortest-seek-time-first (SSTF) algorithm find what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests.20257m
PreviousDescribe the techniques for recovery from deadlock? Explain briefly resource allocation graph with examples.NextWhat is the difference between fixed partition and variable partition also explains the need of compaction.
Official AppAndroid App
PYQDeck for Android
Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.