Q38
Which data structure would you use to implement a system where elements need to be both added and removed in FIFO order but with a fixed size?
A.
Deque
B.
Priority Queue
C.
Stack
D.
Circular Queue
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board