operating systems

Question

A total of 1000 processes (with all having different burst time) are already in the ready queue and it is already known that no upcoming processes will  ever enter the ready queue.If SJF scheduling algorithm is used to schedule the processes to execute.Then the system

A) is starvation free

B) suffers from starvation

Comments

is starvation free as no more process will ever come into ready queue

---

Yes it is starvation free as jobs are scheduled based on their respective burst time and no premption is there.

Answer 1

Starvation free because starvation actually means unbounded waiting.

Since it is mentioned in the question that no upcoming processes will  ever enter the ready queue. There is a bound of maximum 999 process to wait for turn of a process.