engineering recuitment NIC NIELIT Scientist B 2023 Mock Test DBMS File Organization and Indexing Hashing
Given a set of keys K={k1,k2,k3………..kn}, a perfect hash function is a hash function h will satisfy ______ condition for all distinct i and j where I is not equal to j
1
h(ki)≤h(kj)
2
h(ki)≥h(kj)
3
h(ki)≠h(kj)
4
h(ki)=h(kj)