Register

Recent questions tagged hashing

2 votes
1 answer
151
madeeeasy work book hashing
WHICH OF THE FOLLOWING IS THE BEST CHOICE AS $m$ IN THE HASH FUNCTION $h(k)=k \mod m$?? $61$ $701$ $81$ answer is given as $701$ but how??
WHICH OF THE FOLLOWING IS THE BEST CHOICE AS $m$ IN THE HASH FUNCTION $h(k)=k \mod m$??$61$$701$$81$answer is given as $701$ but how??
User Avatar
0 votes
0 answers
152
Gate_2019_Mock_Paper
Please explained in detail hashing question
Please explained in detail hashing question
User Avatar
0 votes
1 answer
153
Gate_2019_Mock_Paper
Please explained in detail
Please explained in detail
User Avatar
1 votes
1 answer
154
hashing
A hash table is used when number of keys actually stored it any point of time is small as compared to the number of possible keys. please explain this line with suitable example.
A hash table is used when number of keys actually stored it any point of time is small as compared to the number of possible keys.please explain this line with suitable e...
User Avatar
4 votes
2 answers
155
ISRO2018-36
A hash table with $10$ buckets with one slot pet per bucket is depicted here. The symbols, $S1$ to $S7$ ... $4$ $5$ $6$ $3$
A hash table with $10$ buckets with one slot pet per bucket is depicted here. The symbols, $S1$ to $S7$ are initially entered using a hashing function with linear probing...
User Avatar
0 votes
1 answer
156
Self doubt
Let |U| = $m^{2}$and consider hashing with chaining. For any hash function h : U → {1, 2, . . . , m − 1}, there exists a sequence of m insertions that leads to a chain of length m. Explain
Let |U| = $m^{2}$and consider hashing with chaining. For any hash function h : U → {1, 2, . . . , m − 1}, there exists a sequence of m insertions that leads to a cha...
User Avatar
0 votes
1 answer
158
Hashing
Can someone explain Secondary Clustering to me? The distance between two successive probes is quadratic. I get it, but how are clusters being formed?
Can someone explain Secondary Clustering to me? The distance between two successive probes is quadratic. I get it, but how are clusters being formed?
User Avatar
0 votes
1 answer
159
Uttrakhand Asst. Professor Exam-41
Which of the following is not used for hash function? Mid-square method Division method Folding method Probe method
Which of the following is not used for hash function?Mid-square methodDivision methodFolding methodProbe method
User Avatar
6 votes
0 answers
161
Hashing-MadeEasy
Please explain primary and secondary clustering in brief. I tend to forget their difference because their definitions seem quite similar to me. And also, which one is true? According to me it was S1 and S3 but given is S3 only.
Please explain primary and secondary clustering in brief. I tend to forget their difference because their definitions seem quite similar to me. And also, which one is tru...
User Avatar
5 votes
0 answers
164
hashing
Consider a hash table with 10 slots. Collisions are resolved using linear probing. The probability that if first 3 slots are unfilled and 4th insertions leads to a collisions
Consider a hash table with 10 slots. Collisions are resolved using linear probing. The probability that if first 3 slots are unfilled and 4th insertions leads to a collis...
User Avatar
2 votes
0 answers
165
hashing
User Avatar
5 votes
2 answers
167
Double hashing
How many probes takes place to insert a sequence of numbers: 14, 17, 25, 37, 34, 16, 26, into a hash table of size 11, using Double hashing, where h(x) = x mod 11, h2(x) = x mod 7 + 1 ? I am getting collision even after using h2(x) for 16 Please somebody can explain it? Given solution :
How many probes takes place to insert a sequence of numbers: 14, 17, 25, 37, 34, 16, 26, into a hash table of size 11, using Double hashing, where h(x) = x mod 11, h2(x) ...
User Avatar
1 votes
2 answers
168
ISRO-DEC2017-50
The characters of the string $\text{K R P C S N Y T J M}$ are inserted into a hash table of the size of size $10$ using a hash function $h(x)=(ord(x)-ord(A)+1)$ $mod$ $10$ If linear probing is used to resolve collisions, then the following insertion causes the collision $Y$ $C$ $M$ $P$
The characters of the string $\text{K R P C S N Y T J M}$ are inserted into a hash table of the size of size $10$ using a hash function$h(x)=(ord(x)-ord(A)+1)$ $mod$ $10$...
User Avatar
0 votes
1 answer
169
Made_easy Tst
i have done it like this..... (1/8)3+ 7/(8)3=8-2 .....how this is wrong...???
i have done it like this.....(1/8)3+ 7/(8)3=8-2 .....how this is wrong...???
User Avatar
0 votes
2 answers
171
MadeEasy Test Series: Algorithms - Hashing
S1 :- if load factor of hash table is less than 1 then there are no collision S2:- As the size of hash table increases, the number of collisions will decrease. True false?
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?
User Avatar
1 votes
1 answer
174
Book: GK Publication, Chapter: DS & Publication, Exercise -I Q:74
Que: When key values are real, a similar data representation might be produced by using a hashing function with? A. Mod B. Div C. Trunc D. Log N
Que: When key values are real, a similar data representation might be produced by using a hashing function with?A. ModB. DivC. TruncD. Log N
User Avatar
2 votes
1 answer
176
hashing
difference between unsuccessful and successful probe?
difference between unsuccessful and successful probe?
User Avatar
0 votes
0 answers
177
made easy test series
User Avatar
1 votes
0 answers
180
Hashing - Linear Probing
User Avatar
Page: