Suppose a system contains n processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the process
- A. stack
- B. queue
- C. circular queue
- D. tree
Answer: C. circular queue
Explanation: Round robin cycles through processes, best represented by a circular queue.