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 disk-scheduling algorithm, find the total number of head movements (in tracks) required to service all requests.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. (C) 321
More System Software and Operating System questions
- Arrange the following levels of interrupt protection within the Linux Kernel in order of increasing priority: (A) user mode programs (B) bo…
- Given below are two statements: Statement (I): A thread is a dispatchable unit of work that does not execute sequentially and is not interr…
- Given below are an Assertion (A) and a Reason (R): Assertion (A): I/O protection is ensured by a hardware trap. Reason (R): I/O interrupts…
- Given below are two statements: Assertion A: A process involves a library function to create a thread. Reason R: The threads make system ca…
- In a multi-user operating system, requests for a particular resource arrive at an average rate of 20 per hour (a Poisson arrival process).…
- Given below are two statements: Assertion A: A process involves a library function to create a thread. Reason R: The threads make system ca…