Register

Recent questions tagged hashing

1 votes
1 answer
181
Hashing
The average number of probe required when inserting an element with load factor alpha (assume uniform hashing) 1 / 1-alpha how? Please explain
The average number of probe required when inserting an element with load factor alpha (assume uniform hashing) 1 / 1-alpha how? Please explain
User Avatar
0 votes
0 answers
182
#Hashing
Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from 1 to 6. Which of the following locations will never be probed if a collision occurs at position 5? A). 4 B). 5 C). 8 D). 6
Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from 1 to 6. Which of the following locations will never be ...
User Avatar
1 votes
0 answers
183
quradratic probing
which is correct method for QP : 1) 2) H(k) = (H+ i^2)mod m
which is correct method for QP :1) 2) H(k) = (H+ i^2)mod m
User Avatar
1 votes
0 answers
185
MadeEasy Subject Test: Programming & DS - Hashing
https://gateoverflow.in/?qa=blob&qa_blobid=11318007552752576944 Answer given is : 40/121
https://gateoverflow.in/?qa=blob&qa_blobid=11318007552752576944Answer given is : 40/121
User Avatar
3 votes
1 answer
186
Uniform Hashing
Suppose we use hash function H(n) to hash n distinct element(keys) into an array T of length m. What is the expected number of colliding pairs of element, if we use simple uniform hashing?
Suppose we use hash function H(n) to hash n distinct element(keys) into an array T of length m. What is the expected number of colliding pairs of element, if we use simpl...
User Avatar
2 votes
1 answer
189
Hashing
Given the input sequence {11, 33, 43, 99, 34, 79, 19} and hash table of size 10 with the hash function h(k) = k mod 10. If hash table uses quadratic probing, the number of collisions occurred while mapping the given sequence is ______.
Given the input sequence {11, 33, 43, 99, 34, 79, 19} and hash table of size 10 with the hash function h(k) = k mod 10. If hash table uses quadratic probing, the number o...
User Avatar
2 votes
0 answers
192
MadeEasy Subject Test: Programming & DS - Hashing
what is the expected number of probs required when inserting an element into an open address hash table with load factor alpha(a), assume uniform hashing??
what is the expected number of probs required when inserting an element into an open address hash table with load factor alpha(a), assume uniform hashing??
User Avatar
0 votes
1 answer
193
Hashing
If h is any hashing function and is used to hash n keys into a table of size m, here n<=m, the expected number of collisions involving a particular key x is a) Less than 1 b) Less than n c) Less than m d) Less than n/2
If h is any hashing function and is used to hash n keys into a table of size m, here n<=m, the expected number of collisions involving a particular key x isa) Less than 1...
User Avatar
2 votes
1 answer
195
gatebook
someone explain
someone explain
User Avatar
0 votes
0 answers
196
Hashing Question
Why 4 is multiplied in part. In the solution.
Why 4 is multiplied in part. In the solution.
User Avatar
0 votes
1 answer
199
Hashing
A hash table of length 100 uses chaining.What is the probability that all the values are hashed into the same slot after 5 insertions?
A hash table of length 100 uses chaining.What is the probability that all the values are hashed into the same slot after 5 insertions?
User Avatar
3 votes
1 answer
200
quadratic probing collison loop count??
Given the input sequence {11,33,43,79,19} and hash table of size 10 with the hash function h(k)=k mod 10. If hash tables uses quadratic probing,the number of collisions occured while mapping the given sequence is?
Given the input sequence {11,33,43,79,19} and hash table of size 10 with the hash function h(k)=k mod 10. If hash tables uses quadratic probing,the number of collisions o...
User Avatar
3 votes
1 answer
201
Hashing
Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is _______ (upto 2 decimal place).
Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successfu...
User Avatar
4 votes
2 answers
202
MADE EASY TEST SERIES
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?
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...
User Avatar
4 votes
2 answers
203
Test by Bikram | Mock GATE | Test 1 | Question: 16
Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision? $0.123$ $0.145$ $0.800$ $0.750$
Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision?$0.123$$0.14...
User Avatar
1 votes
1 answer
205
DS :True / False
In hash function using linear probing to reduce collision, the number of probes required to insert an item is identical with number of probes needed to retrieve it. is it True/ False?
In hash function using linear probing to reduce collision, the number of probes required to insert an item is identical with number of probes needed to retrieve it.is it ...
User Avatar
0 votes
1 answer
208
Made Easy
User Avatar
Page: