Test by Bikram | Mock GATE | Test 4 | Question: 13

Question

Consider an initially empty hash table of length $10$. Following set of keys are inserted using open addressing with hash function $h\left ( k \right )=k\mod 10$ and linear probing.

$2$, $13$, $24$, $12$, $62$, $73$, $82$, $91$

The number of probes done while searching for element $82$ is __________.

Answer 1

hope it helps!!!

Comments

why hashing onto slot 2 for searching 82 is also considered a probe?

---

@Tuhin

82 %10 =2

So we have to start a search for slot 2...