Question 1

Stacks are useful data structures for algorithms that work with lists of items in a

Accepted Answer

A) last in, last out order. 
B) first in, first out order. 
C) garbage in, garbage out order. 
D) first in, last out order. 
E) None of the above 
A) last in, last out order. 
B) first in, first out order. 
C) garbage in, garbage out order. 
D) first in, last out order. 
E) None of the above D

Question 2

Stacks and queues can be implemented as arrays or linked lists.

Accepted Answer

A) True 
 B)False  True

Question 3

Queues that are implemented as arrays are called queues.

Accepted Answer

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

Question 4

If information is transmitted faster than it can be processed, it can be held in a while it awaits processing.

Accepted Answer

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

Question 5

Push and pop are the two most common queue operations.

Accepted Answer

A) True 
 B)False

Question 6

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

Accepted Answer

A) deque. 
B) linked list. 
C) vector. 
D) All of the above 
E) None of the above 
A) deque. 
B) linked list. 
C) vector. 
D) All of the above 
E) None of the above

Question 7

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

Accepted Answer

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

Question 8

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) middle. 
B) front. 
C) rear. 
D) All of the above 
E) None of the above 
A) middle. 
B) front. 
C) rear. 
D) All of the above 
E) None of the above

Question 9

Two primary queue operations are

Accepted Answer

A) push and pop. 
B) insert and delete. 
C) onqueue and offqueue. 
D) enqueue and dequeue. 
E) None of the above 
A) push and pop. 
B) insert and delete. 
C) onqueue and offqueue. 
D) enqueue and dequeue. 
E) None of the above

Question 10

The statement stack< int, vector > iStack; creates

Accepted Answer

A) a new stack of integers, implemented as a deque. 
B) a new stack called vector, implemented as integers. 
C) a new vector called stack, implemented with integers. 
D) a new stack of integers, implemented as a vector. 
E) None of the above 
A) a new stack of integers, implemented as a deque. 
B) a new stack called vector, implemented as integers. 
C) a new vector called stack, implemented with integers. 
D) a new stack of integers, implemented as a vector. 
E) None of the above

Question 11

The operation allows an item to be stored on a stack.

Accepted Answer

A) add 
B) append 
C) pop 
D) push 
E) None of the above 
A) add 
B) append 
C) pop 
D) push 
E) None of the above

Question 12

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

Accepted Answer

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

Question 13

A dynamic stack may be implemented as a(n), and expand or shrink with each push or pop operation.

Accepted Answer

A) linked list 
B) structure 
C) array 
D) A and B 
E) None of the above 
A) linked list 
B) structure 
C) array 
D) A and B 
E) None of the above

Question 14

The pop function in the stack template of the STL does not return the value from the top of the stack.

Accepted Answer

A) True 
 B)False

Question 15

A practical application of the stack data type is

Accepted Answer

A) the tracking of the order of calls and returns of functions in a program. 
B) the tracking of the order of entry into and exit from nested loops. 
C) the storage of local variables in a function call. 
D) All of the above 
E) None of the above 
A) the tracking of the order of calls and returns of functions in a program. 
B) the tracking of the order of entry into and exit from nested loops. 
C) the storage of local variables in a function call. 
D) All of the above 
E) None of the above

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

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) vector 
B) stack 
C) queue 
D) All of the above 
E) None of the above 
A) vector 
B) stack 
C) queue 
D) All of the above 
E) None of the above

Question 18

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

Accepted Answer

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

Question 19

A static queue can be implemented as a

Accepted Answer

A) circular array. 
B) stack. 
C) dynamic vector. 
D) dynamic linked list. 
E) None of the above 
A) circular array. 
B) stack. 
C) dynamic vector. 
D) dynamic linked list. 
E) None of the above

Question 20

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

Accepted Answer

A) True 
 B)False

Stacks are useful data structures for algorithms that work with lists of items in a

Stacks and queues can be implemented as arrays or linked lists.

Queues that are implemented as arrays are called queues.

If information is transmitted faster than it can be processed, it can be held in a while it awaits processing.

Push and pop are the two most common queue operations.

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

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

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

Two primary queue operations are

The statement stack< int, vector<int> > iStack; creates

The operation allows an item to be stored on a stack.

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

A dynamic stack may be implemented as a(n), and expand or shrink with each push or pop operation.

The pop function in the stack template of the STL does not return the value from the top of the stack.

A practical application of the stack data type is

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

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(n)is an abstract data type that stores and retrieves items in a last- in- first- out manner.

A static queue can be implemented as a

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

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, and Algorithm Analysis

Pointers

More About Classes and Object-Oriented Programming

More on C-Strings and the String Class

Advanced File and Io Operations

Recursion

Polymorphism and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Binary Trees

Filters

Exam 18: Stacks and Queues

Stacks are useful data structures for algorithms that work with lists of items in a

Stacks and queues can be implemented as arrays or linked lists.

Queues that are implemented as arrays are called queues.

If information is transmitted faster than it can be processed, it can be held in a while it awaits processing.

Push and pop are the two most common queue operations.

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

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

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

Two primary queue operations are

The statement stack< int, vector<int> > iStack; creates

The operation allows an item to be stored on a stack.

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

A dynamic stack may be implemented as a(n), and expand or shrink with each push or pop operation.

The pop function in the stack template of the STL does not return the value from the top of the stack.

A practical application of the stack data type is

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

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(n)is an abstract data type that stores and retrieves items in a last- in- first- out manner.

A static queue can be implemented as a

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

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, and Algorithm Analysis

Pointers

More About Classes and Object-Oriented Programming

More on C-Strings and the String Class

Advanced File and Io Operations

Recursion

Polymorphism and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Binary Trees

Filters