ADS Quiz 3

Which of the following best describes a linked list in C++?

• A contiguous block of memory with fixed size

• A dynamic data structure composed of nodes with data and pointer(s)

• A fixed-size container provided by the STL

• An array where elements are linked via indices

What is a singly linked list?

• A list where each node has pointers to both previous and next nodes

• A list where each node contains a pointer only to the previous node

• A list where each node contains a pointer only to the next node

• A list where nodes are linked in pairs

In a singly linked list, what does the head pointer represent?

• The last node in the list

• The node with the maximum value

• The first node in the list

• A node in the middle of the list

In a circularly linked list, the next pointer of the last node points to:

• The previous node

• The first node (head)

• A NULL pointer

• Itself

What characterizes a doubly linked list?

• Each node has two data fields

• Each node has pointers to both the next and previous nodes

• Each node has two pointers to the next node

• It is a combination of two singly linked lists

Which operation involves visiting each node of a linked list to process or print its data?

• Insertion

• Deletion

• Traversal

• Reversal

What is the time complexity of traversing a linked list with n nodes?

• O(1)

• O(n)

• O(log n)

• O(n²)

How do you insert a new node at the beginning of a singly linked list?

• Change the tail pointer to the new node

• Update the head pointer so it points to the new node, linking its next to the old head

• Traverse to the end of the list and append the node

• Insertion at the beginning is not allowed

When inserting a node at the beginning of a singly linked list, which pointer assignment is necessary?

• new_node->next = head;

• head->next = new_node;

• new_node->prev = head;

• head = new_node->next;

How is a new node typically inserted at the end of a singly linked list?

• Set the new node as head

• Traverse to the last node and set its next pointer to the new node

• Link the new node's next to the head

• Use a built-in function to append without pointer manipulation