Circular Queues:-

A more efficient queue representation is get by regarding the array Q(1:n) as circular. It becomes more convenient to declare the array as Q(O: n-1), when  rear = n-1, the next element is extended at Q(O) in the case that spot in free. Front will always point one position counter clockwise from the first element in the queue. Again, front = rear if and only if the queue is empty. Initially we have  front = rear = 1. In order to add an element it will be essential to move rear one position clockwise i.e.