(3) What is the assumption of simple uniform hashing? Under this assumption, given a hash table with m slots that stores n elements, what is the expected time taken by an unsuccessful search when the hash collisions are resolved by chaining?

相關申論題

相關試卷