Question 1

The last node in a linked list points to

Accepted Answer

A)   a null pointer
B)   the previous node
C)   the first node in the list
D)   nothing; the last node does not contain a pointer
E)   None of theseF) A) and E)
G) B) and C) A

Question 2

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

Accepted Answer

A) True 
 B)False

Question 3

Appending a node means adding it to the end of a list, and __________ a node means putting a new node in the list, but not necessarily at the end.

Accepted Answer

A)   concatenating
B)   popping
C)   clamping
D)   inserting
E)   None of theseF) B) and C)
G) A) and D) D

Question 4

Nodes in a linked list are stored in contiguous memory.

Accepted Answer

A) True 
 B)False

Question 5

When working with a linked list one of the basic operations you can perform is to destroy the list.

Accepted Answer

A) True 
 B)False

Question 6

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 theseF) A) and B)
G) A) and C)

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

Which type of list does not contain a null pointer at the end of the list?

Accepted Answer

A)   backwards linked
B)   doubly linked
C)   circular linked
D)   null linked
E)   None of theseF) B) and D)
G) None of the above

Question 9

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 theseF) A) and E)
G) B) and E)

Question 10

To insert a new node in ascending order into a list, the list must be

Accepted Answer

A)   arranged in descending order
B)   randomly ordered
C)   empty
D)   arranged in ascending order
E)   None of theseF) B) and E)
G) B) and D) D

Question 11

A linked list class must take care of removing the dynamically allocated nodes and 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 theseF) B) and C)
G) D) and E)

Question 12

The 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)   a node can be inserted or removed faster from a linked list than from a vector
D)   data removal and insertion are more accurate with a linked list than with a vector
E)   None of theseF) A) and B)
G) None of the above

Question 13

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 14

Select all that apply. Variations of the linked list are

Accepted Answer

A)   doubly linked list
B)   circular linked list
C)   frontward linked list
D)   backward linked listE) None of the above
F) C) and D)

Question 15

Select all that apply. Which of the following is a basic list operation?

Accepted Answer

A)   appending a node
B)   traversing the list
C)   inserting a node
D)   deleting a node
E)   None of theseF) D) and E)
G) A) and B)

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

To create a linked list you must first create a(n)

Accepted Answer

A)   header file
B)   function template
C)   exception
D)   struct
E)   None of theseF) C) and D)
G) All of the above

Question 18

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 theseF) A) and B)
G) None of the above

Question 19

To delete an entire list, normally you must traverse the list, deleting each node, one by one.

Accepted Answer

A) True 
 B)False

Question 20

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

Exam 18: Linked Lists

The last node in a linked list points to

Correct AnswerverifiedA

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

Correct AnswerverifiedShow Answer

Appending a node means adding it to the end of a list, and __________ a node means putting a new node in the list, but not necessarily at the end.

Correct AnswerverifiedD

Nodes in a linked list are stored in contiguous memory.

Correct AnswerverifiedShow Answer

When working with a linked list one of the basic operations you can perform is to destroy the list.

Correct AnswerverifiedShow Answer

To append a node to a list means to

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Which type of list does not contain a null pointer at the end of the list?

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

To insert a new node in ascending order into a list, the list must be

Correct AnswerverifiedD

A linked list class must take care of removing the dynamically allocated nodes and this is done by

Correct AnswerverifiedShow Answer

The advantage a linked list has over a vector is that

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Select all that apply. Variations of the linked list are

Correct AnswerverifiedShow Answer

Select all that apply. Which of the following is a basic list operation?

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

To create a linked list you must first create a(n)

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

To delete an entire list, normally you must traverse the list, deleting each node, one by one.

Correct AnswerverifiedShow Answer

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.

Correct AnswerverifiedShow Answer

Correct Answer
verified
A

Correct Answer
verified

Correct Answer
verified
D

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
D

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified