Register

question

• edited by
2,523 views
0 0 votes

स Q. 4 Let H be a finite collection of hash functions that map a universe $U$ of keys into $\{0,1$, $\qquad$ m -1). H is said to be universal if for each pair of distinct keys, $k$ and $I \in U$, the number of hash functions $h \in H$ for which $h(k)=n(l)$ is at most.

  1. $|\mathrm{H}| / \mathrm{m}^{2}$
  2. $\frac{1}{m^{2} \log m}$
  3. $\mathrm{H} / \mathrm{m}^{2}$
  4. $|\mathrm{H}| / \mathrm{m}$

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · DeadlockNext → · Regular Languages
← Previous in category · question:Next in category → · Answer the following...
Position:
Show:

Related questions

61 61 votes
5 answers 5 answers
25.3k
25.3k views
Arjun asked Feb 12, 2020
25,341 views
GATE CSE 2020 | Question: 23
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Ass...
0 0 votes
1 1 answer
708
708 views
Harikesh Kumar asked Jun 7, 2018
708 views
Gate_2019_Mock_Paper
Please explained in detailLTE$18 \%$9:40 PMGATE 2019 : Daily Subje...Given a hash table $T$ with 25 slots that stores 2000 elements, the load factor a for T is $\qquad$ ....
0 0 votes
2 2 answers
2.5k
2.5k views
rahul sharma 5 asked Dec 4, 2017
2,476 views
MadeEasy Test Series: Algorithms - Hashing
S1 :- if load factor of hash table is less than 1 then there are no collisionS2:- As the size of hash table increases, the number of collisions will decrease.True false?
1 1 vote
1 answers 1 answer
847
847 views
rahul sharma 5 asked Dec 14, 2016
847 views
Algorithms Hashing
Consider the following keys that are hashed into table in the order given using hash function\[\begin{array}{l}h(i)=(2 i+5) \text { mod11 } \\12,44,13,88,23,94,11,39,20,1...