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