Question

Which of the following statements are true ? (GATE 2010)

i) Shortest remaining time first scheduling may cause starvation
ii) Preemptive scheduling may cause starvation
iii) Round robin is better than FCFS in terns of response time

a) i only
b) i and iii only
c) ii and iii only
d) i, ii and iii

Answer 1

Shortest remaining time first scheduling may cause starvation, preemptive scheduling may cause starvation, and round robin is better than FCFS in terms of response time.

Step-by-step explanation:

i) Shortest remaining time first (SRTF) scheduling may cause starvation. In SRTF scheduling, a process with the smallest remaining burst time is selected for execution. If a process with a very large burst time arrives, it may be continuously preempted by processes with smaller burst times, preventing it from ever executing.

ii) Preemptive scheduling may cause starvation. Preemptive scheduling allows a running process to be interrupted and replaced by another process. If a process with a higher priority continuously arrives, it may preempt processes with lower priorities, causing them to starve.

iii) Round robin scheduling is better than FCFS (First-Come, First-Served) in terms of response time. Round robin scheduling ensures that each process gets a fair share of CPU time. In FCFS scheduling, processes are executed in the order they arrive, which can result in longer response times.