Question 1

When you delete a node from a list, you must ensure that the links in the list are not permanently broken.

Accepted Answer

A) True 
 B)False

Question 2

To build a list initially, you can use a(n)________ routine.

Accepted Answer

A) build 
B) append 
C) constructor 
D) initialization 
E) None of these 
A) build 
B) append 
C) constructor 
D) initialization 
E) None of these

Question 3

In a circular-linked list, the last node points to the ________.

Accepted Answer

A) head pointer 
B) tail pointer 
C) first node 
D) closing curly brace of the original structure declaration 
E) None of these 
A) head pointer 
B) tail pointer 
C) first node 
D) closing curly brace of the original structure declaration 
E) None of these

Question 4

A linked list can consist of structs, objects, or other abstract data types.

Accepted Answer

A) True 
 B)False

Question 5

A list that contains pointers to the previous node, the next node, and a node in the third dimension is known as a triple-linked list.

Accepted Answer

A) True 
 B)False

Question 6

If there are no nodes in a linked list, you cannot append a node to the list.

Accepted Answer

A) True 
 B)False

Question 7

A linked list class must take care of removing the dynamically allocated nodes. This is done by ________.

Accepted Answer

A) the constructor function 
B) the destructor function 
C) overriding the removal function 
D) overloading the memory persistence operator 
E) None of these 
A) the constructor function 
B) the destructor function 
C) overriding the removal function 
D) overloading the memory persistence operator 
E) None of these

Question 8

A linked list can grow and shrink as a program runs.

Accepted Answer

A) True 
 B)False

Question 9

This type of list does not contain a null pointer at the end of the list.

Accepted Answer

A) circular-linked 
B) doubly-linked 
C) backwards-linked 
D) null-linked 
E) None of these 
A) circular-linked 
B) doubly-linked 
C) backwards-linked 
D) null-linked 
E) None of these

Question 10

The list container provided by the Standard Template Library is a template version of a ________.

Accepted Answer

A) singly-linked list 
B) doubly-linked list 
C) circular-linked list 
D) backward-linked list 
E) None of these 
A) singly-linked list 
B) doubly-linked list 
C) circular-linked list 
D) backward-linked list 
E) None of these

Question 11

When you create a linked list, you must know in advance how many nodes the list will contain.

Accepted Answer

A) True 
 B)False

Question 12

An insertion or deletion routine requires that you create this many pointers for use during the traversal process.

Accepted Answer

A) Two-one for the node being inspected, and one for the previous node. 
B) Two-one for the node being inspected, and one for the next node. 
C) One-for the node being inserted or deleted 
D) Three-one for the inspected node, one for the next node, and one for the following node 
A) Two-one for the node being inspected, and one for the previous node. 
B) Two-one for the node being inspected, and one for the next node. 
C) One-for the node being inserted or deleted 
D) Three-one for the inspected node, one for the next node, and one for the following node

Question 13

If new data needs to be added to a linked list, the program simply ________ and inserts it into the series.

Accepted Answer

A) allocates another node 
B) removes a node 
C) borrows a node from the compiler 
D) Either B or C 
E) None of these 
A) allocates another node 
B) removes a node 
C) borrows a node from the compiler 
D) Either B or C 
E) None of these

Question 14

The ________ of a linked list points to the first node in the list.

Accepted Answer

A) starter 
B) head 
C) tail 
D) declaration 
E) None of these 
A) starter 
B) head 
C) tail 
D) declaration 
E) None of these

Question 15

To append a node to a list means to ________.

Accepted Answer

A) delete a node from the beginning of the list 
B) delete a node from the end of the list 
C) add a node to the beginning of the list 
D) add a node to the end of the list 
E) None of these 
A) delete a node from the beginning of the list 
B) delete a node from the end of the list 
C) add a node to the beginning of the list 
D) add a node to the end of the list 
E) None of these

Question 16

ADT stands for:

Accepted Answer

A) Algorithm Dependent Template 
B) Algorithm Driven Template 
C) Abstract Data Type 
D) Automatic Data Type 
E) None of these 
A) Algorithm Dependent Template 
B) Algorithm Driven Template 
C) Abstract Data Type 
D) Automatic Data Type 
E) None of these

