| Circular Queue | Rear Pointer |
| Isfull | Head |
| Priority Queue | Peek |
| A pointer that indicates the rear (or last) element of a circular queue. | A FIFI data structure, with wraparound code forming a circular arrangement. |
| An alternate term for the front pointer of a circular queue. | A function that checks if a circular queue is full and unable to add more elements. |
| The process of accessing the element with the highest priority in a priority queue without removing it. | A data structure that allows insertion and deletion of elements with different priorities. |