Virtual Labs

1. In a singly linked list, can a node directly identify the node immediately before it?

a: Yes, because every node stores a previous pointer Explanation

Explanation

b: No, because a standard singly linked-list node stores only its next link Explanation

Explanation

c: Yes, because memory addresses are always consecutive Explanation

Explanation

d: No, because singly linked lists contain no links Explanation

Explanation

2. Which field is normally present in a node of a singly linked list?

a: Data and a link to the next node Explanation

Explanation

b: Data and links to both previous and next nodes Explanation

Explanation

c: Only a memory address Explanation

Explanation

d: Only the position of the node Explanation

Explanation

3. What normally indicates the end of a non-circular singly linked list?

a: The last node points to the first node Explanation

Explanation

b: The last node points to itself Explanation

Explanation

c: The last node's next link contains NULL Explanation

Explanation

d: The last node is stored at the largest memory address Explanation

Explanation

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

n

nodes?

O(1)

Explanation

O(\log n)

Explanation

O(n)

Explanation

O(n^2)

Explanation

5. When inserting a node immediately after a known node in a singly linked list, how many existing nodes must be traversed to locate the insertion point?

a: All

n

nodes Explanation

Explanation

b: Only the known node is needed Explanation

Explanation

c: Exactly

n/2

nodes Explanation

Explanation

d: The number depends on whether the list is sorted Explanation

Explanation

6. If `head` points to the first node and that node is deleted from a singly linked list, what must happen to `head`?

a: It must point to the deleted node Explanation

Explanation

b: It must be set to the last node Explanation

Explanation

c: It must be updated to point to the former second node Explanation

Explanation

d: It must always be set to NULL Explanation

Explanation

7. A singly linked list contains 10 → 20 → 30 → NULL. If `head` points to 10, what does `head->next->next->data` contain?

a: 10 Explanation

Explanation

b: 20 Explanation

Explanation

c: 30 Explanation

Explanation

d: NULL Explanation

Explanation

8. If a singly linked list contains

n

nodes, what is the worst-case time complexity of deleting the last node when only the head pointer is available?

O(1)

Explanation

O(\log n)

Explanation

O(n)

Explanation

O(n^2)

Explanation

9. Which situation allows deletion of a node in a singly linked list to be performed without first traversing from the head to locate that node?

a: The node itself is already directly referenced and the required neighboring information is available Explanation

Explanation

b: The list contains more than

n

nodes Explanation

Explanation

c: The list is stored in contiguous memory Explanation

Explanation

d: The list is sorted in ascending order Explanation

Explanation

Linked List