Exam 7: Queues and Deques

Which of the following is the critical line missing from the dequeu class pop_front () function?

To run a computer simulation, we must keep track of the current time by maintaining a clock that is set to an initial time of __________.

In the Array_Queue.tc, the cost of reallocating is __________ across each insert operation.

A(n) __________ is an abstract data type that combines the features of a stack and a queue.

The standard library defines the queue as a(n) __________ class that takes any of the sequential containers as a template parameter.

All three implementations of the Queue ADT are comparable in terms of computation time.

The number of elements in an instance of Linked_Queue.tc is changed by functions push and __________.

A queue is similar to a(n) __________ in that you can insert an item at one end and remove it from the other.

A queue is a LIFO (last-in, first-out) list.

The current capacity of the deque is defined by the size of the circular array times the size of a(n) __________ block.

Shifting the elements in a queue based on a linear array is an __________ operation.

In the context of serving airline passengers, a(n) "__________" strategy would be to serve any frequent flyer waiting in line before serving the regular passengers.

Suppose that circular_queue, which is based on a circular array, stores the items 1, 1, 2, 3, 5, 8 in order from front to rear. If the first two items are deleted, which element does the rear marker point to?

Insertions are at the __________ of a queue, and removals are from the front.

Consider the following set of operations performed against a string type queue called my_queue. Which string is output?

In the simulation for serving airline customers, the queue data structure is utilized to store Agent objects.

__________ is a technique used to study the performance of a physical system by using a physical, mathematical, or computer model of the system.

If exercised first, which of the following choices in the Maintain_Queue program will cause a run-time error?

The std::deque supports random-access __________ (not supported by either the stack or the queue).

The last element placed in a queue is the only visible item.