Back to the 2025 paper
Similar questions
Operating SystemSuppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 2150, and the previous request was at cylinder 1805. The queue of pending requests, in FIFO order, is: 2069; 1212; 2296; 2800; 544; 1618; 356; 1523; 4965; 3681. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for FCFS, SCAN and C-SCAN disk-scheduling algorithms? Draw the head movement diagram also.20239mOPERATING SYSTEMExplain shortest-seek-time-first (SSTF) disk scheduling. Why SSTF scheduling tends to favour middle cylinders over the innermost and outer-most cylinders?201914mOperating SystemExplain shortest-seek-time-first (SSTF) disk scheduling. Why SSTF scheduling tends to favour middle cylinders over the innermost and outer-most cylinders?201914mOPERATING 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) 64020242m