Question 17

A ________ is used to travel through a linked list and search for data.

Accepted Answer

A) node 
B) pointer 
C) null pointer 
D) traversal operator 
E) None of these 
A) node 
B) pointer 
C) null pointer 
D) traversal operator 
E) None of these

Question 18

How many steps are involved in the process of deleting a node?

Accepted Answer

A) one-delete the node from memory 
B) two-remove the node without breaking links, then delete it from memory 
C) three-create a blank node, remove the node being deleted, insert the blank, then delete the node 
D) four-create a blank, remove the node being deleted, insert the blank, delete the node, delete the blank 
E) None of these 
A) one-delete the node from memory 
B) two-remove the node without breaking links, then delete it from memory 
C) three-create a blank node, remove the node being deleted, insert the blank, then delete the node 
D) four-create a blank, remove the node being deleted, insert the blank, delete the node, delete the blank 
E) None of these

Question 19

Deleting an entire list simply requires the use of the delete operator.

Accepted Answer

A) True 
 B)False

Question 20

The advantage a linked list has over a vector is:

Accepted Answer

A) A linked list can dynamically shrink or grow, and a vector cannot 
B) A linked list is smaller than a vector 
C) A node can be inserted into or removed from a linked list faster than from a vector 
D) Data removal and insertion are more accurate with a linked list than with a vector 
E) None of these 
A) A linked list can dynamically shrink or grow, and a vector cannot 
B) A linked list is smaller than a vector 
C) A node can be inserted into or removed from a linked list faster than from a vector 
D) Data removal and insertion are more accurate with a linked list than with a vector 
E) None of these

When you delete a node from a list, you must ensure that the links in the list are not permanently broken.

To build a list initially, you can use a(n)________ routine.

In a circular-linked list, the last node points to the ________.

A linked list can consist of structs, objects, or other abstract data types.

A list that contains pointers to the previous node, the next node, and a node in the third dimension is known as a triple-linked list.

If there are no nodes in a linked list, you cannot append a node to the list.

A linked list class must take care of removing the dynamically allocated nodes. This is done by ________.

A linked list can grow and shrink as a program runs.

This type of list does not contain a null pointer at the end of the list.

The list container provided by the Standard Template Library is a template version of a ________.

When you create a linked list, you must know in advance how many nodes the list will contain.

An insertion or deletion routine requires that you create this many pointers for use during the traversal process.

If new data needs to be added to a linked list, the program simply ________ and inserts it into the series.

The ________ of a linked list points to the first node in the list.

To append a node to a list means to ________.

ADT stands for:

A ________ is used to travel through a linked list and search for data.

How many steps are involved in the process of deleting a node?

Deleting an entire list simply requires the use of the delete operator.

The advantage a linked list has over a vector is:

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

Stacks and Queues

Recursion

Binary Trees

Filters

Exam 17: Linked Lists

When you delete a node from a list, you must ensure that the links in the list are not permanently broken.

To build a list initially, you can use a(n)________ routine.

In a circular-linked list, the last node points to the ________.

A linked list can consist of structs, objects, or other abstract data types.

A list that contains pointers to the previous node, the next node, and a node in the third dimension is known as a triple-linked list.

If there are no nodes in a linked list, you cannot append a node to the list.

A linked list class must take care of removing the dynamically allocated nodes. This is done by ________.

A linked list can grow and shrink as a program runs.

This type of list does not contain a null pointer at the end of the list.

The list container provided by the Standard Template Library is a template version of a ________.

When you create a linked list, you must know in advance how many nodes the list will contain.

An insertion or deletion routine requires that you create this many pointers for use during the traversal process.

If new data needs to be added to a linked list, the program simply ________ and inserts it into the series.

The ________ of a linked list points to the first node in the list.

To append a node to a list means to ________.

ADT stands for:

A ________ is used to travel through a linked list and search for data.

How many steps are involved in the process of deleting a node?

Deleting an entire list simply requires the use of the delete operator.

The advantage a linked list has over a vector is:

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

Stacks and Queues

Recursion

Binary Trees

Filters