Consider a set of n tasks with known runtimes r1, r2....rn to be run on a…
2007
Consider a set of n tasks with known runtimes r1, r2....rn to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?
- A.
Round Robin
- B.
Shortest job first
- C.
Highest response ratio next
- D.
first come first served
Attempted by 276 students.
Show answer & explanation
Correct answer: B
Shortest Job First (SJF) is the scheduling algorithm that maximizes throughput for a fixed set of processes. By prioritizing tasks with the shortest burst times, SJF minimizes average waiting time and reduces context switching overhead compared to algorithms like Round Robin or FCFS.
A video solution is available for this question — log in and enroll to watch it.