Queue Operations are......
1· Enqueue—Add an item(new item in back side) to the end of the queue.
2· Dequeue—Remove an item from the front.
3· Queue Front—Who is first?
4· Queueu End—Who is last?
Circular queue may be viewed as the array that holds the queue elements in circular rather than as a straight line. That means we may imagine that the first element of the array immediately follows the last elements.
To represent(create) a queue we require a one dimensional array of some maximum size(int queue_arra[MAX];) to hold the data items and two other variable (int rear = -1;int front = -1;) to point to the beginning and the end of the queue.