Linear Probing suffers from which leads to .
Primary Clustering, Increase in average search time
Secondary Clustering, Increase in average search time
Primary Clustering, Decrease in average search time
Secondary Clustering, Decrease in average search time
how to solve this mapping question of hashing function? Consider a hash table of size m = 10000, and the hash function h(K) = floor (m(KA mod 1)) for A = ( √(5) – 1)/2. The key 123456 is mapped to location . 45 41 43 48
These are some theoretical parts.
Refer to this for Linear Probing
Refer this for the second question https://www.geeksforgeeks.org/ugc-net-ugc-net-cs-2016-aug-iii-question-32/