Question 1

Select all that apply. Data structures that can dynamically store elements and can grow and shrink in size are

Accepted Answer

A)  stacks 
B)  arrays 
C)  queues 
D)  deques 
A)  stacks 
B)  arrays 
C)  queues 
D)  deques

Question 2

Computer systems use stacks. For example, when a function is called, they create local variables on a stack which are removed from the stack when the function terminates.

Accepted Answer

A) True 
 B)False

Question 3

The pop function in the stack template of the STL does not retrieve the value from the top of the stack; it merely removes it.

Accepted Answer

A) True 
 B)False

Question 4

Queues that are implemented as arrays are called __________ queues.

Accepted Answer

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

Question 5

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

Select all that apply. 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)  None of these 
A)  managing the order of print jobs 
B)  communications software 
C)  operating systems 
D)  None of these

Select all that apply. Data structures that can dynamically store elements and can grow and shrink in size are

Computer systems use stacks. For example, when a function is called, they create local variables on a stack which are removed from the stack when the function terminates.

The pop function in the stack template of the STL does not retrieve the value from the top of the stack; it merely removes it.

Queues that are implemented as arrays are called __________ queues.

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.

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

Select all that apply. The queue data structure is commonly applied in connection with

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

Select all that apply. Data structures that can dynamically store elements and can grow and shrink in size are

Computer systems use stacks. For example, when a function is called, they create local variables on a stack which are removed from the stack when the function terminates.

The pop function in the stack template of the STL does not retrieve the value from the top of the stack; it merely removes it.

Queues that are implemented as arrays are called __________ queues.

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.

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

Select all that apply. The queue data structure is commonly applied in connection with

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