alleryStart learning →A scheduling DISCIPLINE (or policy) is BLIND if it
Aknows job arrival times perfectly
Balways serves jobs in FIFO order
Cuses random selection
Ddoes not know the job's run time in advance
Answer & Solution
Correct answer: D. does not know the job's run time in advance
1. OSTEP §7.8 introduces the concept of an ORACLE: a scheduler that knows future job lengths perfectly.
2. SJF and STCF are NON-BLIND policies — they assume the scheduler KNOWS each job's run time. In practice, this is rarely true.
3. BLIND scheduling: the scheduler does NOT know run times. Real OS schedulers are blind by necessity — Linux, FreeBSD, Windows all guess based on observed behaviour.
4. The next chapter's MLFQ is the answer to: how do we approximate SJF/STCF performance without knowing run times?
5. Options A, C, D are unrelated to blindness.
_Source: OSTEP Ch 7, §7.8 (No More Oracle), p. 12._
Keep practising Operating Systems
Browse all Operating Systems questions for GATE CSE, or explore more Computer Science topics.
Related questions
On a MULTI-CORE system, a SPIN LOCK is generallyA LIVELOCK differs from a DEADLOCK in thatSuppose thread A acquires lock L1, then thread B acquires lock L2. Now A tries to acquire A CRITICAL SECTION isA LOCK is considered FAIR ifA LOCK (mutex) is used by concurrent threads toWhich of the following is NOT typically minimised by a CPU scheduler?The PRIMARY DISADVANTAGE of FIFO scheduling is