Question

explain circular queue....with example​

Answer 1

Answer:

Answer:Circular Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to make a circle. It is also called 'Ring Buffer'. ...enQueue(value) This function is used to insert an element into the circular queue.

Answer:Circular Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to make a circle. It is also called 'Ring Buffer'. ...enQueue(value) This function is used to insert an element into the circular queue.Explanation:

hoping it will help you follow up for more

Answer 2

Answer:

Circular Queue is a Data structure which is almost like a stack.

In this FIFO is Conducted :- First in first out Principle.

The First position is connected to the last position of another to make a Circle.

It is also know as Ring Buffer .