Question 1

A(n) __________ is an abstract data type that stores and retrieves items in a last-in-first-out manner.

Accepted Answer

A)  array 
B)  queue 
C)  stack 
D)  vector 
E)  None of these 
A)  array 
B)  queue 
C)  stack 
D)  vector 
E)  None of these C

Question 2

The STL provides containers for deque and queue.

Accepted Answer

A) True 
 B)False  True

Question 3

Given the following code, assume the myQueue object is a queue that can hold integers and that value is an int variable. 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 on line 4, stores the number removed from the queue in the value variable. What will the statement on line 5 display?

Accepted Answer

A)  0 
B)  1 
C)  2 
D)  None of these 
A)  0 
B)  1 
C)  2 
D)  None of these A

Question 4

A __________ stack or queue is built around the linked list.

Accepted Answer

A)  dynamic 
B)  static 
C)  deque-based 
D)  floating-point 
E)  None of these 
A)  dynamic 
B)  static 
C)  deque-based 
D)  floating-point 
E)  None of these

Question 5

A queue is a data structure that stores and retrieves item in the __________ manner.

Accepted Answer

A)  last in, first out 
B)  first in, last out 
C)  first in, first out 
D)  random 
E)  None of these 
A)  last in, first out 
B)  first in, last out 
C)  first in, first out 
D)  random 
E)  None of these

Question 6

A __________ is processed in a manner similar to customers standing in a grocery store check-out line where the first customer in line is the first to be served.

Accepted Answer

A)  stack 
B)  vector 
C)  queue 
D)  All of these 
E)  None of these 
A)  stack 
B)  vector 
C)  queue 
D)  All of these 
E)  None of these

Question 7

A __________ queue is more intuitive and easier to understand than a __________ queue.

Accepted Answer

A)  static, dynamic 
B)  dynamic, static 
C)  deque-like, stack-like 
D)  stack-like, deque-like 
E)  None of these 
A)  static, dynamic 
B)  dynamic, static 
C)  deque-like, stack-like 
D)  stack-like, deque-like 
E)  None of these

Question 8

For a compiler that is older than C++11 it is necessary to put spaces between the angled brackets that appear next to each other when defining a stack.

Accepted Answer

A) True 
 B)False

Question 9

If data is transmitted faster than it can be processed, it can be held in a __________ for processing.

Accepted Answer

A)  stack 
B)  queue 
C)  static array 
D)  static deque 
E)  None of these 
A)  stack 
B)  queue 
C)  static array 
D)  static deque 
E)  None of these

Question 10

Which of the following is a double-ended queue?

Accepted Answer

A)  two-headed stack 
B)  two-tailed vector 
C)  circular array 
D)  deque 
E)  None of these 
A)  two-headed stack 
B)  two-tailed vector 
C)  circular array 
D)  deque 
E)  None of these

Question 11

The __________ operation allows an item to be removed from the stack.

Accepted Answer

A)  push 
B)  pop 
C)  delete 
D)  remove 
E)  None of these 
A)  push 
B)  pop 
C)  delete 
D)  remove 
E)  None of these

Question 12

Given the following code, assume the myStack object is a stack that can hold integers and that value is an int variable. 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 on lines 4 and 6, stores the number popped from the stack in the value variable. What will the statement on line 7 display?

Accepted Answer

A)  0 
B)  1 
C)  2 
D)  3 
E)  None of these 
A)  0 
B)  1 
C)  2 
D)  3 
E)  None of these

Question 13

Static stacks have a __________ size and are implemented as __________.

Accepted Answer

A)  fixed, linked lists 
B)  variable, arrays 
C)  fixed, arrays 
D)  variable, linked lists 
E)  None of these 
A)  fixed, linked lists 
B)  variable, arrays 
C)  fixed, arrays 
D)  variable, linked lists 
E)  None of these

Question 14

A stack can be adapted to store __________ data types.

Accepted Answer

A)  all 
B)  only built-in C++ 
C)  only abstract 
D)  deque-like 
E)  None of these 
A)  all 
B)  only built-in C++ 
C)  only abstract 
D)  deque-like 
E)  None of these

Question 15

