SSTF (Shortest Seek Time First) in Operating Systems - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding SSTF Disk Scheduling

Which of the following best describes the main goal of the SSTF (Shortest Seek Time First) disk scheduling algorithm?

A To select the request closest to the current head position to minimize seek time.

B To process requests in the order they arrive without reordering.

C To always move the disk head in one direction until the end before reversing.

D To prioritize requests based on their arrival time and size.

💡 Hint

Think about how SSTF tries to reduce the movement of the disk head.

SSTF selects the disk I/O request that is closest to the current head position, reducing the seek time compared to other algorithms like FCFS.

📋 Factual

intermediate

SSTF Disk Scheduling Behavior

Given the current head position at track 50 and pending requests at tracks 45, 70, 55, and 40, which request will SSTF service next?

A Track 70

B Track 40

C Track 55

D Track 45

💡 Hint

Calculate the distance from the current head position to each request.

The distances are: 45 (5), 70 (20), 55 (5), 40 (10). Both 45 and 55 are equally close, but SSTF typically picks the first closest request it finds, which is track 45.

🔍 Analysis

advanced

SSTF Starvation Problem

Why can the SSTF disk scheduling algorithm cause starvation for some requests?

A Because SSTF always moves the head in one direction, causing requests in the opposite direction to wait.

B Because SSTF processes requests strictly in arrival order, ignoring seek time.

C Because requests far from the current head position may be delayed indefinitely if closer requests keep arriving.

D Because SSTF prioritizes requests based on their size rather than position.

💡 Hint

Consider what happens if new requests keep appearing near the current head position.

SSTF can cause starvation because requests that are far away may never get serviced if new requests closer to the head keep arriving, delaying the farther ones indefinitely.

❓ Comparison

advanced

Comparing SSTF and SCAN Algorithms

Which statement correctly compares SSTF and SCAN disk scheduling algorithms?

A Both SSTF and SCAN always service requests in the order they arrive.

B SSTF selects the closest request regardless of direction, while SCAN moves the head in one direction servicing all requests until the end before reversing.

C SSTF moves the head in one direction only, while SCAN selects the closest request at each step.

D SCAN causes starvation, but SSTF guarantees fair servicing of all requests.

💡 Hint

Think about the movement pattern of the disk head in both algorithms.

SSTF picks the closest request regardless of direction, which can cause the head to move back and forth. SCAN moves the head in one direction servicing all requests until it reaches the end, then reverses direction.

❓ Reasoning

expert

Calculating Total Seek Time with SSTF

Given the initial head position at track 100 and pending requests at tracks 120, 90, 130, 70, and 110, what is the total seek time (sum of all head movements) if SSTF is used to service all requests?

A 90 tracks

B 80 tracks

C 100 tracks

D 110 tracks

💡 Hint

Calculate the distance to the closest request at each step and sum all movements.

Step 1: Head at 100, closest request is 110 (distance 10).
Step 2: Head at 110, closest is 120 (10).
Step 3: Head at 120, closest is 130 (10).
Step 4: Head at 130, closest is 90 (40).
Step 5: Head at 90, closest is 70 (20).
Total = 10 + 10 + 10 + 40 + 20 = 90 tracks.
However, SSTF picks the closest at each step, so after 100, the closest is 110 (10), then 120 (10), then 130 (10), then 90 (40), then 70 (20). Total is 90 tracks.