71. The algorithm given is for deleting an element in an unrolled linked list. What should be the correct statement for the blank given below?
Find an element in node a
a.data.delete(element)
a.elementNum--
while a.elementNum < a.data.size / 2
put element from a.next.data in a.data
a.next.elementNum--
a.elementNum++
if a.next.elementNum < a.next.data.size / 2
_______________________
_______________________
Find an element in node a
a.data.delete(element)
a.elementNum--
while a.elementNum < a.data.size / 2
put element from a.next.data in a.data
a.next.elementNum--
a.elementNum++
if a.next.elementNum < a.next.data.size / 2
_______________________
_______________________72. The nodes in a skip list may have many forward references. their number is determined
73. What is a skip list?
74. Which of the following is a drawback of an unrolled linked list?
75. Which of the following is not the properties of XOR lists?
76. Which of the following is true about the Move-To-Front Method for rearranging nodes?
77. Are the below statements true about skiplists?
In a sorted set of elements skip lists can implement the below operations
i.given a element find closest element to the given value in the sorted set in O(logn)
ii.find the number of elements in the set whose values fall a given range in O(logn)
In a sorted set of elements skip lists can implement the below operations
i.given a element find closest element to the given value in the sorted set in O(logn)
ii.find the number of elements in the set whose values fall a given range in O(logn)
78. Where does a triply linked list contains an extra pointer in comparison to a doubly linked list?
79. How are free blocks linked together mostly and in what addressing order?
80. Symbol tables during compilation of program is efficiently implemented using . . . . . . . .
Read More Section(Linked Lists in Data Structures)
Each Section contains maximum 100 MCQs question on Linked Lists in Data Structures. To get more questions visit other sections.