Which of the following statements are true?

1. Shortest remaining time first scheduling may cause starvation
2. Preemptive scheduling may cause starvation
3. Round robin is better than FCFS in terms of response time

Choose the correct answer from the options given below:

Statement 1:

Shortest Remaining Time First $SRTF$ always gives preference to the process having the shortest remaining burst time.

So, if short processes keep arriving, a long process may wait for a very long time.

Therefore, statement $1$ is true.

Statement 2:

Preemptive scheduling allows a running process to be stopped and replaced by another process.

In some preemptive scheduling algorithms, low-priority or long processes may keep waiting.

Therefore, statement $2$ is true.

Statement 3:

Round Robin gives each process a fixed time quantum.

So, every process gets CPU turn quickly, which improves response time compared to FCFS.

Therefore, statement $3$ is true.