Multiple choice Which of the following algorithms never suffers from starvation? FCFS Round-robin SJF Priority scheduling Multilevel queue scheduling Reveal answer Fill a bubble to check yourself B Correct answer Explanation This option is correct as in this type of scheduling, every process is executed for a specified time quantum. When that time quantum expires, the CPU is preempted and given to the next process in the queue. Hence, it does not involve any starvation.