Question

write the procedure for Circular Queue full and empty conditions.​

Answer 1

Explanation:

In a circular queue, the element is always deleted from front position.

Check whether queue is Empty means check (front==-1).

If it is empty then display Queue is empty. ...

Check if (front==rear) if it is true then set front=rear= -1 else check if (front==size-1), if it is true then set front=0 and return the element.

Answer 2

Answer:

A circular queue in C stores the data in a very practical manner. It is a linear data structure. It is very similar to the queue. The only difference is that the last node is connected back to the first node. Thus it is called a circular queue. This article will help