A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

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 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:This algorithm is equivalent to the round-robin algorithm
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: