data organization to implement queue as circular arraywe must maintain count field and two markers the count field is necessary to keep track of how many items are currently in the queue since only portion of the array may actually contain queue items the markers indicate the array elements containing the first and last items in the queue consider the following circular arrayfront front back count back which illustrates the implementation of the queue from figure the figure shows the corresponding abstract and physical views of the circular array new items are added to the queue by inserting them in the position immediately following the back marker the marker is then advanced one position and the counter is incremented to reflect the addition of the new item for examplesuppose we enqueue value into the sample queue the back marker is advanced to position and value is insertedfront back front back count to dequeue an itemthe value in the element marked by front will be returned and the marker is advanced one positionfront back front back count notice the remaining items in the queue are not shifted insteadonly the front marker is moved nowsuppose we add values and to the queue these values are added in the positions following the back marker