Singly Linked List Operation Test – 2

1. In Linked List implementation, a node carries information regarding ___________

2. Linked list is considered as an example of ___________ type of memory allocation.

3. Linked lists are not suitable for the implementation of ___________

4. Which of the following points is/are not true about Linked List data structure when it is compared with an array?

5. What kind of linked list is best to answer questions like “What is the item at position n?”

6. What does the following function do for a given Linked List with first node as head?

void fun1(struct node* head)
{
    if(head == NULL)
    return;
    fun1(head->next);
    printf("%d  ", head->data);
}

7. Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

8. Linked list data structure offers considerable saving in _____________