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
Answer: B. Shortest job first
Explanation: SJF minimizes average waiting time and maximizes throughput by completing shorter tasks first.