We initialize a hashtable H that uses open address hashing w

We initialize a hashtable H that uses open address hashing with linear probing with 256 empty slots numbered 0 to 255. The keys for our hashtable will be 16 bit unsigned integers in the range 0, 65535 The hash function used is h(m) : m&255 (the bitwise and of m with 255 selects the last 8 bits of m). The probe sequence uses linear probing: for a given key k, it starts from h(k) and explores (A) Which of the following keys causes a hash collision with the key 3? 515 200 10950

Solution

A) 5

b) 517 is inserted at 7 th position in a hash table

no of slot is 7 i.e.,517%255=7