Register

Recent questions tagged uniform-hashing

3 3 votes
1 1 answer
174
174 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...
User Avatar
2 2 votes
1 1 answer
155
155 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...
User Avatar
1 1 vote
0 0 answers
388
388 views
question from ai source chatgpt here my doubt is how to deal with probability in hashing concept
Consider a hash table with 365 slots (same as the number of days in a year). Assuming uniform hashing, what is the maximum number of keys (n) that can be inserted before ...
User Avatar
34 34 votes
7 answers 7 answers
10.9k
10.9k views
GATE DS&AI 2024 | Question: 11
​​​​​​Consider performing uniform hashing on an open address hash table with load factor $\alpha=\frac{n}{m}<1$, where $n$ elements are stored in the table with $m$ slots...
User Avatar
0 0 votes
2 2 answers
1.2k
1.2k 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...
User Avatar
53 53 votes
7 answers 7 answers
23.8k
23.8k views
GATE CSE 2022 | Question: 6
​​​Suppose we are given $n$ keys, $m$ hash table slots, and two simple uniform hash functions $h_{1}$ and $h_{2}.$ Further suppose our hashing scheme uses $h_{1}$ for the...
User Avatar
1 1 vote
1 1 answer
1.4k
1.4k views
Hashing
Consider an open address hash table with uniform hashing. Out of 10 locations, 8 are occupied. What are the expected number of probes in an unsuccessful and successful se...
User Avatar
0 0 votes
0 0 answers
682
682 views
hashing
A) (1-(N / K)) ^ r b) (1-(K / N)) ^ r c) (1+(N / K)) ^ r-1 d) (1-(K / N)) ^ r-1
User Avatar
0 0 votes
1 answers 1 answer
1.5k
1.5k views
Testbook
Consider an open address hash table with uniform hashing. What is the time complexity of sucessfull search ?(A)O($\alpha$$^{2}$)(B)O($\alpha$)(C)O(1-$\alpha$)(D)O(1/1-$\a...
User Avatar
3 3 votes
2 2 answers
2.6k
2.6k views
Test series
Suppose that a hash table of m slots contains a single element with key k and the rest of the slots are empty. Suppose further that we search r times in the table for var...
User Avatar
Page: