A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
a. Shortest remaining time first
b. Round-robin with time quantum less than the shortest CPU burst
c. Uniform random
d. Highest priority first with priority proportional to CPU burst length
Answer:Shortest remaining time first
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: