Question 1

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

Accepted Answer

A) True 
 B)False  False

Question 2

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

Accepted Answer

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

Question 3

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  False

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

The statement stack< int, vector > iStack; creates

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 called vector, implemented as integers. 
D)  a new vector called stack, implemented with integers. 
E)  None of the above 
A)  a new stack of integers, implemented as a vector. 
B)  a new stack of integers, implemented as a deque. 
C)  a new stack called vector, implemented as integers. 
D)  a new vector called stack, implemented with integers. 
E)  None of the above

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

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 the above 
E)  None of the above 
A)  managing the order of print jobs. 
B)  communications software. 
C)  operating systems. 
D)  All of the above 
E)  None of the above

Question 8

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

Accepted Answer

A) True 
 B)False

Question 9

For most people, ________ 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 the above 
A)  Static, dynamic 
B)  Dynamic, static 
C)  Deque-like, stack-like 
D)  Stack-like, deque-like 
E)  None of the above

Question 10

A ________ stack or queue is implemented using linked lists.

Accepted Answer

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

Question 11

Push and pop are the two most common queue operations.

Accepted Answer

A) True 
 B)False

Question 12

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

Accepted Answer

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

Question 13

Enqueue and dequeue are the two most common stack operations.

Accepted Answer

A) True 
 B)False

Question 14

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

Question 15

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

Accepted Answer

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

Question 16

A dynamic stack starts as an empty linked list.

Accepted Answer

A) True 
 B)False

Question 17

A practical application of the stack data type is

Accepted Answer

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

Question 18

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 the above 
A)  circular array. 
B)  stack. 
C)  dynamic linked list. 
D)  dynamic vector. 
E)  None of the above

Question 19

A stack has two primary operations called

Accepted Answer

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

Question 20

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 the above 
E)  None of the above 
A)  dynamic linked list. 
B)  fixed-length array. 
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.

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

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

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

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

The queue data structure is commonly applied in connection with

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

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

A ________ stack or queue is implemented using linked lists.

Push and pop are the two most common queue operations.

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

Enqueue and dequeue are the two most common stack operations.

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

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

A dynamic stack starts as an empty linked list.

A practical application of the stack data type is

A static queue can be implemented as a

A stack has two primary operations called

A dynamic queue can be implemented as a

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, 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.

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

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

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

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

The queue data structure is commonly applied in connection with

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

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

A ________ stack or queue is implemented using linked lists.

Push and pop are the two most common queue operations.

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

Enqueue and dequeue are the two most common stack operations.

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

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

A dynamic stack starts as an empty linked list.

A practical application of the stack data type is

A static queue can be implemented as a

A stack has two primary operations called

A dynamic queue can be implemented as a

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, 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

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