COMPUTER SOFTWARE
OPERATING SYSTEMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following best describes the round robin scheduling algorithm?
|
|
Deals with each process in the order in which they arrive
|
|
|
Deals with each process in turn allocating each a time slice of processor time
|
|
|
Deals with each process aiming to complete the process requiring the least amount of processing time first
|
|
|
Uses many queues to prioritise processes for execution
|
Explanation:
Detailed explanation-1: -The correct answer is degenerate to first come first serve. The Round-Robin scheduling is known for the preemptive version of the first come first serve schedule algorithm.
Detailed explanation-2: -A preemptive scheduler will allow a particular process to run for a short amount of time called a quantum (or time slice).
There is 1 question to complete.