Which of the following data structure is preferred to have lesser sear – McqOptions

MCQOPTIONS

1.	Which of the following data structure is preferred to have lesser search time when the list size is small?
A.	search tree
B.	sorted list
C.	self organizing list
D.	linked list
Answer» D. linked list

Discussion

No Comment Found

Related MCQs

In the above question would using arrays and swaping of elements in place of xor linked list would have been more efficient ?
What is indexed skip list?
Given 10,8,6,7,9swap the above numbers such that finally you got 6,7,8,9,10so now reverse 109,7,6,8,10now reverse 98,6,7,9,107,6,8,9,106,7,8,9,10at this point 6 is ahead so no more reversing can be done so stop.To implement above algorithm which datastructure is better and why ?
Is a skip list like balanced tree?
The self organizing list improves the efficiency of _______
What technique is used in Transpose method?
The worst case running time of a linear search on the self organizing list is ____
Which of the following method performs poorly when elements are accessed in sequential order?
Which of the following data structure is preferred to have lesser search time when the list size is small?
Which of the following statements are true ?i) practical application of XOR linked lists are in environments with limited space requirements, such as embedded devices.ii)xor lists are not suitable because most garbage collectors will fail to work properly with classes or structures that don't contain literal pointersiii)in order to calculate the address of the next node you need to remember the address of the previous nodeiv)xor lists are much efficient than single, doubly linked lists and arrays