Queues Q.48
0. The average search time of hashing, with linear probing, will be less if the load factor
- Option : A
- Explanation : The 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.
