Computer Science · Operating Systems
Match List-I with List-II regarding Disk Scheduling concepts and choose the correct option: List-IList-II(A) Seek Time(I) Total number of bytes transferred, divided by the total time between the first request and the completion of the last transfer(B) Access Time(II) Time taken for the disk to rotate the desired sector to the disk head(C) Rotational Latency(III) Seek Time + Rotational Latency(D) Disk Bandwidth(IV) Time taken for the disk arm to move the heads to the cylinder containing the desired sector
- 1(A)-(IV), (B)-(III), (C)-(II), (D)-(I)✓
- 2(A)-(I), (B)-(II), (C)-(IV), (D)-(III)
- 3(A)-(I), (B)-(III), (C)-(II), (D)-(IV)
- 4(A)-(I), (B)-(I), (C)-(III), (D)-(IV)
Correct answer
(A)-(IV), (B)-(III), (C)-(II), (D)-(I)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Operating Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Operating Systems