Teaching HPSC Lecturer (Technical) Mock Test 2024 Operating Systems CPU Scheduling Process Scheduling
Consider a system using preemptive based priority scheduling with dynamically changing priorities. A process is assigned a priority of \(\gamma\) on its arrival in ready queue. While its priority increases at the rate of \(\alpha\) in ready queue and the running process priority increases at the rate of \(\beta\). By varying the values of \(\alpha ,\beta ,\;\gamma\) one can achieve different scheduling techniques. What should be the relation between \(\alpha ,\beta ,\;\gamma\) for the scheduling the process based on last in first out?
1
\(\beta > \;\alpha \;and\;\beta > \;\gamma\)
2
\(\gamma > \;\alpha \;and\;\;\gamma > \;\beta\)
3
\(\gamma > \;\alpha \;or\;\;\gamma > \;\beta\)
4
\(\beta > \;\alpha \;or\;\beta > \;\gamma\)
5
Question Not Attempted