Concept drill
shortest-job-first
GATE CSE & IT · Process Scheduling · 1998-2001
2
PYQs
50%
keyed
0
elite explanations
2
years appeared
Study anchor
Galvin — Operating System Concepts
Processes, scheduling, memory, files, deadlocks
Practice action
Start latest PYQPYQs in this concept
All concepts →2001 PYQ
Consider a set of $$n$$ tasks with known runtimes $${r_1},{r_2},.....\,{r_n}\,\,$$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will...
easyanswer keybasic explanation
1998 PYQ
Four jobs are waiting to be run. Their expected run times are $$6, 3, 5$$ and $$x$$. $${\rm I}$$n what order should they be run to minimize the average response time?
easybasic explanation