Chapter 19

Question 1

A(n) ________ is an abstract data type that stores and retrieves items in a last-in-first-out manner.
A) array
B) queue
C) stack
D) vector
E) None of these

Answer 1

C

Question 2

A dynamic stack has a ________ size, and is implemented as a(n) ________.
A) variable, linked list
B) fixed, linked list
C) variable, array
D) fixed, array
E) None of these

Answer 2

A

Question 3

The ________ operation allows an item to be stored on a stack.
A) append
B) add
C) pop
D) push
E) None of these

Answer 3

D

Question 4

The Standard Template Library offers a stack template that may be implemented as a:
A) vector
B) deque
C) linked list
D) All of these
E) None of these

Answer 4

D

Question 5

The following statement:
stack< int, vector<int> > iStack;
indicates:
A) a new stack of integers, implemented as a vector
B) a new stack of integers, implemented as a deque
C) a new stack named vector, implemented as integers
D) a new vector named stack, implemented with integers
E) None of these</int>

Answer 5

A

Question 6

The queue data structure is commonly applied in connection with:
A) managing the order of print jobs
B) communications software
C) operating systems
D) All of these
E) None of these

Answer 6

D

Question 7

Two primary queue operations are:
A) push and pop
B) enqueue and dequeue
C) insert and delete
D) onqueue and offqueue
E) None of these

Answer 7

B

Question 8

A static queue can be implemented as a ________.
A) circular array
B) stack
C) dynamic linked list
D) dynamic vector
E) None of these

Answer 8

A

Question 9

This is a double-ended queue.
A) two-headed stack
B) two-tailed vector
C) circular array
D) deque
E) None of these

Answer 9

D

Question 10

A ________ stack or queue is built around the linked-list.
A) dynamic
B) static
C) deque-based
D) floating point
E) None of these

Answer 10

A

Question 11

This is a container that provides quick access to elements at the front and the back of the list.
A) stack
B) queue
C) deque
D) All of these
E) None of these

Answer 11

C

Question 12

_______ queues are more intuitive and easier to understand than ________ queues.
A) Static, dynamic
B) Dynamic, static
C) Deque-like, stack-like
D) Stack-like, deque-like
E) None of these

Answer 12

B

Question 13

Data structures that can dynamically store elements and can grow and shrink in size are:
A) stacks
B) queues
C) deques
D) All of these
E) None of these

Answer 13

D

Question 14

Stacks are useful data structures for algorithms that work ________ with the ________ saved element in the
series.
A) last, first
B) first, last
C) efficiently, first
D) efficiently, last
E) None of these

Answer 14

B

Question 15

tatic stacks have a ________ size, and are implemented as ________.
A) fixed, linked lists
B) variable, arrays
C) fixed, arrays
D) variable, linked lists
E) None of these

Answer 15

C

Question 16

A stack has two primary operations:
A) push and pull
B) push and pop
C) insert and delete
D) append and delete
E) None of these

Answer 16

B

Question 17

he ________ operation allows an item to be removed from a stack.
A) push
B) pop
C) delete
D) remove
E) None of these

Answer 17

B

Question 18

dynamic stack may be implemented as a(n) ________, and expand or shrink with each push or pop
operation.
A) array
B) structure
C) linked list
D) A and B
E) None of these

Answer 18

C

Question 19

A queue is a data structure that stores and retrieves items in this manner.
A) last in, first out
B) first in, first out
C) first in, last out
D) random
E) None of these

Answer 19

B

Question 20

A ________ is processed in a manner similar to customers standing in a grocery check-out line—the first
customer in line is the first served.
A) stack
B) vector
C) queue
D) All of these
E) None of these

Answer 20

C

Question 21

When an element is added to a queue, it is added to the rear. When an element is removed, it is removed
from the ________.
A) rear
B) middle
C) front
D) All of these
E) None of these

Answer 21

C

Question 22

In a dequeue operation, the element at the ________ of the queue is removed.
A) middle
B) front
C) declaration
D) mid-point
E) None of these

Answer 22

B

Question 23

A dynamic queue can be implemented as a ________.
A) dynamic linked list
B) fixed-length array
C) fixed-length circular array
D) All of these
E) None of these

Answer 23

A

Question 24

Queues that are implemented as arrays are called ________ queues.
A) dynamic
B) stack
C) static
D) deque
E) None of these

Answer 24

C

Question 25

If data is transmitted faster than it can be processed, it can be held in a ________ for processing. A) stack B) queue C) static array D) static deque E) None of these

Answer 25

B

Question 26

A stack can be adapted to store ________ data types. A) all B) only the built-in C++ C) only abstract D) deque-like E) None of these

Answer 26

A

Question 27

A practical application of the stack data type in a computer system is: A) storage of local variables B) tracking nested loops C) tracking nested function calls D) All of these E) None of these

Answer 27

