Which of the following statements are true? I. Shortest remaining time first…

Answer: All three statements are true.

• Shortest remaining time first may cause starvation: because it always prefers the process with the shortest remaining time, long-running processes can be repeatedly preempted by newly arriving short jobs and may never complete.

• Preemptive scheduling may cause starvation: preemption allows some tasks (for example, higher-priority ones) to continually take the CPU, which can prevent other tasks from making progress.

• Round robin is better than FCFS in terms of response time: by giving each process a time slice, round robin starts executing every process sooner than FCFS would, so initial response time is typically improved (assuming a reasonable time quantum).