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?
- A.
First come first serve
- B.
Round Robin
- C.
Shortest job first
- D.
Highest response ratio next
Attempted by 639 students.
Sign up free to check your answer
Sign up freeLoading lesson…

