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
5224 Points
4230 Points
3748 Points
2986 Points
2356 Points
2298 Points
2142 Points
2008 Points
1654 Points
1628 Points
Gatecse
"If you leave the M. Tech course ...