11. The situation when in a linked list START=NULL is
a. underflow
b. overflow
c. housefull
d. saturated
Answer: (a).underflow

12. Which of the following is two way list?
a. grounded header list
b. circular header list
c. linked list with header and trailer nodes
d. none of above
Answer: (d).none of above

13. In a circular linked list
a. Components are all linked together in some sequential manner.
b. There is no beginning and no end.
c. Components are arranged hierarchically.
d. Forward and backward traversal within the list is permitted.
Answer: (b).There is no beginning and no end.

14. A linear collection of data elements where the linear node is given by means of pointer is called?
a. Linked list
b. Node list
c. Primitive list
d. None of the above
Answer: (a).Linked list

15. Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
a. Deleting a node whose location in given
b. Searching of an unsorted list for a given item
c. Inverting a node after the node with given location
d. Traversing a list to process each node
Answer: (a).Deleting a node whose location in given

16. What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
a. O(1)
b. O(n)
c. θ (n)
d. θ (1)
Answer: (c).θ (n)

17. A variant of linked list in which last node of the list points to the first node of the list is?
a. Singly linked list
b. Doubly linked list
c. Circular linked list
d. Multiply linked list
Answer: (c).Circular linked list

18. In doubly linked lists, traversal can be performed?
a. Only in forward direction
b. Only in reverse direction
c. In both directions
d. None of the above
Answer: (c).In both directions

19. What kind of linked list is best to answer question like “What is the item at position n?”
a. Singly linked list
b. Doubly linked list
c. Circular linked list
d. Array implementation of linked list
Answer: (d).Array implementation of linked list

20. A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?
a. It waste memory space since the pointer head already points to the first node and thus the list node does not need to point to the first node.
b. It is not possible to add a node at the end of the list.
c. It is difficult to traverse the list as the pointer of the last node is now not NULL
d. All of above
Answer: (c).It is difficult to traverse the list as the pointer of the last node is now not NULL

Page 2 of 17