GATE-2024-CS1(Forenoon)
March 26, 2025Engineering-Mathematics
March 27, 2025KVS DEC-2017
|
Question 2
|
Consider a set of n tasks with known runtimes R1 ,R2 ,Rn , to be run uniprocessor machine. Which of the following processor scheduling algorithm will result in the maximum throughput?
|
Priority scheduling
|
|
|
Round robin
|
|
|
FCFS
|
|
|
SJF
|
Question 2 Explanation:
→ In shortest job first scheduling algorithm, the processor selects the process with the smallest execution time to execute next.
→ SJF scheduling algorithm will result in the maximum throughput
→ SJF scheduling algorithm will result in the maximum throughput
Correct Answer: D
Question 2 Explanation:
→ In shortest job first scheduling algorithm, the processor selects the process with the smallest execution time to execute next.
→ SJF scheduling algorithm will result in the maximum throughput
→ SJF scheduling algorithm will result in the maximum throughput