Latest Gate Aptitude Question SOLUTION: 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

• Placement Papers
• /
• Gate

Gate Question Papers:

(#M40029623) GATE question GATE - CS Keep an EYE

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?

Option
(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.

Asked In Gate Rats (10 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (1) Submit Your Solution