Question

Consider a preemptive priority scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher priority. When a process is waiting for the cpu (in the ready queue), its priority changes at a rate . When it is running, its priority changes at a rate . All processes are given a priority of 0 when they enter the ready queue. The parameters and can be set to give many different scheduling algorithms

Answer 1

Answer:

hehehehehehehe hehehehe