Data Structures

1: The average search time of hashing, with linear probing will be less if the load factor
A. is for less than one
B. equals one
C. is for greater than one
D. none of these
 

Answer : A

Explanation :

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.