Free Practice Quiz Question List

03 Linked Lists Online Quiz Questions

Use this free practice quiz with 20 questions to review 03 Linked Lists, test your knowledge, and prepare for your next test or exam.

20 questions

Choose one

1 point

Which statement best explains how linked-list nodes are stored?

A
Every node must be stored next to the preceding node in memory.
B
Nodes may be distributed throughout memory and connected by links.
C
Every node must contain a complete copy of the entire list.
D
Nodes cannot be connected unless they are stored in an array.

Choose one

1 point

A singly linked list uses head to identify its first node. Which sequence correctly inserts new at the front without losing the existing list?

A
Set head to null, then set new.next to head.
B
Set head to new, then set new.next to head.
C
Set new.next to head, then set head to new.
D
Set new.next to null, then set head to new.

True or false

1 point

A singly linked list cannot move directly backward from a node because it does not store a predecessor link.

A
True
B
False

Written response

1 point

What is the conventional name for the reference that identifies the first node of a linked list?

Fill in the blank

1 point

Complete the conceptual singly linked-node definition: a node contains for the stored element and for the link to the following node.

Choose one

1 point

If a singly linked list stores only a head reference, what is the time complexity of appending a new node at the end?

A
$O(n)$
B
$O(1)$
C
$O(\log n)$
D
$O(n^2)$

Choose all

1 point

Which operations can take $O(1)$ time once the relevant location is already known? Select all correct choices.

A
Inserting after a known node in a singly linked list
B
Removing a known node from a doubly linked list
C
Finding a value in an unsorted linked list
D
Deleting the head node of a singly linked list

True or false

1 point

In a circular linked list, a traversal that waits for current == null will not stop because the final node links back to the first node.

A
True
B
False

Written response

1 point

A linked list has at least 7 nodes and is accessed sequentially from the head. With zero-based indexing, how many nodes must be visited to retrieve the element at index 6?

Fill in the blank

1 point

In a circular singly linked list, traversal begins at , and the final node's link refers back to the first node.

Choose all

1 point

Which conditions generally favor an array-backed list over a linked list? Select all correct choices.

A
Elements are frequently accessed by index.
B
Traversal speed and cache locality are important.
C
Frequent insertions occur near already known nodes.
D
Memory overhead from one or more links per node should be minimized.

Open ended

1 point

Compare deleting a node by value in a singly linked list with deleting a known node in a doubly linked list. Explain the relevant time complexities and why the distinction between locating a node and changing links matters.

Choose one

1 point

Why can an array-backed list be faster in practice than a linked list even when the linked list has an $O(1)$ insertion or deletion at a known location?

A
A linked list always has better practical performance because $O(1)$ is faster than any array operation.
B
An array-backed list can be faster in practice because contiguous storage improves cache locality and reduces allocation and indirection costs.
C
An array-backed list cannot support insertion or deletion under any circumstances.
D
Cache locality matters only for doubly linked lists, not singly linked lists.

True or false

1 point

If an application must traverse a linked list backward from a node, a doubly linked list is appropriate because it stores prev links.

A
True
B
False

Choose one

1 point

Which pair of fields is sufficient for the basic representation of a node in a singly linked list?

A
data and next
B
data and prev only
C
head and tail only
D
index and capacity

Written response

1 point

In a singly linked list, what conventional value represents the fact that the final node has no successor?

Choose one

1 point

Which assignment order correctly inserts a new node at the front of a nonempty singly linked list?

A
head = new, then new.next = head
B
new.next = head, then head = new
C
new.next = null, then head = new
D
head.next = new, then new = head

Written response

1 point

What reference identifies the last node when a linked-list implementation explicitly maintains a reference to its final node?

Choose one

1 point

Which feature directly enables traversal from a node toward the beginning of a linked list?

A
A next link in a singly linked list
B
A tail reference in any linked list
C
A prev link in a doubly linked list
D
A size counter in any linked list

Choose one

1 point

A target node in a doubly linked list is already known. What is the time complexity of inserting one new node immediately before that target?

A
$O(1)$
B
$O(\log n)$
C
$O(n)$
D
$O(n^2)$