closed by
201 views
0 votes
0 votes
closed as a duplicate of: Madeeasy TestSeries

Suppose we used 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 use simple uniform hashing?

a) theta(n2)

b)theta(m2)

c)theta(n2/m)

d)theta(n3/m2)

answer given is c, also some explanation is provided by them but I couldn't understand. please someone give and easy solution to this problem.

closed by

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
1 answer
2
tishhaagrawal asked Dec 16, 2023
309 views
Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...
0 votes
0 votes
1 answer
4
jugnu1337 asked Oct 22, 2023
333 views
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 9 nodes and 12 edges. The diagonal entries of $A^{T}.A$give the number of edges into eac...