Question 1

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

Accepted Answer

A) True 
 B)False  False

Question 2

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

Accepted Answer

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

Question 3

Nodes in a linked list are stored in contiguous memory.

Accepted Answer

A) True 
 B)False  False

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

The STL implementation of a linked list is a class called

Accepted Answer

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

Question 6

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 7

The defining characteristic of a linked list is that

Accepted Answer

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

Question 8

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 9

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 10

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 11

One advantage a linked list has over a vector is that

Accepted Answer

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

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

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

Accepted Answer

A) True 
 B)False

Question 14

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 15

In many recursive operations on linked lists,

Accepted Answer

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

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

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 18

To concatenate two linked lists, it is necessary to

Accepted Answer

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

Question 19

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

Accepted Answer

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

Question 20

Which of the following are linked list operations?

Accepted Answer

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

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

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

Nodes in a linked list are stored in contiguous memory.

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

The STL implementation of a linked list is a class called

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.

The defining characteristic of a linked list is that

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.

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

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.

One advantage a linked list has over a vector is that

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

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

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.

In many recursive operations on linked lists,

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

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.

To concatenate two linked lists, it is necessary to

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

Which of the following are linked list operations?

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

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

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

Nodes in a linked list are stored in contiguous memory.

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

The STL implementation of a linked list is a class called

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.

The defining characteristic of a linked list is that

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.

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

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.

One advantage a linked list has over a vector is that

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

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

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.

In many recursive operations on linked lists,

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

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.

To concatenate two linked lists, it is necessary to

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

Which of the following are linked list operations?

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