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