retagged by
1,253 views
2 votes
2 votes

Let $| U | = m^{2}$ and consider hashing with chaining. For any hash function $h : U\rightarrow{ 1, 2, ......., m-1}, $ there exists a sequence of $m$ insertions that leads to a chain of length $:$

$(A) m-1$

$(B) m$

($C) m+1$

$(D)$ None.

i got (m-2)  max length .....option D

retagged by

1 Answer

1 votes
1 votes
The question is not assuming simple uniform hashing, so all keys might map to same location, hence chain could be of length m. So option b Seems correct
Answer:

Related questions

1 votes
1 votes
2 answers
1
0 votes
0 votes
1 answer
4
piyushkr asked Dec 23, 2015
2,430 views
If we are inserting an element in chaining(outside) hashing technique, then what will be the time complexity in best case, average case and Worst case.