Given the following code, assume the myStack object is a stack that can hold integers and that value is an int variable. 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 on lines 4, 5, and 6, stores the number popped from the stack in the value variable. What will the statement on line 7 display?

Accepted Answer

A)  0 
B)  1 
C)  2 
D)  None of these 
A)  0 
B)  1 
C)  2 
D)  None of these

Question 16

The two most common queue operations are push and pop.

Accepted Answer

A) True 
 B)False

Question 17

Select all that apply. The Standard Template Library offers a stack template that may be implemented as a(n)

Accepted Answer

A)  vector 
B)  primary type 
C)  linked list 
D)  deque 
A)  vector 
B)  primary type 
C)  linked list 
D)  deque

Question 18

A dynamic stack starts as an empty linked list.

Accepted Answer

A) True 
 B)False

Question 19

Given the following code, assume the myQueue object is a queue that can hold integers and that value is an int variable. 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 on lines 4 and 6, stores the number removed from the queue in the value variable. What will the statement on line 7 display?

Accepted Answer

A)  0 
B)  1 
C)  2 
D)  3 
E)  None of these 
A)  0 
B)  1 
C)  2 
D)  3 
E)  None of these

Question 20

When an element is added to a queue, it is added to the rear. When an element is removed from the queue, it is removed from the

Accepted Answer

A)  rear 
B)  middle 
C)  front 
D)  depends on how the programmer writes the code 
E)  None of these 
A)  rear 
B)  middle 
C)  front 
D)  depends on how the programmer writes the code 
E)  None of these

A(n) __________ is an abstract data type that stores and retrieves items in a last-in-first-out manner.

The STL provides containers for deque and queue.

A __________ stack or queue is built around the linked list.

A queue is a data structure that stores and retrieves item in the __________ manner.

A __________ is processed in a manner similar to customers standing in a grocery store check-out line where the first customer in line is the first to be served.

A queue is more intuitive and easier to understand than a queue.

For a compiler that is older than C++11 it is necessary to put spaces between the angled brackets that appear next to each other when defining a stack.

If data is transmitted faster than it can be processed, it can be held in a __________ for processing.

Which of the following is a double-ended queue?

The __________ operation allows an item to be removed from the stack.

Static stacks have a size and are implemented as .

A stack can be adapted to store __________ data types.

The two most common queue operations are push and pop.

Select all that apply. The Standard Template Library offers a stack template that may be implemented as a(n)

A dynamic stack starts as an empty linked list.

When an element is added to a queue, it is added to the rear. When an element is removed from the queue, it is removed from the

Introduction to Computers and Programming

Introduction to C

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays and Vectors

Searching and Sorting Arrays

Pointers

Characters, C-Strings, and More About the String Class

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions and Templates

The Standard Template Library

Linked Lists

Recursion

Binary Trees

Filters

Exam 19: Stacks and Queues

A(n) __________ is an abstract data type that stores and retrieves items in a last-in-first-out manner.

The STL provides containers for deque and queue.

A __________ stack or queue is built around the linked list.

A queue is a data structure that stores and retrieves item in the __________ manner.

A __________ is processed in a manner similar to customers standing in a grocery store check-out line where the first customer in line is the first to be served.

A __________ queue is more intuitive and easier to understand than a __________ queue.

For a compiler that is older than C++11 it is necessary to put spaces between the angled brackets that appear next to each other when defining a stack.

If data is transmitted faster than it can be processed, it can be held in a __________ for processing.

Which of the following is a double-ended queue?

The __________ operation allows an item to be removed from the stack.

Static stacks have a __________ size and are implemented as __________.

A stack can be adapted to store __________ data types.

The two most common queue operations are push and pop.

Select all that apply. The Standard Template Library offers a stack template that may be implemented as a(n)

A dynamic stack starts as an empty linked list.

When an element is added to a queue, it is added to the rear. When an element is removed from the queue, it is removed from the

Introduction to Computers and Programming

Introduction to C

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays and Vectors

Searching and Sorting Arrays

Pointers

Characters, C-Strings, and More About the String Class

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions and Templates

The Standard Template Library

Linked Lists

Recursion

Binary Trees

Filters

A queue is more intuitive and easier to understand than a queue.

Static stacks have a size and are implemented as .