Register

Recent questions tagged hashing

1 votes
1 answer
211
MadeEasy Test Series: Programming & DS - 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, 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 element...
User Avatar
3 votes
1 answer
213
ME -- Hashing
Suppose there are $11$ slots in a Hash Table. At an instant there are $5$ empty slots and a new element $x$ is inserted in Hash Table. What is the the probablity that new element fits without collision? I think it should be $\frac{5}{11}$ but answer given says ::: EDIT :: Actual question is
Suppose there are $11$ slots in a Hash Table. At an instant there are $5$ empty slots and a new element $x$ is inserted in Hash Table. What is the the probablity that new...
User Avatar
1 votes
1 answer
214
Hashing
How do i prove that : : : In hashing n items into a hash table with k locations, the expected number of collisions is $n - k + k( 1-\frac{1}{k})^n$ ??
How do i prove that : : : In hashing n items into a hash table with k locations, the expected number of collisions is $n - k + k( 1-\frac{1}{k})^n$ ??
User Avatar
7 votes
1 answer
215
GATE CSE 1990 | Question: 13b
Consider a hash table with chaining scheme for overflow handling: What is the worst-case timing complexity of inserting $n$ elements into such a table? For what type of instance does this hashing scheme take the worst-case time for insertion?
Consider a hash table with chaining scheme for overflow handling:What is the worst-case timing complexity of inserting $n$ elements into such a table?For what type of ins...
User Avatar
0 votes
0 answers
216
What do you interpret from question?
It took me hell a lot of time. Still cann't figure out question??
It took me hell a lot of time. Still cann't figure out question??
User Avatar
0 votes
1 answer
217
Hashing
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining). 1)What is the probability that the first slot of hash table will be empty?
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining).1)Wh...
User Avatar
0 votes
3 answers
219
Gate Computer Science FB group post
A hash table has space for 100 records .what is the probability of collision before it is 5% full?? a. 0.25 b. 0.10 c. 0.40 d. 0.20
A hash table has space for 100 records .what is the probability of collision before it is 5% full?? a. 0.25b. 0.10c. 0.40d. 0.20
User Avatar
1 votes
1 answer
220
MadeEasy Test Series: Programming & DS - Hashing
Hash table with 6 slots No of keys=8. Collisions are resolved by chaining. Expected no of non empty slots?
Hash table with 6 slotsNo of keys=8.Collisions are resolved by chaining.Expected no of non empty slots?
User Avatar
0 votes
0 answers
221
hashing
User Avatar
2 votes
4 answers
222
ME-Hashing
User Avatar
0 votes
1 answer
224
MADE EASY 2016 TEST SERIES
Given a hash table with 6 keys and 10 slots, with simple uniform hashing. If collisions are resolved by chaining then the probability that first slot ends up empty?
Given a hash table with 6 keys and 10 slots, with simple uniform hashing. If collisions are resolved by chaining then the probability that first slot ends up empty?
User Avatar
2 votes
1 answer
228
Hashing
User Avatar
1 votes
1 answer
233
UGC NET CSE | August 2016 | Part 3 | Question: 32
Consider a hash table of size $m = 10000$, and the hash function $h(K) = floor (m(KA \bmod 1))$ for $A = ( \sqrt{5} – 1)/2$. The key $123456$ is mapped to location ______. $46$ $41$ $43$ $48$
Consider a hash table of size $m = 10000$, and the hash function $h(K) = floor (m(KA \bmod 1))$ for $A = ( \sqrt{5} – 1)/2$. The key $123456$ is mapped to location ____...
User Avatar
1 votes
1 answer
235
Hashing
using Method : Fold shift , we can find key then what use of Fold shift in Hashing
using Method : Fold shift , we can find keythen what use of Fold shift in Hashing
User Avatar
0 votes
1 answer
236
made easy
what is the expected number of probs requires when inserting an element into an open address hash table with load factor x (assume uniform hashing) a 1/(1-x) b 1/(1+x) c 1/x d 2/(2-x)
what is the expected number of probs requires when inserting an element into an open address hash table with load factor x (assume uniform hashing)a 1/(1-x)b 1/(1+x)c 1/x...
User Avatar
0 votes
3 answers
237
UGC NET CSE | June 2010 | Part 2 | Question: 24
A chained hash table has an array size of $100$. What is the maximum number of entries that can be placed in the table ? $100$ $200$ $10000$ There is no upper limit
A chained hash table has an array size of $100$. What is the maximum number of entries that can be placed in the table ?$100$$200$$10000$There is no upper limit
User Avatar
0 votes
4 answers
239
UGC NET CSE | December 2010 | Part 2 | Question: 24
Linear probing suffers from a problem known as Secondary clustering Primary clustering Both (A) and (B) None of these
Linear probing suffers from a problem known asSecondary clusteringPrimary clusteringBoth (A) and (B)None of these
User Avatar
5 votes
3 answers
240
Hashing : Quadratic Probing
Keys $9,19,29,39,49,59,69$ are inserted into a hash Table of size $10$ $(0-9)$ using the hash function $H = k mod 10$ and Quadratic Probing is used for collision resolution. What is the index into which 59 will be inserted ? $a). 3$ $b). 6$ $c). 8$ $d). 5$
Keys $9,19,29,39,49,59,69$ are inserted into a hash Table of size $10$ $(0-9)$ using the hash function $H = k mod 10$ and Quadratic Probing is used for collision resoluti...
User Avatar
Page: