GATE Papers >> CSE >> 2013 >> Question No 10

Question No. 10 CSE | GATE 2013

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

Answer : (B) This algorithm is equivalent to the round-robin algorithm.

zNEOha levitra nizagara

Posted on  18/10/2020 20:54:02  by  dobsonz
Leave a comment