Skip to content
Related Articles

Related Articles

Operating Systems | CPU Scheduling | Question 6
  • Last Updated : 15 Jun, 2015
GeeksforGeeks - Summer Carnival Banner

Which of the following is FALSE about SJF (Shortest Job First Scheduling)?

S1: It causes minimum average waiting time
S2: It can cause starvation

(A) Only S1
(B) Only S2
(C) Both S1 and S2
(D) Neither S1 nor S2


Answer: (D)

Explanation:

  1. Both SJF and Shortest Remaining time first algorithms may cause starvation. Consider a situation when long process is there in ready queue and shorter processes keep coming.
  2. SJF is optimal in terms of average waiting time for a given set of processes, but problems with SJF is how to know/predict time of next job.

Refer Process Scheduling for more details.

Quiz of this Question

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :