[Solved] 20 Points Open Addressing Double Hashing H K Hi K Ih2 K Mod M Hi K H2 K Auxiliary Function Q37241369

(20 points) In open addressing with double hashing, we have h(k, i)hi(k)+ih2(k) mod m, where hi(k) and h2(k) is an auxiliary functions. In class we saw that h2(k) and m should not have any common divisors (other than 1). Explain what can go wrong if h2(k) and m have a common divisor. In particular, consider following scenario: m-16.h1(k) mod (m/8) and h2(k) m/2 and the keys are ranged from 0 to 15. Using this hash function, can the hash table be completely filled? How many distinct keys can be inserted into the hash tables Show transcribed image text (20 points) In open addressing with double hashing, we have h(k, i)hi(k)+ih2(k) mod m, where hi(k) and h2(k) is an auxiliary functions. In class we saw that h2(k) and m should not have any common divisors (other than 1). Explain what can go wrong if h2(k) and m have a common divisor. In particular, consider following scenario: m-16.h1(k) mod (m/8) and h2(k) m/2 and the keys are ranged from 0 to 15. Using this hash function, can the hash table be completely filled? How many distinct keys can be inserted into the hash tables

Expert Answer

---

Answer to (20 points) In open addressing with double hashing, we have h(k, i)hi(k)+ih2(k) mod m, where hi(k) and h2(k) is an auxil… . . .