# GATE | GATE CS 2013 | Question 65

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?**(A)** This algorithm is equivalent to the first-come-first-serve algorithm**(B)** This algorithm is equivalent to the round-robin algorithm.**(C)** This algorithm is equivalent to the shortest-job-first algorithm..**(D)** This algorithm is equivalent to the shortest-remaining-time-first algorithm**Answer:** **(B)****Explanation:** The scheduling algorithm works as round robin with quantum time equals to T. After a process’s turn comes and it has executed for T units, its waiting time becomes least and its turn comes again after every other process has got the token for T units.

Quiz of this Question

Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in **GATE Test Series Course**.

Learn all **GATE CS concepts with Free Live Classes** on our youtube channel.