Solution:(A) Shortest remaining time first scheduling is pre-emptive version of shortest job scheduling. In SRTF, Job with the shortest CPU burst will be scheduled first. Because of this process, it may cause starvation is shorter processes may keep coming a long CPU burst process never get CPU.
(B) Pre-emptive just means a process before completing execution stopped and other process can start execution. The stopped process can later come back and continue from where it was stopped. In pre-emptive scheduling, suppose process P1 is executing in CPU and after some time process P2 with high priority then P1 will arrive in ready queue then P1 is pre-empted and P2 will brought into CPU for execution. In this way if process which is arriving in ready queue of higher priority than P1, then P1 is always pr-empted and it may possible that it suffer from starvation.
(C) Round Robin will give better response time than FCFS, in FCFS when process is executing, it executed up to its complete burst time, but in Round Robin it will execute up to time quantum. So Round Robin Scheduling improves response time as all processes get CPU after a specified time. So statements A, B and C is true.