UGC NET CS 2015 Dec- paper-2
November 23, 2023Question 3888 – Data-Structures
November 23, 2023Question 3738 – Data-Structures
The hash function used in double hashing is of the form:
Correct Answer: C
Question 410 Explanation:
Double Hashing with second hash function is h(k,i) = (h 1 (k) + i·h 2 (k)) mod m 0≤ i ≤m-1
h 1 → hash function
h 2 → Step function
First try h(k,0) = h 1 (k), if it is occupied, try h(k,1) etc..,
Advantage: less clusters, uses Θ(m*m) permutations of index addressing sequences.
h 1 → hash function
h 2 → Step function
First try h(k,0) = h 1 (k), if it is occupied, try h(k,1) etc..,
Advantage: less clusters, uses Θ(m*m) permutations of index addressing sequences.
h (k, i) = (h 1 (k) + h 2 (k) + i) mod m
h (k, i) = (h 1 (k) + h 2 (k) – i) mod m
h (k, i) = (h 1 (k) + i h 2 (k)) mod m
h (k, i) = (h 1 (k) – i h 2 (k)) mod m
Subscribe
Login
0 Comments