Which of the following statements are true?
Answer is (D).
preemtive just means a process before completing its execution is stopped and other process can start execution. The stopped process can later come back and continue from where it was stopped.
can we say that all scheduling algo suffers starvation?
but m not getting any valid reason for FCFS
Why option II is correct.
There are many examples of preemptive scheduling algorithm out of which some may cause starvation and some will not cause any starvation.
Eg. Shortest Remaining time first -starvation may be present,
Round Robin algorithm - starvation is not possible.
So how can we say that Option II is correct??
@Yogesh Dhawale we need atleast one reason to say that "preemptive scheduling algorithm may cause starvation" that we got in our statement 1 i.e "Shortest remaining time first scheduling may cause starvation"(True) so statement 2 is correct.
they are saying in preemptive scheduling algorithm may cause starvation.they are not saying always.there is chance of starvation it is clearly stated in option
Why statement 3 is true ? Round robin is better than FCFS only when time quantum is not larger than largest Burst time of any process....
So it may happen that Round robin degenerate to FCFS & is no longer better than FCFS...
Here there is no such mention of word "may" to assume relaxation... If it had, then Statement would have been correct...