Register

Hash tables
closed

• closed by
521 views
Voting & Accepting an answer helps improve the community
← Previous · StackNext → · Test series
← Previous in category · StackNext in category → · Test series
Position:
Show:

Related questions

0 0 votes
2 2 answers
1.2k
1.2k views
tishhaagrawal asked Dec 16, 2023
1,163 views
Made Easy Test Series : Consider an open addressing hashing scheme with m slots and n keys. Assuming uniform hashing, the expected number of empty slots in the hash table for m=7 and n=3 is equal to ____________(Round off to two decimal places)
Below is my approach to solve 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\leqslant...
0 0 votes
1 1 answer
1.2k
1.2k views
Parimal Paritosh asked Mar 8, 2018
1,209 views
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?
3 3 votes
1 1 answer
193
193 views
GO Classes asked Jul 16
193 views
GO Classes DPP | GATE CS, DA | Data Structure | Expected Non-Empty Slots
A hash table has $m$ slots and stores $n$ keys. Assume simple uniform hashing. Collisions are resolved by chaining.What is the expected number of slots that end up non-em...
2 2 votes
1 1 answer
179
179 views
GO Classes asked Jul 16
179 views
GO Classes DPP | GATE CS, DA | Data Structure | Uniform Hashing
A hash table has $m$ slots and stores $n$ keys. Assume simple uniform hashing, so each key is equally likely to hash into any slot, independently of other keys. Collision...