Disk scheduling algorithms are designed to minimize ________ and/or ________, depending on the system's requests.
A) seek time, rotational latency
B) seek latency, rotational time
C) request rate, turnaround time
D) none of the above

Question

Quizplus · Accepted Answer

Disk scheduling algorithms aim to minimize seek time, which is the time taken for the disk's read/write head to move to the track where the data is located, and rotational latency, which is the delay waiting for the rotation of the disk to bring the required disk sector under the read-write head.

Disk Scheduling Algorithms Are Designed to Minimize ________ And/or ________

Disk Scheduling Algorithms Are Designed to Minimize And/or