1 1 vote 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? Data Structures made-easy-test-series data-structures hashing + – Vishal Goyal 1.2k views answer comment Share Follow Print See 1 comment 1 1 comment reply air1 commented Dec 31, 2016 reply Follow flag https://gateoverflow.in/84285/madeeasy-testseries 0 0 replyShare Please log in or register to add a comment.
Best answer 1 1 vote There are nC2 pairs that may collide with probability each=1/m i.e. (n2-n)/2m which is theta option C. utk0203 answered Dec 22, 2016 • selected Jul 8, 2017 by Vishal Goyal utk0203 comment Share Follow 0 reply Please log in or register to add a comment.
