Question

) e ao)be unaoog aggd aapeog a an u oq a popa senbo e ay woa apaon d ageE asuaaa aqL je apee g aq o pmope w pa poy o pa a a ama p asse usopone sou anbor sapoe a a paoe pae R .c.c ap g ()ae (ana) 1 a1 g 1ma-9tS

Answer 1

Question 1:

a). In a linked list, the order of the elements is determined by the order in which the nodes were created to store the elements.

Correct Answer: True

Explanation:

A linked list is a sequential data structure and we can traverse a linked list starting from the reference pointer. So the order of the elements is the order in which the nodes were created in the linked list.

b). In a linked list, memory allocated for the node is sequential.

Correct Answer: False

Explanation:

In a linked list, memory allocated for the node is not-sequential but it is random and because of non-sequential memory allocation we can't access the element randomly. In the array data structure, memory allocation is sequential.

c). A singly linked list can be traversed in either direction.

Correct Answer: False

Explanation:

A single linked list can be traversed in forwarding direction only because we have only one pointer associated with each node.

To traverse a linked list in either direction, we need a doubly linked list.

d). In a linked list, the nodes are always inserted either in the beginning or at the end because a linked list is not a random access data structure.

Correct Answer: False

Explanation:

In a linked list, the nodes are always inserted at the beginning because the insertion at the end requires the traversal also and it takes extra time in insertion operation.

e). The reference variable pointing to the first node of a linked list should be used to traverse the list.

Correct Answer: False

Explanation:

If we will use the reference variable to traverse the list then we will lose the reference variable for further use because in traversal we need to update the pointer variable to store the address of the next node.