Exam 5: Queues

Simulations are often implemented using ______ to represent waiting lines.

Queue elements are processed in a FIFO manner-the first element in is the first element out.

What are some of the other operations that might be implemented for a queue?

A ______ can be used to preserve the order of a set of data.

A ______ is a linear collection whose elements are added on one end and removed from the other.

A circular array implementation of a queue is more efficient than a fixed array implementation of a queue because elements never have to be ___________.

Is it possible for the front and rear references in a linked implementation to be equal?

If you were to place elements on a collection and then wanted to preserve the order, would it be better to use a Stack or a______?