Question 1

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.

Accepted Answer

A) True 
 B)False

Question 2

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 3

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

Accepted Answer

A) True 
 B)False

Question 4

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 5

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.) 
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 6

The programmer must declare in advance the size of a dynamic stack or queue.

Accepted Answer

A) True 
 B)False

Question 7

In a dequeue operation, the element at the ________ of the queue is removed.

Accepted Answer

A) middle 
B) front 
C) declaration 
D) mid-point 
E) None of these 
A) middle 
B) front 
C) declaration 
D) mid-point 
E) None of these

Question 8

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 9

A static queue can be implemented as a ________.

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 10

This is a container that provides quick access to elements at the front and the back of the list.

Accepted Answer

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

Question 11

Push and pop are the two most common queue operations.

Accepted Answer

A) True 
 B)False

Question 12

The first item placed onto a stack is always the last item removed from the stack.

Accepted Answer

A) True 
 B)False

Question 13

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 14

The STL provides containers for deque and queue.

Accepted Answer

A) True 
 B)False

Question 15

Stacks are useful data structures for algorithms that work ________ with the ________ saved element in the series.

Accepted Answer

A) last, first 
B) first, last 
C) efficiently, first 
D) efficiently, last 
E) None of these 
A) last, first 
B) first, last 
C) efficiently, first 
D) efficiently, last 
E) None of these

Question 16

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

Accepted Answer

A) rear 
B) middle 
C) front 
D) All of these 
E) None of these 
A) rear 
B) middle 
C) front 
D) All of these 
E) None of these

Question 17

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

Accepted Answer

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

Question 18

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

Accepted Answer

A) True 
 B)False

Question 19

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

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

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.

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

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

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

The programmer must declare in advance the size of a dynamic stack or queue.

In a dequeue operation, the element at the ________ of the queue is removed.

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

A static queue can be implemented as a ________.

This is a container that provides quick access to elements at the front and the back of the list.

Push and pop are the two most common queue operations.

The first item placed onto a stack is always the last item removed from the stack.

Queues that are implemented as arrays are called ________ queues.

The STL provides containers for deque and queue.

Stacks are useful data structures for algorithms that work with the saved element in the series.

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 stack that is implemented as a linked list is known as a deque.

Static stacks have a size, and are implemented as .

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.

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays

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, Templates, and the Standard Template Library Stl

Linked Lists

Recursion

Binary Trees

Filters

Exam 18: Stacks and Queues

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.

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

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

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

The programmer must declare in advance the size of a dynamic stack or queue.

In a dequeue operation, the element at the ________ of the queue is removed.

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

A static queue can be implemented as a ________.

This is a container that provides quick access to elements at the front and the back of the list.

Push and pop are the two most common queue operations.

The first item placed onto a stack is always the last item removed from the stack.

Queues that are implemented as arrays are called ________ queues.

The STL provides containers for deque and queue.

Stacks are useful data structures for algorithms that work ________ with the ________ saved element in the series.

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 stack that is implemented as a linked list is known as a deque.

Static stacks have a ________ size, and are implemented as ________.

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.

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays

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, Templates, and the Standard Template Library Stl

Linked Lists

Recursion

Binary Trees

Filters

Stacks are useful data structures for algorithms that work with the saved element in the series.

Static stacks have a size, and are implemented as .