Question 1

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 2

What does the following statement indicate? Stack< int, vector > iStack;

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

Question 3

Given the following code, assume the myQueue object is a queue that can hold integers and that value is an int variable. 1 myQueue.enqueue(0);
2 myQueue.enqueue(1);
3 myQueue.enqueue(2);
4 myQueue.dequeue(value);
5 myQueue.dequeue(value);
6 myQueue.dequeue(value);
7 cout << value << endl;
Assume that the dequeue function, called on lines 4, 5, and 6, stores the number removed from the queue in the value variable. What will the statement on 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 4

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

Accepted Answer

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

Question 5

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 6

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 7

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

Accepted Answer

A) True 
 B)False

Question 8

Select all that apply. 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)  None of these 
A)  storage of local variables 
B)  tracking nested loops 
C)  tracking nested function calls 
D)  None of these

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

The two most common queue operations are endeque and deque.

Accepted Answer

A) True 
 B)False

Question 11

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

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

Accepted Answer

A)  array 
B)  structure 
C)  linked list 
D)  Either A or B 
E)  None of these 
A)  array 
B)  structure 
C)  linked list 
D)  Either A or B 
E)  None of these

Question 14

The two primary stack operations are

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

Question 15

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

Question 16

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

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 17

Given the following code, assume the myStack object is a stack that can hold integers and that value is an int variable. 1 myStack.push(0);
2 myStack.push(1);
3 myStack.push(2);
4 myStack.pop(value);
5 cout << value << endl;
Assume that the pop function, called on line 4, stores the number popped from the stack in the value variable. What will the statement on 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

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

Accepted Answer

A) True 
 B)False

Question 19

A stack 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 20

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

Accepted Answer

A) True 
 B)False

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

What does the following statement indicate? Stack< int, vector<int> > iStack;

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

A dynamic queue can be implemented as a

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

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

Select all that apply. A practical application of the stack data type in a computer system is

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

The two most common queue operations are endeque and deque.

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 __________ operation allows an item to be stored on a stack.

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

The two primary stack operations are

Two primary queue operations are

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

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

A stack queue can be implemented as a

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

Introduction to Computers and Programming

Introduction to C

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays and Vectors

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

The Standard Template Library

Linked Lists

Recursion

Binary Trees

Filters

Exam 19: Stacks and Queues

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

What does the following statement indicate? Stack< int, vector<int> > iStack;

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

A dynamic queue can be implemented as a

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

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

Select all that apply. A practical application of the stack data type in a computer system is

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

The two most common queue operations are endeque and deque.

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 __________ operation allows an item to be stored on a stack.

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

The two primary stack operations are

Two primary queue operations are

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

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

A stack queue can be implemented as a

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

Introduction to Computers and Programming

Introduction to C

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays and Vectors

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

The Standard Template Library

Linked Lists

Recursion

Binary Trees

Filters

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

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