522 views
1 votes
1 votes

What are the advantages of open addressing hashing scheme?
In this, we need the size of the table greater than number of keys. In that case, why we simply don't use direct access table because in both the cases its highly impractical to use this technique for large datasets, then why we bear the overhead in computing hash functions?

1 Answer

Best answer
2 votes
2 votes
because by computing the hash function on elements,we put the elements into the specific row correspond to the index computed by hash function. therefore by computing that hash func again we can access the same element i.e.computing hash func take O(1) arithmetic computation hence take O(1) time i.e. constant time
selected by

Related questions

0 votes
0 votes
1 answer
1
tishhaagrawal asked Dec 16, 2023
313 views
Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...
1 votes
1 votes
1 answer
4
s_dr_13 asked Mar 6, 2019
960 views
Consider an open address hash table with uniform hashing. Out of 10 locations, 8 are occupied. What are the expected number of probes in an unsuccessful and successful se...