In the ________ disk scheduling algorithm, the disk head moves from one end of the disk to the other, servicing requests along the way. When it reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. (D) C-SCAN
More System Software and Operating System questions
- 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?
- In UNIX, files are protected using a 9-bit permission mode ("rights bits"). Consider the statements: (I) A mode of 641 (octal) means the ow…
- A disk head is initially positioned at track 32. The disk I/O request queue, in arrival order, is: 98, 37, 14, 124, 65, 67. Using the FCFS…
- Arrange the following levels of interrupt protection within the Linux Kernel in order of increasing priority: (A) user mode programs (B) bo…