Chapter 18, Problem 26RQE

Explanation of Solution

Static queue:

• A static queue has fixed size.
• The usual implementation is in the form of an array.
• The starting size of the queue should be specified.
• The elements cannot be added if the specified size is full.
• The sides in which the items are inserted are called as “Rear” end, and which are deleted is called as “Front” end.

Operations performed on static queue:

A static queue can perform two operations. They are:

• Enqueue
• Dequeue

Static queue uses circular array:

Problems overcome by using circular array:

1. (i) The circular array “wraps around” the queue elements at the end of the array.
2. (ii) In static queue, if the “rear” position is at the last of the queue array, it cannot be moved further when an element is inserted. In the below diagram, when another element called “enqueue(50)” needs to be inserted, the “Rear” position cannot be moved further because, the queue size is full...