Operating Systems | CPU Scheduling | Question 5

If the quantum time of round robin algorithm is very large, then it is equivalent to:
(A) First in first out
(B) Shortest Job Next
(C) Lottery scheduling
(D) None of the above

Answer: (A)

Explanation: If time quantum is very large, then scheduling happens according to FCFS.

Quiz of this Question

My Personal Notes arrow_drop_up

Practice Tags :

Recommended Posts:

1 Average Difficulty : 1/5.0
Based on 1 vote(s)

User Actions