Which of the following statements are true?
(A) Shortest remaining time first scheduling may cause starvation.
(B) Preemptive scheduling may cause starvation.
(C) Round robin is better than FCFS in terms of response time.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. A, B, C
Explanation
(A) is true: shortest-remaining-time-first always favours jobs with less work left, so a continuous stream of short arrivals can starve a long-running process indefinitely. (B) is true more generally: any preemptive policy that keeps favouring one class of process over another (e.g. by priority or remaining time) risks starving the deprioritised processes, since preemption is precisely what lets favoured processes repeatedly cut in line. (C) is true: round robin gives every process a bounded time slice before cycling to the next, so the average response time (time to first response) is far better than FCFS, where a process can sit behind an arbitrarily long job before even starting. All three statements hold, so the answer is A, B, C, option (iv).More Discrete Structures and Optimization questions
- An OS follows round robin scheduling with a time quantum of 4 ms. Assuming that the CPU is free now and there are 20 processes waiting in t…
- If an operating system does not allow a child process to exist when the parent process has been terminated, this phenomenon is called:
- Consider the following 3 processes, with the length of the CPU burst time given in milliseconds: Process Arrival Time Burst Time P1 0 8 P2…
- Assuming that the system call fork() never fails, consider the following C programs P1 and P2 executed on a UNIX/Linux system. P1 P2 int ma…
- Consider the following four processes with the arrival time and length of CPU burst given in milliseconds: Process Arrival Time Burst Time…
- Which module gives control of the CPU to the process selected by the short-term scheduler?