Question 1

Linked lists of items are commonly implemented by

Accepted Answer

A) using a structure containing an item and a pointer to the structure type. 
B) using a class template to represent list items. 
C) using an array to hold list items. 
D) using a function to compute the link to the next item. 
E) None of the above 
A) using a structure containing an item and a pointer to the structure type. 
B) using a class template to represent list items. 
C) using an array to hold list items. 
D) using a function to compute the link to the next item. 
E) None of the above

Question 2

The values stored in the value portion of a node of a linked list can be simple data types, structures, objects of classes, or any other data type.

Accepted Answer

A) True 
 B)False

Question 3

To build a linked list, we can

Accepted Answer

A) start with an empty list, and then form an array of nodes. 
B) call the list init function. 
C) use the constructor to create an array of nodes. 
D) start with an empty list, and then perform a series of add item operations. 
E) None of the above 
A) start with an empty list, and then form an array of nodes. 
B) call the list init function. 
C) use the constructor to create an array of nodes. 
D) start with an empty list, and then perform a series of add item operations. 
E) None of the above

Question 4

In a doubly- linked list, each node contains a pointer to the next node in the list, as well as a pointer to

Accepted Answer

A) itself. 
B) the previous node. 
C) the head node. 
D) the tail node. 
E) None of the above 
A) itself. 
B) the previous node. 
C) the head node. 
D) the tail node. 
E) None of the above

Question 5

Variations of the linked list are

Accepted Answer

A) circular linked list. 
B) doubly- linked list. 
C) triply linked list. 
D) A and B 
E) None of the above 
A) circular linked list. 
B) doubly- linked list. 
C) triply linked list. 
D) A and B 
E) None of the above

Question 6

If a node is not the first node in a linked list, deleting it may require setting the successor pointer in its predecessor.

Accepted Answer

A) True 
 B)False

Question 7

When you delete a node from a linked list, you must ensure that the links in the surrounding nodes are set to bypass the node being deleted.

Accepted Answer

A) True 
 B)False

Question 8

A linked list class using dynamically allocated memory should free its memory when the list is destroyed. This can be done by

Accepted Answer

A) the class destructor. 
B) overriding the class removal function. 
C) the system's memory deallocator. 
D) overloading the class removal function. 
E) None of the above 
A) the class destructor. 
B) overriding the class removal function. 
C) the system's memory deallocator. 
D) overloading the class removal function. 
E) None of the above

Question 9

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

Accepted Answer

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

Question 10

When using a node pointer to traverse a linked list, we know we have reached the end of a list when

Accepted Answer

A) we encounter a sentinel, usually 9999. 
B) we encounter the new line character '
'. 
C) we arrive back at the beginning of the list. 
D) we encounter a successor pointer value of NULL in the current node. 
E) None of the above 
A) we encounter a sentinel, usually 9999. 
B) we encounter the new line character '
'. 
C) we arrive back at the beginning of the list. 
D) we encounter a successor pointer value of NULL in the current node. 
E) None of the above

Question 11

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

Accepted Answer

A) doubly- linked list. 
B) singly- linked list. 
C) circular- linked list. 
D) backward- linked list. 
E) None of the above 
A) doubly- linked list. 
B) singly- linked list. 
C) circular- linked list. 
D) backward- linked list. 
E) None of the above

Question 12

A _ is used to step through a linked list and search for data.

Accepted Answer

A) pointer 
B) NULL value 
C) node 
D) traversal operator 
E) None of the above 
A) pointer 
B) NULL value 
C) node 
D) traversal operator 
E) None of the above

Question 13

The successor pointer in the last node of a linked list should have its value set to

Accepted Answer

A) the address of the first node in the list. 
B) NULL . 
C) the address of the previous node. 
D) nothing: the last node has no successor pointer. 
E) None of the above 
A) the address of the first node in the list. 
B) NULL . 
C) the address of the previous node. 
D) nothing: the last node has no successor pointer. 
E) None of the above

Question 14

A new node must always be made the last node in the list.

Accepted Answer

A) True 
 B)False

Question 15

Each node in a list contains pointers to the nodes before and after it.

Accepted Answer

A) doubly- linked 
B) singly- linked 
C) circular- linked 
D) both B and C 
E) None of the above 
A) doubly- linked 
B) singly- linked 
C) circular- linked 
D) both B and C 
E) None of the above

Question 16

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 17

Moving through a linked list is referred to as the list.

Accepted Answer

A) traversing 
B) node- hopping 
C) cruising 
D) alternating 
E) None of the above 
A) traversing 
B) node- hopping 
C) cruising 
D) alternating 
E) None of the above

Question 18

The Standard Template Library (STL)provides a linked list container.

Accepted Answer

A) True 
 B)False

Linked lists of items are commonly implemented by

The values stored in the value portion of a node of a linked list can be simple data types, structures, objects of classes, or any other data type.

To build a linked list, we can

In a doubly- linked list, each node contains a pointer to the next node in the list, as well as a pointer to

Variations of the linked list are

If a node is not the first node in a linked list, deleting it may require setting the successor pointer in its predecessor.

When you delete a node from a linked list, you must ensure that the links in the surrounding nodes are set to bypass the node being deleted.

A linked list class using dynamically allocated memory should free its memory when the list is destroyed. This can be done by

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

When using a node pointer to traverse a linked list, we know we have reached the end of a list when

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

A _ is used to step through a linked list and search for data.

The successor pointer in the last node of a linked list should have its value set to

A new node must always be made the last node in the list.

Each node in a list contains pointers to the nodes before and after it.

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

Moving through a linked list is referred to as the list.

The Standard Template Library (STL)provides a linked list container.

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

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

Stacks and Queues

Binary Trees

Filters

Exam 17: Linked Lists

Linked lists of items are commonly implemented by

The values stored in the value portion of a node of a linked list can be simple data types, structures, objects of classes, or any other data type.

To build a linked list, we can

In a doubly- linked list, each node contains a pointer to the next node in the list, as well as a pointer to

Variations of the linked list are

If a node is not the first node in a linked list, deleting it may require setting the successor pointer in its predecessor.

When you delete a node from a linked list, you must ensure that the links in the surrounding nodes are set to bypass the node being deleted.

A linked list class using dynamically allocated memory should free its memory when the list is destroyed. This can be done by

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

When using a node pointer to traverse a linked list, we know we have reached the end of a list when

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

A _ is used to step through a linked list and search for data.

The successor pointer in the last node of a linked list should have its value set to

A new node must always be made the last node in the list.

Each node in a list contains pointers to the nodes before and after it.

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

Moving through a linked list is referred to as the list.

The Standard Template Library (STL)provides a linked list container.

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

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

Stacks and Queues

Binary Trees

Filters