FIFO Queues

External interface

• Create (queue Q)

• queuetype Front (queue Q)

• Enqueue (queuetype item, queue Q)

• queuetype Dequeue (queue Q)

• boolean Empty (queue Q)

Implementations

Queues are also a limited form of list (where all inserts take place on at end, called the front, and all delete operations take place at the other end, called the rear), so all implementations for lists apply.

• Implement queue in terms of list operations.

• Use circular array implementation, with front and rear pointers (indices).