Virtual Labs

1. Which statement about a singly linked-list node is correct?

a: It normally contains data and a link to the next node Explanation

Explanation

b: It must contain previous and next links Explanation

Explanation

c: It must contain its position index Explanation

Explanation

d: It must contain the total list size Explanation

Explanation

2. A list contains 5 → 8 → 12 → NULL. If `head` points to 5, what data is in `head->next`?

a: 5 Explanation

Explanation

b: 12 Explanation

Explanation

c: NULL Explanation

Explanation

d: 8 Explanation

Explanation

3. Which statement about memory allocation for linked-list nodes is correct?

a: All nodes must be consecutive in memory Explanation

Explanation

b: Nodes can be allocated at different locations and connected using links Explanation

Explanation

c: Only the first node needs memory Explanation

Explanation

d: Linked lists cannot use dynamic allocation Explanation

Explanation

4. What is the worst-case time complexity of deleting the last node when only a head pointer is available?

O(1)

Explanation

O(\log n)

Explanation

O(n)

Explanation

O(n^2)

Explanation

5. Why is insertion at the beginning of a singly linked list

O(1)

when `head` is available?

a: All nodes are shifted Explanation

Explanation

b: Every existing node is visited Explanation

Explanation

c: The last node is found first Explanation

Explanation

d: Only the new node and a constant number of links need updating Explanation

Explanation

6. Which statement about a circular linked list is true?

a: The last node points to NULL in every implementation Explanation

Explanation

b: The last node can link back to the first node Explanation

Explanation

c: Every node must have a previous pointer Explanation

Explanation

d: It cannot be traversed sequentially Explanation

Explanation

7. If a pointer to the node at position

k

is already available, what is the complexity of inserting a node immediately after it?

O(1)

Explanation

O(n)

Explanation

O(\log n)

Explanation

O(n^2)

Explanation

8. A singly linked list contains

n

nodes. If it is traversed once from head to the end, how does the running time grow with

n

a: Constantly Explanation

Explanation

b: Logarithmically Explanation

Explanation

c: Linearly Explanation

Explanation

d: Quadratically Explanation

Explanation

9. Which operation is generally more convenient in a doubly linked list when a pointer to the target node is already available?

a: Searching for an arbitrary value Explanation

Explanation

b: Counting all nodes Explanation

Explanation

c: Finding the smallest value Explanation

Explanation

d: Deleting the target without first searching for its predecessor Explanation

Explanation

Linked List