Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2001 | Question 50
  • Difficulty Level : Easy
  • Last Updated : 04 Dec, 2014

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

Answer: (B)

Throughput means total number of tasks executed per unit time i.e. sum of waiting time and burst time.

Shortest job first scheduling is a scheduling policy that selects the waiting process with the smallest execution time to execute next.

Thus, in shortest job first scheduling, shortest jobs are executed first. This means CPU utilization is maximum. So, maximum number of tasks are completed.

Thus, option (B) is correct.

Please comment below if you find anything wrong in the above post.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :