alleryStart learning →Three processes arrive at t=0 with bursts 24, 3, 3. The average waiting time under SJF is
A17
B10
C3
D0
Answer & Solution
Correct answer: C. 3
**SJF picks shortest first:** P2 (3), then P3 (3), then P1 (24).
**Waiting times:** P2=0, P3=3, P1=6. Average = (0+3+6)/3 = 3. Under FCFS the average would be 17 (P1 first, P2 waits 24, P3 waits 27).
Same total CPU time; SJF orders to minimise average waiting.
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