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