Q65
Which data structure allows for the efficient implementation of a circular buffer?
A.
Deque
B.
Heap
C.
Circular Queue
AnswerD.
Stack
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board