ME-OS TEST:Dynamic Priority Scheduling closed

Question

Anyone please check this

Consider the following preemptive priority scheduling algorithms based on dynamically changing priorities. Large priority numbers imply higher priority. When the process is waiting for the CPU in ready queue, its priority changes at a rate " $\alpha$ '; when its running, its priority changes at a rate " $\beta$ '. All processes are given a priority, when they enter the ready queue. Which one of the CPU scheduling algorithm results from $\alpha<\beta<0$ ?<br />

• A. Last-In-First-Out
  
• B. \$t Shortest Job First Algorithm
  
• C. First Come First Serve Algorithm
  
• D. Round Robin Algonthm

Comments

https://gateoverflow.in/86196/me-test-os

---

Here we can see that alpha < beta < 0

means alpha nd beta are negative . and beta is greater tha alpha means priority of running process is getting decreas in faster way as compared to process who are waiting in ready queue.

If we consider the SJF . here the process which is running completing his Burst time having high probability to complete as its Burst time is getting less by the time (as prefered in SJF ). so priority is increasing . So it is not the right option

Last In First Out . Here the the process who is just came inside the ready queue .According to scheduling criteria its priority will get increased in comparision to the process which is running. So it is the right option.