Consider a symbol table implemented using hashing with table size $10$ . For key $27$ , using $h(k) = k \bmod 10$ , the initial position is:
(i) $5$
(ii) $7$
(iii) $6$
(iv) $8$

Question

Consider a symbol table implemented using hashing with table size $10$. For key $27$, using $h(k) = k \bmod 10$, the initial position is:
(i) $5$
(ii) $7$
(iii) $6$
(iv) $8$

Accepted Answer

**Answer: (ii) 7**

**Calculation**

$$h(27) = 27 \bmod 10 = 7$$

because $27 = 2 	imes 10 + 7$. The key $27$ is initially placed at index $7$ of the hash table.

**Note:** if slot $7$ is already occupied (a *collision*, e.g. key $17$), it is resolved by chaining (linked list at slot 7) or open addressing (linear probing to slot 8, 9, ...).

$$\boxed{	ext{(ii) } 7}$$

Similar questions

PYQDeck for Android