CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

The average search time of hashing with linear probing will be less if the load factor?

A
is far less that one
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
B
equals one
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
is far greater than one
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
All of the above
No worries! We‘ve got your back. Try BYJU‘S free classes today!
E
None of the above
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is A is far less that one
Load factor is the ratio of the number of records that are currently present and the total number of records that can be present. If the load factor is less, free space will be more. This means the probability of collision is less. So the search time will be less.

flag
Suggest Corrections
thumbs-up
1
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Theoretical Probability
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon