61. Consider the following linked list and linked list representation. what will be the value of following statement ?
start->next->next->next->data
struct node {
      int data;
      struct node *next;
}*start = NULL;
a. 12
b. 30
c. 15
d. 25
Answer: (d).25

62. If start is pointing to first node of the linked list then consider the following statement -

start = start->next;
current = start->next;

what will be the value of address field of current ?
a. 5571
b. 5572
c. 3225
d. 2184
Answer: (a).5571

63. In Linked list implementation, a node carries information regarding _______.
a. Link
b. Data
c. Data and Link
d. None of the above
Answer: (c).Data and Link

64. A linked list in which the last node of Linked list points to the first is called a _________.
a. Doubly Linked List
b. Circular Linked List
c. Singly Linked List
d. None of these
Answer: (b).Circular Linked List

65. A doubly linked list performs traversal in _________.
a. Any direction
b. Circular direction
c. Either direction
d. None of the above
Answer: (c).Either direction

66. Linked list data structure usage offers considerable saving in
a. Space utilization
b. Computational time
c. Space utilization & computational time
d. None of the above
Answer: (c).Space utilization & computational time

67. Consider linked list is used to implement the Stack then which of the following node is considered as Top of the Stack ?
a. Any Node
b. Last Node
c. First Node
d. Middle Node
Answer: (c).First Node

68. The link field in the last node of the linked list contains _________.
a. Link to the first node
b. Zero value
c. Pointer to the next element location
d. None of the above
Answer: (b).Zero value

69. When new element is added in the middle of singly linked list then ________.
a. Only elements that appear after the new element need to be moved
b. Only elements that appear before the new element need to be moved
c. No need to move element
d. Only elements that appear after the new element and before need to be moved
Answer: (c).No need to move element

70. Which of the following operation is performed more efficiently in doubly linked list ?
a. Inserting a node at given position
b. Deleting a node at given position
c. Searching a node at given position
d. None of these
Answer: (b).Deleting a node at given position