D

Question 28

In the following code, assume the myStack object is a stack that can hold integers, and that value is an int variable. (The lines are numbered for reference purposes.) 1 myStack.push(0); 2 myStack.push(1); 3 myStack.push(2); 4 myStack.pop(value); 5 cout << value << endl; Assume that the pop function, called in line 4, stores the number popped from the stack in the value variable. What will the statement in line 5 display? A) 0 B) 1 C) 2 D) None of these

Answer 28

C

Question 29

In the following code, assume the myStack object is a stack that can hold integers, and that value is an int variable. (The lines are numbered for reference purposes.) 1 myStack.push(0); 2 myStack.push(1); 3 myStack.push(2); 4 myStack.pop(value); 5 myStack.pop(value); 6 myStack.pop(value); 7 cout << value << endl; Assume that the pop function, called in lines 4, 5, and 6, stores the number popped from the stack in the value variable. What will the statement in line 7 display? A) 0 B) 1 C) 2 D) None of these

Answer 29

A

Question 30

n the following code, assume the myStack object is a stack that can hold integers, and that value is an int variable. (The lines are numbered for reference purposes.) 1 myStack.push(0); 2 myStack.push(1); 3 myStack.push(2); 4 myStack.pop(value); 5 myStack.push(3); 6 myStack.pop(value); 7 cout << value << endl; Assume that the pop function, called in lines 4 and 6, stores the number popped from the stack in the value variable. What will the statement in line 7 display? A) 0 B) 1 C) 2 D) 3 E) None of these

Answer 30

D

Question 31

n the following code, assume the myQueue object is a queue that can hold integers, and that value is an int variable. (The lines are numbered for reference purposes.) 1 myQueue.enqueue(0); 2 myQueue.enqueue(1); 3 myQueue.enqueue(2); 4 myQueue.dequeue(value); 5 cout << value << endl; Assume that the dequeue function, called in line 4, stores the number removed from the queue in the value variable. What will the statement in line 5 display? A) 0 B) 1 C) 2 D) None of these

Answer 31

A

Question 32

In the following code, assume the myQueue object is a queue that can hold integers, and that value is an int variable. (The lines are numbered for reference purposes.) 1 myQueue.enqueue(0); 2 myQueue.enqueue(1); 3 myQueue.enqueue(2); 4 myQueue.dequeue(value); 5 myQueue.dequeue(value); 6 myQueue.dequeue(value); 7 cout << value << endl; Assume that the dequeue function, called in lines 4, 5, and 6, stores the number removed from the queue in the value variable. What will the statement in line 7 display? A) 0 B) 1 C) 2 D) None of these

Answer 32

C

Question 33

n the following code, assume the myQueue object is a queue that can hold integers, and that value is an int variable. (The lines are numbered for reference purposes.) 1 myQueue.enqueue(0); 2 myQueue.enqueue(1); 3 myQueue.enqueue(2); 4 myQueue.dequeue(value); 5 myQueue.enqueue(3); 6 myQueue.dequeue(value); 7 cout << value << endl; Assume that the dequeue function, called in lines 4, and 6, stores the number removed from the queue in the value variable. What will the statement in line 7 display? A) 0 B) 1 C) 2 D) 3 E) None of these

Answer 33

B

Question 34

True/False: The first item placed onto a stack is always the last item removed from the stack.

Answer 34

True

Question 35

True/False: A dynamic stack starts as an empty linked list.

Answer 35

TRUE

Question 36

True/False: The pop function in the stack template of the STL does not retrieve the value from the top of the stack.

Answer 36

TRUE

Question 37

True/False: The STL provides containers for deque and queue.

Answer 37

TRUE

Question 38

True/False: The pop function in the stack template does not retrieve the value from the top of the stack. It merely removes it.

Answer 38

TRUE

Question 39

True/False: Endeque and deque are the two most common queue operations.

Answer 39

False

Question 40

True/False: A real-world example of the queue data structure can be seen in a stack of cafeteria trays, where the last tray pushed onto the stack is the first tray removed

Answer 40

False

Question 41

True/False: In a static stack class, the constructor function can dynamically allocate memory for the stack array.

Answer 41

True

Question 42

True/False: Stacks and queues can be implemented as arrays or linked lists.

Answer 42

True

Question 43

rue/False: The programmer must declare in advance the size of a dynamic stack or queue.

Answer 43

False

Question 44

True/False: A stack that is implemented as a linked list is known as a deque.

Answer 44

False

Question 45

True/False: Push and pop are the two most common queue operations.

Answer 45

False

Question 46

True/False: When the program knows the exact contents of a list and can access any element on demand, the data structure is known as a stacked deque.

Answer 46

False

Question 47

True/False: If you are using a compiler that is older than C++ 11, be sure to put spaces between the angled brackets that appear next to each other when defining a stack.

Answer 47

False-