Register

Search results for uniform-hashing

0 votes
1 answer
3
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 solving 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\leqsla...
User Avatar
1 votes
1 answer
6
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 search respectively?
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
2 votes
3 answers
7
hashing
What is the average number of probe required when inserting an element with load factor alpha (assume uniform hashing) a) 1 / 1-alpha b) 1/1+alpha c)1/alpha d)2/2-alpha
What is the average number of probe required when inserting an element with load factor alpha (assume uniform hashing)a) 1 / 1-alphab) 1/1+alphac)1/alphad)2/2-alpha
User Avatar
0 votes
1 answer
9
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-$\alpha$)
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
0 votes
0 answers
10
hashing
A) (1-(N / K)) ^ r b) (1-(K / N)) ^ r c) (1+(N / K)) ^ r-1 d) (1-(K / N)) ^ r-1
A) (1-(N / K)) ^ r b) (1-(K / N)) ^ r c) (1+(N / K)) ^ r-1 d) (1-(K / N)) ^ r-1
User Avatar
1 votes
0 answers
11
Hashing
Suppose we used a hash fu action H(n) to hash n distinct elements (key) into an array T of length m. What is expected number of collision, if simple uniform hashing is used.
Suppose we used a hash fu action H(n) to hash n distinct elements (key) into an array T of length m. What is expected number of collision, if simple uniform hashing is us...
User Avatar
0 votes
1 answer
12
#testseries
User Avatar
0 votes
1 answer
13
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
1 votes
0 answers
15
Hash tables
if m! is used is in uniform hashing probe sequence , shouldn't ans be c)
if m! is used is in uniform hashing probe sequence , shouldn't ans be c)
User Avatar
1 votes
1 answer
16
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
1 answer
17
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
1 votes
1 answer
19
MIT QUIZ
plz explain otherwise i ll memorize it..
plz explain otherwise i ll memorize it..
User Avatar
1 votes
1 answer
20
MIT QUIZ
User Avatar
Page: