Loading…
december code / try / os
No account needed. Answer, see why, move on.
Problem
Which scheduling algorithm can leave a long process waiting indefinitely if short processes keep arriving?
First-come, first-served (FCFS)
Round robin
None of them: every algorithm serves every process eventually
Shortest job first (SJF)
Nothing here is saved. Create a free account to keep your progress, take an assessment and get your readiness score.