Chapter 17

Question 1

True or false:
Linked list allow you to overcome the size limitations of an array data type.

Answer 1

True

Question 2

True or false:
Memory for the components of an array does not need to be contiguous

Answer 2

False

Question 3

True or false:
You can use the pointer head of a linked list to traverse the list.

Answer 3

False

Question 4

True or false:
We deallocate the memory for a linked list by calling the operator clear.

Answer 4

False

Question 5

True or false:
In a linked list, if a new item is always inserted at the beginning or at the end of the list and the data we read is unsorted, the linked list will be unsorted.

Answer 5

True

Question 6

True or false:
When you build a linked list in the backward manner, a new node is always inserted at the end of the linked list.

Answer 6

False

Question 7

True or false:
It is not possible to create an ordered linked list.

Answer 7

False

Question 8

True or false:
The length of a linked list is the number of nodes in the list.

Answer 8

True

Question 9

True or false:
A linked list is a random access data structure.

Answer 9

True

Question 10

True or false:
A doubly linked list can be traversed in either direction.

Answer 10

True

Question 11

Data can be organized and processed sequentially using an array, called a(n) ____ list.

Answer 11

sequential

Question 12

A linked list is a collection of components, called ____.

Answer 12

nodes

Question 13

In a linked list, the address of the first node in the list is stored in a separate location, called the ____ or first.

Answer 13

head

Question 14

In a linked list, the order of the nodes is determined by the address, called the ____, stored in each node.

Answer 14

link

Question 15

Every node (except of the last node) in a singly linked list contains ____.

Answer 15

the address of the next node

Question 16

The link field of the last node of a linked list is ____.

Answer 16

nullptr

Question 17

Because each node of a linked list has two components, we need to declare each node as a(n) ____.

Answer 17

class or struct

Question 18

Each node of a singly linked list has two components: ____ and ____.

Answer 18

info, link

Question 19

Suppose that the pointer head points to the first node in the list, and the link of the last node is nullptr. The first
node of the linked list contains the address of the ____ node.

Answer 19

second

Question 20

What is the purpose of the following code?

current = head;
while (current != nullptr)
{
//Process current
current = current->link;
}

Answer 20

Traversal of a linked list

Question 21

struct nodeType
{
int info;
nodeType *link;
};
nodeType head, p, q, newNode;
newNode = new nodeType;

Consider the accompanying code. What is the effect of the following statement?
newNode->info = 50;

Answer 21

Stores 50 in the info field of the newNode

Question 22

When building a linked list in the ____ manner, a new node is always inserted at the end of the linked list.

Answer 22

forward

Question 23

Which of the following is a basic operation on singly linked lists?

Answer 23

make a copy of the linked list

Question 24

How many pointers are needed to build a linked list in a backward manner?

Answer 24

two

Question 25

The ____ deallocates the memory occupied by the nodes of a list when the class object goes out of scope.

Answer 25

destructor

Question 26

The steps involved in inserting a new item at the beginning of an unordered linked list are ____.

Answer 26

1. Create a new node.
2. Store the new item in the new node.
3. Insert the node before first.
4. Increment the counter by 1.

Question 27

Every node in a doubly linked list has two pointers: ____ and ____.

Answer 27

back, next

Question 28

Which of the following correctly initializes a doubly linked list in the default constructor?

Answer 28

first = nullptr;
last = nullptr;
count = 0;

Question 29

template <class>
\_\_\_\_ doublyLinkedList<Type>::isEmptyList() const
{
return (first == nullptr);
}</Type></class>

Consider the accompanying statements. The operation returns true if the list is empty; otherwise, it returns false. The missing code is ___.

Answer 29

bool

Question 30

template <class>
\_\_\_\_ doublyLinkedList<Type>::isEmptyList() const
{
return (first == nullptr);
}</Type></class>

Consider the statements above. The list is empty if the pointer first is ____.

Answer 30

nullptr

Question 31

Consider the following code:

template <class>
int doublyLinkedList<Type>::length() const
{
\_\_\_\_
}</Type></class>

The statement that provides the length of the linked list is _____.

Answer 31

return count;

Question 32

Consider the following code which deletes all the nodes in a linked list.

void doublyLinkedList<Type>::destroy()
{
nodeType<Type> *temp; //pointer to delete the node
while (first != nullptr)
{
temp = first;
first = first->next;
\_\_\_\_
}
last = nullptr;
count = 0;
}</Type></Type>

Which of the following is the missing statement?

Answer 32

delete temp;

Question 33

Which of the following statements appears in the insert function of a doubly linked list?

Answer 33

count++;

Question 34

In a linked list, the link component of each node is a(n) ____________________.

Answer 34

pointer

Question 35

Each node of a linked list must store the data as well as the ____________________ of the next node in the list.

Answer 35

address

Question 36

In C++, the dereferencing operator is ____.

Answer 36

*

Question 37

A(n) ____________________ is an object that produces each element of a container, such as a linked list, one
element at a time.

Answer 37

iterator

Question 38

The ____________________ operator advances the iterator to the next node in the linked list.

Answer 38

increment (++)

Question 39

For classes that include pointer data members, the assignment operator must be explicitly
____________________.

Answer 39

overloaded

Question 40

The ____________________ constructor executes when an object is declared and initialized using another object.

Answer 40

copy

Question 41

A(n) ____________________ linked list is a linked list in which every node has a next pointer and a back pointer.

Answer 41

doubly