Question
In hashing load factor α is defined as n/m where n is the no. of
elements and m is the no. of slots. In a hash table in which collisions
are resolved by chaining, what is the expected time for an
unsuccessful search and a successful search under the assumption of
simple uniform hashing?
In hashing load factor α is defined as n/m where n is the no. of
elements and m is the no. of slots. In a hash table in which collisions
are resolved by chaining, what is the expected time for an
unsuccessful search and a successful search under the assumption of
simple uniform hashing?
Answer: Option D
Submit Your Solution Below and Earn Points !
Submit Your Solution Below and Earn Points !
More Questions on This Topic :
Latest Videos
Latest Test Papers
Submit Solution