GATE CS 2010 Q25 — CPU Scheduling

Let us analyze each statement individually:

1. Shortest Remaining Time First (SRTF) scheduling may cause starvation:

   True. SRTF is the preemptive version of Shortest Job First (SJF). If there is a continuous stream of short processes arriving in the system, a process with a longer remaining burst time will keep waiting indefinitely, leading to starvation.

2. Preemptive scheduling may cause starvation:

   True. The statement uses the word "may". Preemptive algorithms like SRTF or Preemptive Priority scheduling can cause starvation for longer or lower-priority processes. Since there exist preemptive algorithms that cause starvation, this statement is correct.

3. Round Robin is better than FCFS in terms of response time:

   True. Round Robin (RR) allocates a small time quantum to each process in a cyclic manner, ensuring that every process gets CPU time quickly. This significantly reduces the response time (the time from submission to the first time the process gets scheduled). In contrast, First-Come, First-Served (FCFS) can suffer from the convoy effect, where short processes wait a long time behind a long process, resulting in poor response times.

Since all three statements (I, II, and III) are true, the correct option is D.