Consider a uniprocessors machine with a set of n tasks and taken runtime r1,…

Consider a uniprocessors machine with a set of n tasks and taken runtime r1, r2, r3 ,... ,rn. Which of the following scheduling algorithm will result in maximum throughput?

  1. A.

    First come first serve

  2. B.

    Round Robin

  3. C.

    Shortest job first

  4. D.

    Highest response ratio next

Attempted by 639 students.

Sign up free to check your answer

Sign up free

Explore the full course: Isro

Loading lesson…