Vidyalelo
Data Structure · Q24

Queues in Data Structures

Programming · Data Structure · question 24

Q24

In a fixed-size queue implemented using an array, how do you manage the wrap-around situation?

A.
By using a circular array
Answer
B.
By increasing the array size
C.
By resetting the array index
D.
By using a dynamic array

Answer: Option A

Solution

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