Vidyalelo
Data Structure · Q37

Queues in Data Structures

Programming · Data Structure · question 37

Q37

How do you handle the overflow situation in a queue implemented using a circular buffer?

A.
By resizing the buffer dynamically
B.
By wrapping around when the end is reached
Answer
C.
By resetting the buffer size
D.
By adding elements at a different position

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board