Which of the following operations of a queue examines the element at the front of
the queue? A) Enqueue
What is the principle difference in behavior between a stack and a queue?
D. a stack preserves order whereas a queue reverses order
Queues operate as _______________.
D. None of the above
D. Heaps
To add an element to a queue you use the method.
D. pop
The shifting of elements in a noncircular array implementation creates an
_______ complexity.
D. O(logn)
A linked implementation of a queue is facilitated by references to the ______ and
______ elements of the linked list.
A. First, second
When an element is removed from a queue using the dequeue operation, that
element is removed from the ____________ of the collection.
D. None of the above
When an element is added to a queue using the enqueue operation, that element
is added to the ____________ of the collection.
D. None of the above
A circular array implementation of a queue is more efficient than a fixed array
implementation of a queue because elements never have to be ___________.
A. added
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 Queue?
removed from the other.
Simulations are often implemented using __<queues>__ to represent waiting
lines.
collection.
When one enqueue’s an element to a queue, you add that element to the
When utilizing a circular array for a queue, complete the line of code that updates
A __<circular array>__ implementation of a queue is the preferable array
implementation because it does not require elements to be shifted.
collection.
True/False. The first operation removes an element at the front of the queue and
returns a reference to it.
in is the first element out.
one end at index 0 eliminates the requirement that elements be shifted.
True/False. Treating arrays as circular eliminates the need to shift elements in
an array queue implementation.
What is the difference between a queue and a stack?
What are the five basic operations on a queue?
The basic queue operations are:
What are some of the other operations that might be implemented for a
queue?
Is it possible for the front and rear references in a linked implementation to be
equal?
Is it possible for the front and rear references in a circular array implementation
to be equal?
Which implementation has the worst time complexity?