Question 33

Computer Awareness I/O Management and CPU Scheduling Easy

Which disk scheduling algorithm looks for the track closest to the current head position?

(A) LOOK
(B) SSTF
(C) FCFS
(D) SCAN
✓ Correct Answer: Option B Verified Solution

📘 Step-by-Step Solution & Detailed Explanation:

Solution

Solution

Question: Which disk scheduling algorithm looks for the track closest to the current head position?
Step 1: - FCFS (First Come First Serve): Serves requests in the order they arrive. - SCAN: Moves head in one direction, servicing requests, then reverses. - LOOK: Similar to SCAN but stops at last request in each direction. - SSTF (Shortest Seek Time First): Selects the request with the minimum seek time from the current head position.
Step 2: Since the question asks for the algorithm that picks the track closest to the current head position, the correct choice is SSTF.

✅ Final Answer: SSTF
Correct Option: op_B

Practice Similar I/O Management and CPU Scheduling Questions

Reinforce your conceptual grasp with related questions from CUET-MCA 2025:

Q47 Match List-I with List-II. |c|l| List-I (CPU Scheduling Algorithm) &...
Solve →
Q55 Which of the following scheduler/schedulers is/are also called CPU...
Solve →
Q74 Which CPU scheduling algorithm prefers the process with the shortest burst...
Solve →
Q1 Match List-I with List-II |c|l| List-I & List-II \\ (A)\ Seek Time & (I)\...
Solve →
Q4 In case of Binary search tree which of the following procedure's running...
Solve →
Full-Length Test Series

Prepare for CUET-MCA Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series →