Question 1

Two primary queue operations are:

Accepted Answer

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

Question 2

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 B

Question 3

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 4

A dynamic queue can be implemented as a ________.

Accepted Answer

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

Question 5

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

Accepted Answer

A) True 
 B)False

Question 6

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 lines 4, 5, and 6, stores the number removed from the queue in the value variable.
What will the statement in 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 7

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

The queue data structure is commonly applied in connection with:

Accepted Answer

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

Question 10

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 11

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

Question 12

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

Accepted Answer

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

Question 13

When the program knows the exact contents of a list and can access any element on demand, the data structure is known as a stacked deque.

Accepted Answer

A) True 
 B)False

Question 14

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 15

A practical application of the stack data type in a computer system is:

Accepted Answer

A) storage of local variables 
B) tracking nested loops 
C) tracking nested function calls 
D) All of these 
E) None of these 
A) storage of local variables 
B) tracking nested loops 
C) tracking nested function calls 
D) All of these 
E) None of these

Question 16

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

Endeque and deque are the two most common queue operations.

Accepted Answer

A) True 
 B)False

Question 18

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

Accepted Answer

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

Question 19

A dynamic stack starts as an empty linked list.

Accepted Answer

A) True 
 B)False

Question 20

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 lines 4, and 6, stores the number removed from the queue 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

Two primary queue operations are:

A stack has two primary operations:

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

A dynamic queue can be implemented as a ________.

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

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

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.

The queue data structure is commonly applied in connection with:

A ________ stack or queue is built around the linked-list.

A stack can be adapted to store ________ data types.

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

When the program knows the exact contents of a list and can access any element on demand, the data structure is known as a stacked deque.

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

A practical application of the stack data type in a computer system is:

queues are more intuitive and easier to understand than queues.

Endeque and deque are the two most common queue operations.

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

A dynamic stack starts as an empty linked list.

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

Two primary queue operations are:

A stack has two primary operations:

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

A dynamic queue can be implemented as a ________.

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

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

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.

The queue data structure is commonly applied in connection with:

A ________ stack or queue is built around the linked-list.

A stack can be adapted to store ________ data types.

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

When the program knows the exact contents of a list and can access any element on demand, the data structure is known as a stacked deque.

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

A practical application of the stack data type in a computer system is:

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

Endeque and deque are the two most common queue operations.

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

A dynamic stack starts as an empty linked list.

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

queues are more intuitive and easier to understand than queues.

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