Multiple choice

Which of the following CPU scheduling algorithms would a time-sharing system likely use?

  1. FCFS scheduling

  2. Priority based CPU scheduling

  3. Round robin scheduling

  4. Shortest Job First
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

This option is correct as starvation can never occur because no priority is given. Order of time unit allocation is based upon process arrival time, similar to FCFS.

Keep practicing — related questions