Question

How to find if a circular queue is full where as circular queue is implemented using array? A sample code would be helpful?

Answer 1

Hope you know the implementation of circular queue. You need to maintain a count, and increase the count when you insert an element into the circular queue and delete the count when you delete from the circular queue. you will be knowing the array size i.e. circular queue size. therefore u will know that the circular queue is full when the array is full.

if(count==arr_sz)
printf("\n circular queue is full\n");