hashing

1) Hashing is a technique to convert a range of key values into a range of (a)  

Of an array.

1) Which hash function we are using for Double Hashing.

• h(x)=(hash(x)+i)%size

• h(x)=hash1(x)+i*hash2(x)

• h(x)=key%size.

• all of the above.

1) Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following statements are true? (GATE CS 2004)

i. 9679, 1989, 4199 hash to the same value

ii. 1471, 6171 has to the same value

iii. All elements hash to the same value

iv. Each element hashes to a different value

• i only

• ii only

• i and ii only

• iii or iv

1) A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is as shown below.

Which one of the following choices gives a possible order in which the key values could have been inserted in the table?

• 46, 42, 34, 52, 23, 33

• 34, 42, 23, 52, 33, 46

• 46, 34, 42, 23, 52, 33

• 42, 46, 33, 23, 34, 52

1) (a)   occurs when a hashing function produce an index for insert key and that address is already occupied.