Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The

Back to the 2024 paper

Module 6: I/O & File Management

20247m

Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending request, in FIFO order, is:
86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130
Starting from the current head position, applying Shortest-seek-time-first algorithm find what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests.

This question has repeated before

Also appeared in 2025, 2023.

Search Google Ask AI

Worked SolutionAI Assisted

SSTF total as Q115: 1745 cylinders (same request set 86,1470,913,1774,948,1509,1022,1750,130 from 143) → 1745.

Similar questions

Operating SystemSuppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending request, in FIFO order is: 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 Starting from the current head position, applying Shortest-seek-time-first (SSTF) algorithm find what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests.20257m Operating SystemSuppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 2150, and the previous request was at cylinder 1805. The queue of pending requests, in FIFO order, is: 2069; 1212; 2296; 2800; 544; 1618; 356; 1523; 4965; 3681. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for FCFS, SCAN and C-SCAN disk-scheduling algorithms? Draw the head movement diagram also.20239m Operating SystemSuppose a disk has 100 cylinders, numbered from 0 to 99. At some time the disk arm is at cylinder 50, and there is a queue of disk access requests for cylinders 4, 34, 10, 7, 19, 73, 2, 15, 6 and 20. Assuming that shortest seek-time first (SSTF) is being used for scheduling the disk access. Calculate the total time taken to satisfy all requests if it takes 1 millisecond to move from one cylinder to adjacent one.20227m OPERATING SYSTEMSuppose a disk drive has cylinders, numbered 0 to 299. The current head position of the disk is at 90. The queue of pending requests, in FIFO order is 36, 79, 15, 120, 199, 270, 89, 170. Calculate the average cylinder movements for Shortest-Seek Time First (SSTF) algorithm. Mention the disadvantages of SSTF.20237m

PreviousCompare and contrast between linked and indexed disk allocation strategies.

AI LearningWeb Platform

Coursify — Personal AI Course Generator

Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.

Try Coursify Free