31. The last node of the singly-linked list contains__________.
a. Info
b. NULL
c. Next
d. None of the above
Answer: (b).NULL

32. A linked list contains a list pointer variable _____that stores the address of the first node of the list.
a. Start
b. NULL
c. Next
d. Empty list
Answer: (a).Start

33. To maintain a linked list in memory, how many parallel arrays of equal size are used?
a. One
b. Two
c. Three
d. Four
Answer: (b).Two

34. As memory is allocated dynamically to a linked list, a new node can be inserted anytime in the list. For this, the memory manager maintains a special linked list known as___________.
a. Free pool
b. Memory bank
c. Free storage list
d. All of the above
Answer: (c).Free storage list

35. While creating a linked list or inserting an element into a linked list, whenever a request for the new node arrives, the memory manager searches through the ------------for the block of desired size.
a. Free pool
b. Memory bank
c. Free storage list
d. None of the above
Answer: (c).Free storage list

36. What does creating a node mean?
a. Defining its structure
b. Allocating memory to it
c. Initialization
d. All of the above
Answer: (d).All of the above

37. _________a list means accessing its elements one by one to process all or some of the elements.
a. Traversing
b. Creating
c. Linking
d. None of the above
Answer: (a).Traversing

38. Searching a value (say, item) in a linked list means finding the position of the node, which stores ___________ as its value?
a. node
b. item
c. info
d. None of the above
Answer: (b).item

39. A situation where the user tries to delete a node from an empty linked list is termed as___________.
a. Underflow
b. Overflow
c. Pointers
d. None of the above
Answer: (a).Underflow

40. To delete a node from the end of a linked list, the list is traversed up to the last ______.
a. Pointer
b. Node
c. List
d. None of the above
Answer: (b).Node

Page 4 of 17