Virtual Labs

1. What is a key feature of a doubly linked-list node?

a: It stores only a link to the next node Explanation

Explanation

b: It stores links to both the previous and next nodes Explanation

Explanation

c: It stores no links Explanation

Explanation

d: It stores two links to the first node Explanation

Explanation

2. What is a major advantage of a doubly linked list over a singly linked list?

a: It always uses less memory Explanation

Explanation

b: It automatically keeps nodes sorted Explanation

Explanation

c: It supports traversal in both directions Explanation

Explanation

d: It provides direct indexed access Explanation

Explanation

3. In a non-circular doubly linked list, what does the previous link of the first node normally contain?

a: The last node Explanation

Explanation

b: The second node Explanation

Explanation

c: NULL Explanation

Explanation

d: The address of the head variable Explanation

Explanation

4. When a pointer to a target node in a doubly linked list is already available, what is the time complexity of deleting that node?

O(1)

Explanation

O(\log n)

Explanation

O(n)

Explanation

O(n^2)

Explanation

5. Why is deleting a known node often simpler in a doubly linked list than in a singly linked list?

a: The doubly linked node provides direct access to its predecessor Explanation

Explanation

b: Doubly linked lists store all nodes contiguously Explanation

Explanation

c: Doubly linked lists do not require links Explanation

Explanation

d: The node automatically deletes itself Explanation

Explanation

6. When inserting a node between two known nodes in a doubly linked list, which links are affected?

a: Only the new node's data Explanation

Explanation

b: Only the head pointer Explanation

Explanation

c: The neighboring nodes' links and the new node's previous and next links Explanation

Explanation

d: Every link in the list Explanation

Explanation

7. Consider the doubly linked sequence 10 ↔ 20 ↔ 30. If a pointer refers to the node containing 20, what does following its previous link reach?

a: 10 Explanation

Explanation

b: 20 Explanation

Explanation

c: 30 Explanation

Explanation

d: NULL Explanation

Explanation

8. A doubly linked list contains 10 ↔ 20 ↔ 30. If the node containing 20 is removed, which sequence should remain?

a: 10 ↔ 20 Explanation

Explanation

b: 20 ↔ 30 Explanation

Explanation

c: 10 ↔ 30 Explanation

Explanation

d: 10 ↔ 20 ↔ 30 Explanation

Explanation

9. Which statement correctly compares traversal in singly and doubly linked lists?

a: Only singly linked lists can be traversed forward Explanation

Explanation

b: A doubly linked list can move backward through previous links, while a singly linked list normally cannot move directly backward Explanation

Explanation

c: Both structures always provide direct indexed access Explanation

Explanation

d: A singly linked list requires more links per node than a doubly linked list Explanation

Explanation

Linked List