61. | Consider the following linked list and linked list representation. what will be the value of following statement ? start->next->next->next->data
![]() |
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 ? |
Answer: (a).5571
|
63. | In Linked list implementation, a node carries information regarding _______. |
Answer: (c).Data and Link
|
64. | A linked list in which the last node of Linked list points to the first is called a _________. |
Answer: (b).Circular Linked List
|
65. | A doubly linked list performs traversal in _________. |
Answer: (c).Either direction
|
66. | Linked list data structure usage offers considerable saving in |
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 ? |
Answer: (c).First Node
|
68. | The link field in the last node of the linked list contains _________. |
Answer: (b).Zero value
|
69. | When new element is added in the middle of singly linked list then ________. |
Answer: (c).No need to move element
|
70. | Which of the following operation is performed more efficiently in doubly linked list ? |
Answer: (b).Deleting a node at given position
|