2 votes 2 votes The average search time for hashing with linear probing will be less if the load factor Is far less than one Equals one Is far greater than one None of the above Algorithms nielit2017oct-assistanta-it algorithms hashing + – admin asked Apr 1, 2020 edited Sep 29, 2020 by soujanyareddy13 admin 845 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Option A) is correct as , Load Factor = Number of keys in hash table / Capacity It determines the amount of space in the hash table, if load factor is less it means there is more space in the Hash table . Sanandan answered Sep 9, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes A. Is far less than one … 1. https://gateoverflow.in/336810/nielit-2017-dec-scientific-assistant-a-section-b-3 Pramod k answered Aug 16, 2022 Pramod k comment Share Follow See all 0 reply Please log in or register to add a comment.