Solution

The correct answer is A, B, C

Key Points

• Shortest remaining time first scheduling may cause starvation: True. In the shortest remaining time first scheduling policy, the process with the shortest remaining time gets the CPU next. However, if short processes keep coming, a long process may never get the CPU, causing starvation.
• Preemptive scheduling may cause starvation: True. In preemptive scheduling, if a process with higher priority arrives, the current running process might be preempted. This can lead to a situation where a low-priority process may never get a chance to execute, which could potentially cause starvation.
• Round robin is better than FCFS in terms of response time: True. In Round Robin scheduling, each process gets a small unit of CPU time (time quantum), usually 10-100 milliseconds. After this time has elapsed, the process is preempted and added to the end of the queue. If there are n processes in the queue and the time quantum is q, then each process gets 1/n of the CPU time in chunks of at most q time units at once. This reduces the average waiting time and improves the response time compared to FCFS (First Come First Serve) where the process that arrives first is executed first and subsequent processes have to wait for the prior process to complete execution.