Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

Enqueue and dequeue are the two most common stack operations.

Accepted Answer

A) True 
 B)False

Question 3

The STL provides containers for deque and queue.

Accepted Answer

A) True 
 B)False

Question 4

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

Accepted Answer

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

Question 5

Static stacks have a size, and are implemented using _ .

Accepted Answer

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

Question 6

A dynamic stack has a size, and is implemented as a(n).

Accepted Answer

A) variable, linked list 
B) fixed, array 
C) variable, array 
D) fixed, linked list 
E) None of the above 
A) variable, linked list 
B) fixed, array 
C) variable, array 
D) fixed, linked list 
E) None of the above

Question 7

A _ is a double- ended queue.

Accepted Answer

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

Question 8

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 9

A stack or queue is implemented using linked lists.

Accepted Answer

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

Question 10

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

Accepted Answer

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

Question 11

A stack has two primary operations called

Accepted Answer

A) insert and delete. 
B) push and pull. 
C) append and delete. 
D) push and pop. 
E) None of the above 
A) insert and delete. 
B) push and pull. 
C) append and delete. 
D) push and pop. 
E) None of the above

Question 12

For most people, _ queues are more intuitive and easier to understand than _ queues.

Accepted Answer

A) Deque- like, stack- like 
B) Static, dynamic 
C) Stack- like, deque- like 
D) Dynamic, static 
E) None of the above 
A) Deque- like, stack- like 
B) Static, dynamic 
C) Stack- like, deque- like 
D) Dynamic, static 
E) None of the above

Question 13

The queue data structure is commonly applied in connection with

Accepted Answer

A) communications software. 
B) operating systems. 
C) managing the order of print jobs. 
D) All of the above 
E) None of the above 
A) communications software. 
B) operating systems. 
C) managing the order of print jobs. 
D) All of the above 
E) None of the above

Question 14

A dynamic stack starts as an empty linked list.

Accepted Answer

A) True 
 B)False

Question 15

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

Accepted Answer

A) True 
 B)False

Question 16

A dynamic queue can be implemented as a

Accepted Answer

A) fixed- length array. 
B) dynamic linked list. 
C) fixed- length circular array. 
D) All of the above 
E) None of the above 
A) fixed- length array. 
B) dynamic linked list. 
C) fixed- length circular array. 
D) All of the above 
E) None of the above

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

Enqueue and dequeue are the two most common stack operations.

The STL provides containers for deque and queue.

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

Static stacks have a size, and are implemented using _ .

A dynamic stack has a size, and is implemented as a(n).

A _ is a double- ended queue.

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.

A stack or queue is implemented using linked lists.

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

A stack has two primary operations called

For most people, _ queues are more intuitive and easier to understand than _ queues.

The queue data structure is commonly applied in connection with

A dynamic stack starts as an empty linked list.

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

A dynamic queue can be implemented as a

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

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

Enqueue and dequeue are the two most common stack operations.

The STL provides containers for deque and queue.

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

Static stacks have a size, and are implemented using _ .

A dynamic stack has a size, and is implemented as a(n).

A _ is a double- ended queue.

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.

A stack or queue is implemented using linked lists.

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

A stack has two primary operations called

For most people, _ queues are more intuitive and easier to understand than _ queues.

The queue data structure is commonly applied in connection with

A dynamic stack starts as an empty linked list.

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

A dynamic queue can be implemented as a

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