Question 1

A static queue can be implemented as a(n) ___________.

Accepted Answer

A)  circular array 
B)  stack 
C)  dynamic linked list 
D)  dynamic vector 
E)  None of these 
A)  circular array 
B)  stack 
C)  dynamic linked list 
D)  dynamic vector 
E)  None of these

Question 2

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 3

A queue is a data structure that stores and retrieves items in this manner.

Accepted Answer

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

Question 4

Queues that are implemented as arrays are called ____________ queues.

Accepted Answer

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

Question 5

Data structures that can dynamically store elements and can grow and shrink in size are:

Accepted Answer

A)  stacks 
B)  queues 
C)  deques 
D)  All of these 
E)  None of these 
A)  stacks 
B)  queues 
C)  deques 
D)  All of these 
E)  None of these

Question 6

A stack that is implemented as a linked list is known as a deque.

Accepted Answer

A) True 
 B)False

Question 7

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?

Accepted Answer

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

Question 8

This 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 9

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.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?

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 10

The STL provides containers for deque and queue.

Accepted Answer

A) True 
 B)False

Question 11

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

Accepted Answer

A) True 
 B)False

Question 12

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

Question 13

The Standard Template Library offers a stack template that may be implemented as a:

Accepted Answer

A)  vector 
B)  deque 
C)  linked list 
D)  All of these 
E)  None of these 
A)  vector 
B)  deque 
C)  linked list 
D)  All of these 
E)  None of these

Question 14

The following statement stack< int, vector > iStack; Indicates:

Accepted Answer

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 
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

Question 15

The ___________ operation allows an item to be removed from a 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 16

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.

Accepted Answer

A) True 
 B)False

Question 17

___________ queues are more intuitive and easier to understand than ______ queues.

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 18

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

Accepted Answer

A) True 
 B)False

Question 19

A stack has two primary operations:

Accepted Answer

A)  push and pull 
B)  push and pop 
C)  insert and delete 
D)  append and delete 
E)  None of these 
A)  push and pull 
B)  push and pop 
C)  insert and delete 
D)  append and delete 
E)  None of these

Question 20

A stack can be adapted to store _________ data types.

Accepted Answer

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

A static queue can be implemented as a(n) ___________.

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

A queue is a data structure that stores and retrieves items in this manner.

Queues that are implemented as arrays are called ____________ queues.

Data structures that can dynamically store elements and can grow and shrink in size are:

A stack that is implemented as a linked list is known as a deque.

This is a double-ended queue.

The STL provides containers for deque and queue.

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

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

The Standard Template Library offers a stack template that may be implemented as a:

The following statement stack< int, vector<int> > iStack; Indicates:

The ___________ operation allows an item to be removed from a stack.

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.

_____ queues are more intuitive and easier to understand than queues.

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

A stack has two primary operations:

A stack can be adapted to store _________ data types.

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays

Searching and Sorting Arrays

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

Structured Data

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Recursion

Binary Trees

Filters

Exam 18: Stacks and Queues

A static queue can be implemented as a(n) ___________.

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

A queue is a data structure that stores and retrieves items in this manner.

Queues that are implemented as arrays are called ____________ queues.

Data structures that can dynamically store elements and can grow and shrink in size are:

A stack that is implemented as a linked list is known as a deque.

This is a double-ended queue.

The STL provides containers for deque and queue.

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

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

The Standard Template Library offers a stack template that may be implemented as a:

The following statement stack< int, vector<int> > iStack; Indicates:

The ___________ operation allows an item to be removed from a stack.

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.

___________ queues are more intuitive and easier to understand than ______ queues.

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

A stack has two primary operations:

A stack can be adapted to store _________ data types.

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays

Searching and Sorting Arrays

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

Structured Data

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Recursion

Binary Trees

Filters

_____ queues are more intuitive and easier to understand than queues.