Question 1

A doubly linked list can be traversed in either direction.

Accepted Answer

Unlike a singly linked list, a doubly linked list has pointers to the previous and next nodes, allowing for traversal in both directions.

Question 2

Data can be organized and processed sequentially using an array, called a(n) ____ list.
A) linked
B) ordered
C) sequential
D) ascending

Accepted Answer

A sequential list is a type of array where data is stored in a linear order and processed sequentially. This is different from a linked list, where items are linked together through pointers, and an ordered list, where items are sorted based on some criteria. The term "ascending" doesn't apply to a list type, but rather to the sorting order of items within a list.

Question 3

It is not possible to create an ordered linked list.

Accepted Answer

It is possible to create an ordered linked list where the nodes are arranged in a specific order based on a sorting criteria such as alphabetically or numerically.

Question 4

In a linked list, the order of the nodes is determined by the address, called the ____, stored in each node.
A) head
B) tail
C) link
D) first

Accepted Answer

The order of nodes in a linked list is determined by the links between nodes, which store the memory address of the next node in the list. The head and tail refer to the first and last nodes in the list, respectively, but do not necessarily determine the order of the nodes in between. "First" is also not a commonly used term in reference to the order of nodes in a linked list. Therefore, the correct answer is C – link.

Question 5

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

Accepted Answer

When building a linked list in the backward manner, a new node is typically inserted at the beginning of the list, not the end. This process involves adjusting the head of the list to point to the newly added node.

Question 6

A linked list is a collection of components, called ____.
A) elements
B) nodes
C) members
D) pointers

Accepted Answer

The components in a linked list are called nodes, which consist of data and a pointer to the next node in the list. Elements, members, and pointers may also be used in the context of linked lists, but specifically referring to the nodes is the most clear and accurate choice.

Question 7

Suppose that the pointer head points to the first node in the list, and the link of the last node is NULL. The first node of the linked list contains the address of the ____ node.
A) head
B) first
C) second
D) tail

Accepted Answer

The answer of Suppose that the pointer head points to...

Question 8

You can use the pointer head of a linked list to traverse the list.

Accepted Answer

The answer of You can use the pointer head of...

Question 9

A linked list is a random access data structure.

Accepted Answer

A linked list is not a random access data structure as it cannot directly access elements at random positions. Instead, it can only be traversed sequentially from the beginning to the desired position.

Question 10

Memory for the components of an array does not need to be contiguous.

Accepted Answer

In computer science, an array is a data structure consisting of a collection of elements, each identified by at least one array index or key. The memory allocated for an array is contiguous, meaning all elements are stored in a single, continuous block of memory. This allows for efficient access and manipulation of the array's elements.

Question 11

What is the purpose of the following code? current = head;
While (current != NULL)
{
//Process current
Current = current->link;
}
A) Insertion of a node
B) Selection of a node
C) Traversal of a linked list
D) Creation of a new list

Accepted Answer

The code is traversing a linked list by starting at the head and processing each node until the end of the list (NULL) is reached. There is no insertion, selection, or creation happening in this code.

Question 12

Linked lists allow you to overcome the size limitations of an array data type.

Accepted Answer

Unlike arrays, linked lists allow for dynamic memory allocation, which means that new memory can be allocated and linked to the existing list as needed, allowing for a potentially unlimited number of elements.

Question 13

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.

Accepted Answer

Since the new item is always inserted at the beginning or end of the list, there is no mechanism to maintain the order of the data. Therefore, even if the initial data is sorted, the linked list will end up being unsorted.

Question 14

We deallocate the memory for a linked list by calling the operator clear.

Accepted Answer

To deallocate the memory for a linked list, we typically use a loop or a recursive function to traverse the list and delete each node individually, rather than using a single operator like "clear."

Question 15

The link field of the last node of a linked list is ____.
A) NULL
B) 1
C) n-1
D) n

Accepted Answer

The link field of the last node in a linked list is always NULL since there are no further nodes to link to.

Question 16

Each node of a singly linked list has two components: ____ and ____.
A) info, head
B) link, back
C) back, head
D) info, link

Accepted Answer

A singly linked list consists of nodes that contain two components: the data (info) and a pointer to the next node (link). The data component stores the actual value or information that is being stored in the list, and the pointer component points to the next node in the list. Therefore, option D (info, link) is the correct answer.

Question 17

Because each node of a linked list has two components, we need to declare each node as a(n) ____.
A) reference and string
B) int and object
C) index and element
D) class or struct

Accepted Answer

Linked list nodes usually contain data and a reference to the next node in the list, therefore they are best represented as a class or struct. This allows us to define the data and the reference as separate components of each node.

Question 18

In a linked list, the address of the first node in the list is stored in a separate location, called the ____ or first.
A) head
B) pointer
C) front
D) top

Accepted Answer

In a linked list, the address of the first node (also known as the head node) is stored separately from the rest of the list. This location is commonly referred to as the "head" or "head pointer." Therefore, the best choice is A, as it specifically refers to the head node in a linked list.

Question 19

The length of a linked list is the number of nodes in the list.

Accepted Answer

The length of a linked list is defined as the number of nodes in the list, so the statement is true.

Question 20

Every node (except of the last node) in a singly linked list contains ____.
A) the next node
B) no address information
C) the address of the next node
D) the address of the previous node

Accepted Answer

Each node in a singly linked list contains the address of the next node. This is what allows us to traverse the list by starting at the head and following the links from node to node until we reach the desired node.

Quiz 17: Linked Lists

A doubly linked list can be traversed in either direction.

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

It is not possible to create an ordered linked list.

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

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

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

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

You can use the pointer head of a linked list to traverse the list.

A linked list is a random access data structure.

Memory for the components of an array does not need to be contiguous.

What is the purpose of the following code? current = head; While (current != NULL) { //Process current Current = current->link; }

Linked lists allow you to overcome the size limitations of an array data type.

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.

We deallocate the memory for a linked list by calling the operator clear.

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

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

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

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

The length of a linked list is the number of nodes in the list.

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