| 1 | 4 | ||||||||||||||||||||||||
| 2 | |||||||||||||||||||||||||
| 3 | |||||||||||||||||||||||||
1. A FIFI data structure, with wraparound code forming a circular arrangement.
2. A data structure that allows insertion and deletion of elements with different priorities.
3. A function that checks if a circular queue is full and unable to add more elements.
4. A pointer that indicates the rear (or last) element of a circular queue.