Consider a set of n tasks with known runtimes r1, r2....rn to be run on a…

PYQ GATE 2001

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?

  1. A.

    Round Robin

  2. B.

    Shortest job first

  3. C.

    Highest response ratio next

  4. D.

    first cum first served

Attempted by 1645 students.

Sign up free to check your answer

Sign up free

Explore the full course: Operating System

Loading lesson…