Question 1

It is easier to insert and remove from the middle of a linked list.

Accepted Answer

A) True 
 B)False

Question 2

The storage policy of a stack is sometimes referred to as __________.

Accepted Answer

A)  First-In, First-Out, or FIFO 
B)  First-In, Last-Out, or LILO 
C)  Last-In, First-Out, or LIFO 
D)  Last-in, Last-Out, or LILO 
A)  First-In, First-Out, or FIFO 
B)  First-In, Last-Out, or LILO 
C)  Last-In, First-Out, or LIFO 
D)  Last-in, Last-Out, or LILO

Question 3

A client of a list can access any element and can insert elements at any location.

Accepted Answer

A) True 
 B)False

Question 4

Which of the following is a stack operation?

Accepted Answer

A)  front 
B)  top 
C)  insert 
D)  back 
A)  front 
B)  top 
C)  insert 
D)  back

It is easier to insert and remove from the middle of a linked list.

The storage policy of a stack is sometimes referred to as __________.

A client of a list can access any element and can insert elements at any location.

Which of the following is a stack operation?

P A C++ Primer

Introduction to Software Design

Program Correctness and Efficiency

Inheritance and Class Hierarchies

Sequential Containers

Queues and Deques

Recursion

Trees

Sets and Maps

Sorting

Self-Balancing Search Trees

Graphs

Advanced C++ Topics, and Overview of UML

Filters

Exam 6: Stacks

It is easier to insert and remove from the middle of a linked list.

The storage policy of a stack is sometimes referred to as __________.

A client of a list can access any element and can insert elements at any location.

Which of the following is a stack operation?

P A C++ Primer

Introduction to Software Design

Program Correctness and Efficiency

Inheritance and Class Hierarchies

Sequential Containers

Queues and Deques

Recursion

Trees

Sets and Maps

Sorting

Self-Balancing Search Trees

Graphs

Advanced C++ Topics, and Overview of UML

Filters