1 votes 1 votes 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? DS made-easy-test-series data-structures hashing + – Vishal Goyal asked Dec 6, 2016 edited Mar 4, 2019 by akash.dinkar12 Vishal Goyal 670 views answer comment Share Follow See 1 comment See all 1 1 comment reply air1 commented Dec 31, 2016 reply Follow Share https://gateoverflow.in/84285/madeeasy-testseries 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes 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 See all 0 reply Please log in or register to add a comment.