Question 1

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 system's memory deallocator. 
B)  the class destructor. 
C)  overriding the class removal function. 
D)  overloading the class removal function. 
E)  None of the above 
A)  the system's memory deallocator. 
B)  the class destructor. 
C)  overriding the class removal function. 
D)  overloading the class removal function. 
E)  None of the above

Question 2

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 3

Which of the following are linked list operations?

Accepted Answer

A)  adding an item 
B)  traversing the list 
C)  removing an item 
D)  All of the above 
E)  None of the above 
A)  adding an item 
B)  traversing the list 
C)  removing an item 
D)  All of the above 
E)  None of the above

Question 4

When an item stored in a linked list is removed, all list items stored after it have to be moved down to plug up the hole.

Accepted Answer

A) True 
 B)False

Question 5

Nodes in a linked list are stored in contiguous memory.

Accepted Answer

A) True 
 B)False

Question 6

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 7

A non-empty linked list of items can be reversed by removing the head, reversing what is left, and then adding the (original) head at the end of the reversed tail.

Accepted Answer

A) True 
 B)False

Question 8

Linked lists of items are commonly implemented by

Accepted Answer

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

Question 9

Inserting an item into a linked list requires that all the items past the point of the insertion be shifted to make room for the new item.

Accepted Answer

A) True 
 B)False

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 the above 
A)  singly-linked list. 
B)  doubly-linked list. 
C)  circular-linked list. 
D)  backward-linked list. 
E)  None of the above

Question 11

The STL implementation of a linked list is a class called

Accepted Answer

A)  LinkedList. 
B)  DynamicList. 
C)  dequeue. 
D)  list. 
E)  None of the above 
A)  LinkedList. 
B)  DynamicList. 
C)  dequeue. 
D)  list. 
E)  None of the above

Question 12

Deleting an entire list requires traversing the list to delete the nodes.

Accepted Answer

A) True 
 B)False

Question 13

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

Accepted Answer

A) True 
 B)False

Question 14

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

Question 15

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

Accepted Answer

A) True 
 B)False

Question 16

In a non-empty list, there must be exactly one list item with no successor.

Accepted Answer

A) True 
 B)False

Question 17

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

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 the above 
A)  allocates another node 
B)  removes a node 
C)  borrows a node from the compiler 
D)  either B or C 
E)  None of the above

Question 18

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

Accepted Answer

A) True 
 B)False

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

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.

Which of the following are linked list operations?

When an item stored in a linked list is removed, all list items stored after it have to be moved down to plug up the hole.

Nodes in a linked list are stored in contiguous memory.

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.

A non-empty linked list of items can be reversed by removing the head, reversing what is left, and then adding the (original) head at the end of the reversed tail.

Linked lists of items are commonly implemented by

Inserting an item into a linked list requires that all the items past the point of the insertion be shifted to make room for the new item.

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

The STL implementation of a linked list is a class called

Deleting an entire list requires traversing the list to delete the nodes.

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

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

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

In a non-empty list, there must be exactly one list item with no successor.

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

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

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

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

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

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.

Which of the following are linked list operations?

When an item stored in a linked list is removed, all list items stored after it have to be moved down to plug up the hole.

Nodes in a linked list are stored in contiguous memory.

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.

A non-empty linked list of items can be reversed by removing the head, reversing what is left, and then adding the (original) head at the end of the reversed tail.

Linked lists of items are commonly implemented by

Inserting an item into a linked list requires that all the items past the point of the insertion be shifted to make room for the new item.

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

The STL implementation of a linked list is a class called

Deleting an entire list requires traversing the list to delete the nodes.

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

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

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

In a non-empty list, there must be exactly one list item with no successor.

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

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

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

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