Question 1

The defining characteristic of a linked list is that

Accepted Answer

A)  data are stored in consecutive locations in the memory of the computer. 
B)  lists are very efficient at storing data. 
C)  the locations that store list data do not have to be consecutive in memory. 
D)  the maximum size of a list is fixed when the list is created. 
E)  None of the above 
A)  data are stored in consecutive locations in the memory of the computer. 
B)  lists are very efficient at storing data. 
C)  the locations that store list data do not have to be consecutive in memory. 
D)  the maximum size of a list is fixed when the list is created. 
E)  None of the above C

Question 2

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 head node. 
C)  the tail node. 
D)  the previous node. 
E)  None of the above 
A)  itself. 
B)  the head node. 
C)  the tail node. 
D)  the previous node. 
E)  None of the above D

Question 3

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

Accepted Answer

A) True 
 B)False  False

Question 4

To build a linked list, we can

Accepted Answer

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

Question 5

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 6

If the head pointer points to NULL, it is an indication that

Accepted Answer

A)  the list has been destroyed. 
B)  the list needs to be destroyed. 
C)  there are no nodes in the list. 
D)  the list is full and cannot accept any new nodes. 
E)  None of the above 
A)  the list has been destroyed. 
B)  the list needs to be destroyed. 
C)  there are no nodes in the list. 
D)  the list is full and cannot accept any new nodes. 
E)  None of the above

Question 7

Deleting an entire linked list requires a call to the delete operator for each node in the list.

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

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

Question 9

One advantage a linked list has over a vector is that

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)  insertion and removal of items is faster with lists than with vectors. 
D)  All of the above 
E)  None of the above 
A)  a linked list can dynamically shrink or grow, and a vector cannot. 
B)  a linked list is smaller than a vector. 
C)  insertion and removal of items is faster with lists than with vectors. 
D)  All of the above 
E)  None of the above

Question 10

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

Accepted Answer

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

Question 11

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 12

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 the above 
A)  starter 
B)  head 
C)  tail 
D)  declaration 
E)  None of the above

Question 13

Variations of the linked list are

Accepted Answer

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

Question 14

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

Accepted Answer

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

Question 15

Adding a new node in the middle or at the end of a singly-linked list requires a pointer to the node after which the new node will be added.

Accepted Answer

A) True 
 B)False

Question 16

Linked lists are less complex to code and manage than arrays.

Accepted Answer

A) True 
 B)False

Question 17

To concatenate two linked lists, it is necessary to

Accepted Answer

A)  traverse one of the lists to get to its end. 
B)  traverse both lists to get to their ends. 
C)  first reverse one of the lists. 
D)  first reverse both lists. 
E)  None of the above 
A)  traverse one of the lists to get to its end. 
B)  traverse both lists to get to their ends. 
C)  first reverse one of the lists. 
D)  first reverse both lists. 
E)  None of the above

Question 18

A new node cannot become the first node in the list.

Accepted Answer

A) True 
 B)False

Question 19

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

Accepted Answer

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

Question 20

In many recursive operations on linked lists,

Accepted Answer

A)  the head of the list is chopped off and thrown away. 
B)  the base case considers the last element of the list. 
C)  the base case is when the list is empty or has a single element. 
D)  All of the above 
E)  None of the above 
A)  the head of the list is chopped off and thrown away. 
B)  the base case considers the last element of the list. 
C)  the base case is when the list is empty or has a single element. 
D)  All of the above 
E)  None of the above

The defining characteristic of a linked list is that

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

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

To build a linked list, we can

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.

If the head pointer points to NULL, it is an indication that

Deleting an entire linked list requires a call to the delete operator for each node in the list.

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

One advantage a linked list has over a vector is that

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

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

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

Variations of the linked list are

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

Adding a new node in the middle or at the end of a singly-linked list requires a pointer to the node after which the new node will be added.

Linked lists are less complex to code and manage than arrays.

To concatenate two linked lists, it is necessary to

A new node cannot become the first node in the list.

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

In many recursive operations on linked lists,

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

The defining characteristic of a linked list is that

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

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

To build a linked list, we can

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.

If the head pointer points to NULL, it is an indication that

Deleting an entire linked list requires a call to the delete operator for each node in the list.

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

One advantage a linked list has over a vector is that

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

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

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

Variations of the linked list are

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

Adding a new node in the middle or at the end of a singly-linked list requires a pointer to the node after which the new node will be added.

Linked lists are less complex to code and manage than arrays.

To concatenate two linked lists, it is necessary to

A new node cannot become the first node in the list.

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

In many recursive operations on linked lists,

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