Let us consider a simple hash function as "key mod 11" and a sequence of keys as 11, 54, 77. When a collision occurs, store the key using quadratic…
Let us consider a simple hash function as "key mod 11" and a sequence of keys as 11, 54, 77. When a collision occurs, store the key using quadratic probing.
From the BUET MSC (CSE) May 2019 – Written exam, question 10 of 16.