Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67. The seek time is 4 ms per cylinder and the disk head is initially at 53. Calculate the total seek time, if the disk arm scheduling algorithm is SSTF (Shortest seek time first). 

The correct answer is option 4: 944 ms

Key Points

In SSTF (Shortest Seek Time First), the disk head always moves to the request closest to its current position.

Initial Head Position: 53
Request Queue: 98, 183, 37, 122, 14, 124, 65, 67

Step-by-step seek movements:

1. Closest to 53 → 65 (Seek = 12)
2. Closest to 65 → 67 (Seek = 2)
3. Closest to 67 → 37 (Seek = 30)
4. Closest to 37 → 14 (Seek = 23)
5. Closest to 14 → 98 (Seek = 84)
6. Closest to 98 → 122 (Seek = 24)
7. Closest to 122 → 124 (Seek = 2)
8. Closest to 124 → 183 (Seek = 59)

Total Seek Distance: 12 + 2 + 30 + 23 + 84 + 24 + 2 + 59 = 236 cylinders

Seek Time = 236 × 4 ms = 944 ms

NOTE: Based on the above correct order, the actual seek time is 944 ms, which matches Option 4. However, if the problem assumes a different execution order, Option 2 might be marked. Always match the sequence as per SSTF logic.

Hence, the correct answer is: option 4: 944 ms