Virtual Labs

1. Which statement best describes a linked list?

a: A collection stored only in contiguous memory Explanation

Explanation

b: A collection of nodes connected through links or pointers Explanation

Explanation

c: A fixed-size collection with direct indexing Explanation

Explanation

d: A hierarchical structure with child nodes Explanation

Explanation

2. In a singly linked list, what does the link field of the last node normally contain?

a: The address of the first node Explanation

Explanation

b: The address of the previous node Explanation

Explanation

c: NULL Explanation

Explanation

d: The number of nodes Explanation

Explanation

3. Which is a key advantage of a linked list over a fixed-size array?

a: Nodes can be added or removed without requiring one contiguous block of storage Explanation

Explanation

b: Every element has direct indexed access Explanation

Explanation

c: It always uses less memory Explanation

Explanation

d: It automatically keeps elements sorted Explanation

Explanation

4. What is the worst-case time complexity of searching for a value in a singly linked list containing

n

nodes?

O(1)

Explanation

O(\log n)

Explanation

O(n^2)

Explanation

O(n)

Explanation

5. Suppose `head` refers to the first node. What does `head->next` represent?

a: The data in the first node Explanation

Explanation

b: The address of the second node Explanation

Explanation

c: The address of the last node Explanation

Explanation

d: The number of nodes Explanation

Explanation

6. Which operation can be performed in

O(1)

time when a pointer to the relevant node is already available?

a: Searching for an arbitrary value Explanation

Explanation

b: Finding the node at position

n/2

Explanation

c: Inserting a new node immediately after the referenced node Explanation

Explanation

d: Finding the smallest value in an unsorted list Explanation

Explanation

7. Consider 10 → 20 → 30 → NULL. If `head` points to 10, what value is obtained from `head->next->next`?

a: 20 Explanation

Explanation

b: 30 Explanation

Explanation

c: 10 Explanation

Explanation

d: NULL Explanation

Explanation

8. In a doubly linked list, which pair of links is normally maintained in each internal node?

a: Links to the previous and next nodes Explanation

Explanation

b: Two links to the next node Explanation

Explanation

c: A link to the head and a link to the list size Explanation

Explanation

d: A link to the first and last nodes Explanation

Explanation

9. Which statement distinguishes a circular singly linked list from a standard singly linked list?

a: Every node has two data fields Explanation

Explanation

b: It provides direct indexing Explanation

Explanation

c: The last node links back to the first node Explanation

Explanation

d: It cannot represent an empty list Explanation

Explanation

Linked List