Que. 
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler reevaluates 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?

a. 
This algorithm is equivalent to the firstcomefirstserve algorithm 
b. 
This algorithm is equivalent to the roundrobin algorithm 
c. 
This algorithm is equivalent to the shortestjobfirst algorithm 
d. 
This algorithm is equivalent to the shortestremainingtimefirst algorithm 

Answer:This algorithm is equivalent to the roundrobin algorithm 