Which of the following statements are true?

I. Shortest remaining time first scheduling may cause starvation II. Preemptive scheduling may cause starvation III. Round robin is better than FCFS in terms of response time

Keep practicing — related questions

• Which of the following statements is incorrect?
• Which of the following algorithms never suffers from starvation?
• Which of the following CPU scheduling algorithms can be preemptive as well as non-preemptive?
• Which of the following algorithms is non preemptive?
• Which of the following is a pre-emptive scheduling algorithm?
• which one of following are scheduling algorithm
• Which CPU scheduling algorithm is probably the most optimal in terms of turnaround/response time?
• Which scheduling algorithm gives minimum average waiting time?