GATEverse Practice, past papers & mock tests
GATE 2016 · CS1 - Forenoon
Operating SystemsProcess Management-ImediumMCQ1 mark
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?
Save your progress

Related Operating Systems PYQs