me test

Question

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

The number of different insertion sequence of the key values using the given hash function and linear probing will result in the hash table shown in above?

 

(given ans is 128 but i am getting 288)

Comments

@Shaik Masthan

thanks bhai, got it now using your topological ordering method :)

---

Thanks a lot, Mr. Sheikh

---

Duplicates:

https://gateoverflow.in/188101/hashing-test-series

https://gateoverflow.in/243402/hashing

https://gateoverflow.in/198426/hash-table-and-ipv6

Answer 1

firstly i suggest you to go through below link

https://gateoverflow.in/253496/number-of-topological-order

answer is 288