GATE | CS | 2013 | Operating System | CPU Scheduling | Question 10

Last Updated :
Discuss
Comments

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

This question is part of this quiz :

GATE CS 2013,OS CPU Scheduling
Tags:
GATE
Operating Systems
GATE CS
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy