enQueue
, check if the queue is full. If not, insert the element at the tail and increment the tail pointer (modulus the capacity).deQueue
, check if the queue is empty. If not, remove the element from the head and increment the head pointer (modulus the capacity).Front
, return the element at the head pointer if the queue is not empty.Rear
, return the element at the tail pointer if the queue is not empty.isEmpty
, check if the size is zero.isFull
, check if the size is equal to the capacity of the queue.