Question 1

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

Accepted Answer

A queue operates on a FIFO (first-in, first-out) basis, unlike a stack which operates on a LIFO (last-in, first-out) basis.

Question 2

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

Accepted Answer

In a queue, the first element placed is the one visible or accessible for removal, following the First-In-First-Out (FIFO) principle, not the last element placed.

Question 3

Which of the following functions represents an operation that is specified in a Queue ADT?

Accepted Answer

The "front" function is a typical operation in a Queue ADT, which returns the element at the front of the queue without removing it.

Question 4

Consider the following set of operations performed against a string type queue called my_queue.

my_queue.push("First Come");
    my_queue.push("First Serve");
    cout << my_queue.front() << endl;

Which string is output?

Accepted Answer

The answer of Consider the following set of operations performed...

Question 5

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

Accepted Answer

Accessing the front of an empty queue (which is the case when the queue is first exercised without any prior push operations) will cause a run-time error because there is no element to access.

Question 6

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

Accepted Answer

The answer of A queue is similar to a(n) __________...

Question 7

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

Accepted Answer

The answer of The standard library defines the queue as...

Question 8

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

Accepted Answer

The answer of Insertions are at the __________ of a...

Question 9

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

Accepted Answer

The push function adds an element to the queue, while the pop function removes an element from the queue. Both functions change the number of elements in the queue. Functions like empty and size check if the queue is empty and return the number of elements in the queue, respectively, without altering the number of elements. The front function returns the front element without removing it, thus not changing the number of elements.

Question 10

A complete definition and implementation of the queue class would include a copy constructor, assignment operator, swap function, and __________ as required by the "rule of three."

Accepted Answer

The answer of A complete definition and implementation of the...

Question 11

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

Accepted Answer

Shifting elements in a queue based on a linear array involves moving each element, which takes time proportional to the number of elements, n, making it an O(n) operation.

Question 12

Suppose my_queue contains the symbols % $ @ ! #in order from front to rear. After three pop operations, which symbol is at the front of the queue?

Accepted Answer

The answer of Suppose my_queue contains the symbols % $...

Question 13

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?

Accepted Answer

The rear marker always points to the last item in the queue. After deleting the first two items (1 and 1), the queue contains 2, 3, 5, 8, with 8 still being the last item. Therefore, the rear marker points to 8.

Question 14

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

Accepted Answer

The answer of In the Array_Queue.tc, the cost of reallocating...

Question 15

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

Accepted Answer

All three implementations of the Queue ADT (array, linked list, and circular buffer) have the same time complexity for enqueue and dequeue operations, which is O(1).

Question 16

C++ stores a copy of the data for a queue element in each node in addition to the links.

Accepted Answer

In a queue implementation using a linked list in C++, each node typically contains the data (or a copy of the data) and a pointer (or link) to the next node in the sequence, thus storing both the data and the links.

Question 17

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

Accepted Answer

The answer of A(n) __________ is an abstract data type...

Question 18

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

Accepted Answer

The answer of The std::deque supports random-access __________ (not supported...

Question 19

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

Accepted Answer

The answer of The current capacity of the deque is...

Question 20

Which of the following is the critical line missing from the dequeu class pop_front () function? template void deque::pop_front() { offset++; if (offset = BLOCK_SIZE) { the_data.pop_front(); offset = 0; } num_items--; }

Accepted Answer

The answer of Which of the following is the critical...

Quiz 7: Queues and Deques