Data Structure (DS) MCQs | Page - 27

Q. 261) In a linked list the _________field contains the address of next element in the list.

Q. 262) A list that has no nodes is called________.

Q. 263) The special list which consists of unused memory space is called __________.

Q. 264) The efficient searching algorithm for algorithm for a sorted array is _________.

Q. 265) To insert a new node in linked list free node will be available in ___________.

Q. 266) A ______________ list is a header list where the node points back to the header node.

Q. 267) How many pointers are necessarily changed for the insertion in a Linked List?

Q. 268) An algorithm that calls itself directly or indirectly is known as ____________.

Q. 269) If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.

Q. 270) An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of