Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of elements, if we used simple uniform hashing?
http://gateoverflow.in/84285/madeeasy-testseries
4272 Points
2994 Points
2804 Points
2608 Points
2244 Points
1414 Points
1338 Points
1246 Points
1016 Points
Gatecse
UGC NET papers