Virtual Labs

1. What distinguishes a circular singly linked list from a standard singly linked list?

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

Explanation

b: Every node contains two data fields Explanation

Explanation

c: Nodes must be stored consecutively Explanation

Explanation

d: Every node contains a previous pointer Explanation

Explanation

2. In a circular singly linked list with at least one node, what does the last node's next link reference?

a: NULL Explanation

Explanation

b: The first node Explanation

Explanation

c: The previous node Explanation

Explanation

d: The last node only Explanation

Explanation

3. Which traversal rule is important when traversing a circular linked list?

a: Stop only when a NULL link is found Explanation

Explanation

b: Continue until the starting node is encountered again Explanation

Explanation

c: Move only toward lower memory addresses Explanation

Explanation

d: Visit the first node exactly twice before stopping Explanation

Explanation

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

n

nodes?

O(1)

Explanation

O(\log n)

Explanation

O(n)

Explanation

O(n^2)

Explanation

5. If a circular singly linked list has a pointer to its last node, which node can be reached directly through the last node's next link?

a: The first node Explanation

Explanation

b: The second-to-last node Explanation

Explanation

c: NULL Explanation

Explanation

d: A newly allocated node Explanation

Explanation

6. When inserting a node between two existing nodes in a circular singly linked list, which links normally need to be changed?

a: Only the new node's data field Explanation

Explanation

b: The predecessor's next link and the new node's next link Explanation

Explanation

c: Every link in the list Explanation

Explanation

d: Only the head pointer Explanation

Explanation

7. A circular linked list contains 10 → 20 → 30 and the link from 30 returns to 10. Starting at 10, what value is reached after three `next` operations?

a: 10 Explanation

Explanation

b: 20 Explanation

Explanation

c: 30 Explanation

Explanation

d: NULL Explanation

Explanation

8. Why can a circular linked list be useful for repeatedly cycling through a collection of nodes?

a: Its links naturally return traversal to the first node after the last node Explanation

Explanation

b: It automatically sorts the nodes after each traversal Explanation

Explanation

c: It provides constant-time access by index Explanation

Explanation

d: It removes the need to store node links Explanation

Explanation

9. In a circular singly linked list, what is a reliable way to detect completion of one full traversal when starting from a known node?

a: Stop when the current pointer becomes NULL Explanation

Explanation

b: Stop when the current pointer returns to the starting node after moving forward Explanation

Explanation

c: Stop when a node contains the largest value Explanation

Explanation

d: Stop after visiting an arbitrary number of nodes Explanation

Explanation

Linked List