GATE 2012
April 15, 2024Prefix-Postfix-Expression
April 16, 2024GATE 2013
| Question 10 |
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?
| This algorithm is equivalent to the first-come-first-serve algorithm. | |
| This algorithm is equivalent to the round-robin algorithm. | |
| This algorithm is equivalent to the shortest-job-first algorithm. | |
| This algorithm is equivalent to the shortest-remaining-time-first algorithm. |
Question 10 Explanation:
The given algorithm is equivalent to the round robin algorithm with time quantum T units.
Correct Answer: B
Question 10 Explanation:
The given algorithm is equivalent to the round robin algorithm with time quantum T units.