Consider a set of n tasks with known runtimes r1, r2....rn to be run on a…
ISRO Scientist/Engineer SC · 2007 · Computer ScienceGATE · 2001 · CS · Question 1 subparts
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 cum first served
Attempted by 1348 students.
Sign up free to check your answer
Sign up freeLoading lesson…