QuizzesDisk Scheduling Algorithms — Concept Check
intermediate
operating-systems

Disk Scheduling Algorithms — Concept Check

Questions on Disk Scheduling Algorithms. Disk scheduling algorithms determine the order in which I/O requests are serviced to minimise total disk head seek time and improve throughput.

8 minutes 8 questions Pass at 70%
Time Limit
8 minutes - timer starts when you begin
Change Answers Freely
Revisit and change any answer before submitting
Full Review After Submit
Correct answers and explanations shown for every question
Auto-submit on timeout
Quiz submits automatically when time runs out

Questions in this quiz

8 questions on Disk Scheduling Algorithms — Concept Check. Work through them here, then start the quiz to answer them and see your score.

  1. 1.A disk scheduling system uses FCFS. The request queue is {98, 183, 37, 122, 14, 124, 65, 67} with an initial head position at 53. What is the total head movement?

    • A236 tracks
    • B640 tracks
    • C530 tracks
    • D482 tracks
  2. 2.In a system using SSTF scheduling, a request at track 14 is often delayed. Why might this happen?

    • ASSTF processes requests in a circular manner, skipping some.
    • BSSTF always processes requests in the order they arrive.
    • CSSTF prioritizes requests with higher data transfer rates.
    • DSSTF minimizes seek time, causing starvation for distant requests.
  3. 3.A disk uses SCAN scheduling. The head is at track 53 moving upwards. The request queue is {98, 183, 37, 122, 14, 124, 65, 67}. Which request is serviced first?

    • A65
    • B98
    • C183
    • D37
  4. 4.A system using C-SCAN scheduling has a request queue {98, 183, 37, 122, 14, 124, 65, 67} and the head starts at 53. After servicing 183, what happens next?

    • AHead continues to the end of the disk before jumping to 14.
    • BHead moves to the next highest request, 37.
    • CHead jumps to the beginning of the disk and services 14.
    • DHead services the next request in queue, 122.
  5. 5.In a Linux system using the mq-deadline scheduler, a request is delayed despite being close to the head. Why?

    • ADeadline scheduler prioritizes requests with deadlines over proximity.
    • BDeadline scheduler ignores deadlines if requests are close.
    • CScheduler processes requests in circular order, causing delays.
    • DScheduler always prioritizes requests in the order they arrive.
  6. 6.What is a key difference between SCAN and C-LOOK scheduling algorithms?

    • ASCAN services requests in one direction only.
    • BC-LOOK always services requests in arrival order.
    • CSCAN jumps to the beginning after reaching the end.
    • DC-LOOK stops at the last request, not the disk edge.
  7. 7.A disk system uses LOOK scheduling. The head is at 53 and the queue is {98, 183, 37, 122, 14, 124, 65, 67}. What is the next request serviced if the head is moving upwards?

    • A65
    • B122
    • C183
    • D98
  8. 8.What is the primary reason SSDs make traditional disk scheduling algorithms less relevant?

    • ASSDs use SCAN scheduling by default.
    • BSSDs have uniform random access times.
    • CSSDs have moving parts that reduce seek time.
    • DSSDs have higher data transfer rates.