Round-robin scheduling splits up CPU time into little slices, and processes wait in a circular queue for a chance to use a slice of CPU time.
Round-robin has the following properties:
Hence statement B is False.
- Starvation cannot occur. That is, if a job waits long enough, it will receive some service and eventually be completed.
This statement is correct, RR ensure no starvation of jobs.
- Round-robin does not guarantee that jobs will finish in the order that they arrive. For example, if job J1 requires sixty slices of CPU time and J2 requires only one slice, then J2 will finish approximately 59 time slices before J1.
So Statement D also false.