Q29
Which data structure would you use for implementing a round-robin scheduling algorithm?
A.
Stack
B.
Binary Search Tree
C.
Queue
AnswerD.
Heap
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board