Question 8814 – Computer-Networks
April 15, 2024Question 8454 – Prefix-Postfix-Expression
April 16, 2024Question 8747 – CPU-Scheduling
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?
Correct Answer: B
Question 9 Explanation:
The given algorithm is equivalent to the round robin algorithm with time quantum T units.
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.
Subscribe
Login
0 Comments