Free Practice Quiz Question List

4 Linked Lists Online Quiz Questions

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

20 questions

Choose one

1 point

A singly linked list already has a head reference. What is the time complexity of inserting one new node at the front?

A
The entire list must be traversed, so it is $O(n)$ .
B
The new node points to the old head and the head is updated, so it is $O(1)$ .
C
Every existing node must receive a new index, so it is $O(n^2)$ .
D
The list must be copied into contiguous memory, so it is $O(n \log n)$ .

Choose one

1 point

Which description correctly identifies the fields normally stored in a node of a doubly linked list?

A
It stores a payload and two head references.
B
It stores a payload and a link only to the next node.
C
It stores a payload, a next link, and a prev link.
D
It stores a payload and the numeric index of every other node.

Choose one

1 point

Why is accessing an element by index generally faster in an array than in a linked list?

A
An array can calculate an indexed element’s address directly, while a linked list must follow links from the head to reach that position.
B
A linked list always provides faster indexed access because its nodes can be stored anywhere in memory.
C
Both structures require following links from the head before accessing any indexed element.
D
Neither structure supports access by numeric index.

Choose all

1 point

Which two statements accurately describe linked-list behavior or advantages? Select all correct choices.

A
It can avoid shifting many existing elements during some insertions.
B
Its nodes must always occupy consecutive memory locations.
C
Its nodes can be stored in non-contiguous memory.
D
It provides constant-time access to every numeric index.

Choose all

1 point

Which two statements correctly distinguish link-update costs from search costs in linked lists? Select all correct choices.

A
Insertion after a known node always requires shifting all later values.
B
Deletion after a known predecessor can be performed with a constant number of link updates.
C
Finding a node by searching from the head is always constant time.
D
Inserting between known neighboring nodes in a doubly linked list requires updating a constant number of links.

True or false

1 point

True or false: A singly linked list can move backward directly from a current node without first locating additional information.

A
True
B
False

True or false

1 point

True or false: Sorting a linked list makes ordinary binary search efficient because the list can reach its middle element quickly.

A
True
B
False

Written response

1 point

What term names an optional reference to the last node in a linked list?

Written response

1 point

What is the worst-case time complexity of searching an unsorted linked list for a value? Enter a standard Big-O expression in inline mathematical notation.

Fill in the blank

1 point

Complete the description of a linked-list node: A node stores a and one or more to other nodes.

Fill in the blank

1 point

To delete a node after a known predecessor in a singly linked list, the pointer update takes time, and the required node reference is the node.

Open ended

1 point

A system needs a linked sequence that is updated frequently. Explain when you would choose a singly linked list rather than a doubly linked list, and when the reverse choice would be justified. Include the relevant trade-offs.

Choose one

1 point

In a conventional singly linked list, how is the end of the list represented during traversal?

A
The head is set to the last node's payload.
B
The final node's next link is set to null.
C
The tail is required to point back to the head.
D
Every node stores the list's total size in its payload.

Choose one

1 point

What does the head of a linked list identify?

A
The reference to the first node
B
The reference to the last node
C
The number of nodes
D
The marker for an empty node

True or false

1 point

True or false: The nodes of a linked list must occupy consecutive memory locations.

A
True
B
False

Written response

1 point

In the node definition for a singly linked list, what is the usual name of the link to the following node?

Choose one

1 point

Which structure usually provides O(1) access to an element by numeric index?

A
A singly linked list
B
An array
C
Both structures equally
D
Neither structure

Choose one

1 point

A program already has a reference to the node before an insertion position in a singly linked list. What is the time complexity of performing the insertion itself?

A
$O(n)$ , because every node must be copied.
B
$O(n)$ , because the list must always be sorted first.
C
$O(1)$ , because only a small number of links are relinked.
D
$O(n^2)$ , because two traversals are required.

Choose one

1 point

In a doubly linked list containing A <-> B <-> C, which updates correctly remove node B when a reference to B is available?

A
Set A.prev to C and C.next to A
B
Set A.next to C and C.prev to A
C
Set B.next to A and B.prev to C
D
Set A.next and C.next to null

Written response

1 point

What is the conventional name for an optional reference to the last node of a linked list?