Concept drill
scheduling
GATE CSE & IT · Process Scheduling · 1990-2016
3
PYQs
33%
keyed
0
elite explanations
3
years appeared
Study anchor
Galvin — Operating System Concepts
Processes, scheduling, memory, files, deadlocks
Practice action
Start latest PYQPYQs in this concept
All concepts →2016 PYQ
Suppose the functions $$F$$ and $$G$$ can be computed in $$5$$ and $$3$$ nanoseconds by functional units $${U_F}$$ and $${U_G},$$ respectively. Given two instances of $${U_F}$$ and...
medium
1995 PYQ
Which scheduling policy is most suitable for a time-shared operating systems?
easyanswer keybasic explanation
1990 PYQ
The highest-response ratio next scheduling policy favours $$.......$$ jobs, but it also limits the waiting time of $$ .....$$ jobs.
medium