Suppose a system contains n processes and system uses the round-robin…
2015
Suppose a system contains n processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited for ready queue of the process
- A.
stack
- B.
queue
- C.
circular queue
- D.
tree
Attempted by 309 students.
Show answer & explanation
Correct answer: C
In Round-Robin scheduling, processes are executed in a cyclic order. A circular queue is the most suitable data structure for the ready queue because it efficiently handles the wrap-around nature of the algorithm without requiring element shifting, allowing processes to be dequeued and enqueued seamlessly as time slices expire.
A video solution is available for this question — log in and enroll to watch it.