Consider a disk system having 60 cylinders. Disk requests are received by the disk drive for cylinders 10, 22, 20, 2, 40, 6, and 38, in that order. Assuming the disk head is currently at cylinder 20, what is the time taken to satisfy all the requests if it takes 2 milliseconds to move from one cylinder to an adjacent one and the Shortest Seek Time First (SSTF) algorithm is used?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. (C) 120 milliseconds
More System Software and Operating System questions
- A disk queue has requests for I/O on cylinders 98, 183, 37, 122, 14, 124, 65, 67, with the disk head currently at cylinder 53. Using the sh…
- Consider the following statements about UNIX file permissions: (A) UNIX provides three permission types — Read, Write and Execute. (B) UNIX…
- In the ________ disk scheduling algorithm, the disk head moves from one end of the disk to the other, servicing requests along the way. Whe…
- Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225 KB, 75 KB, 60 KB, 275 KB and 65 KB respectively. Th…
- Match the following for the UNIX file system: List I: (A) Boot block (B) Super block (C) Inode block (D) Data block List II: (I) Contains i…
- Which of the following statements about the UNIX file system is NOT correct?