Dark Mode

Recent questions tagged uniform-hashing

0 votes

1 answer

1

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. The expected number of probes in an unsuccessful search is at most $\frac{1}{1-\alpha}$. Inserting ... $\frac{1}{1-\alpha}$ $1+\frac{\alpha}{2}$ $\frac{1}{1+\alpha}$

Arjun asked in DS Feb 16

by Arjun

689 views

0 votes

1 answer

2

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)

tishhaagrawal asked in Programming in C Dec 16, 2023

by tishhaagrawal

304 views

19 votes

2 answers

3

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 odd keys and $h_{2}$ for the even keys. What is the expected number of keys in a slot? $\frac{m}{n}$ $\frac{n}{m}$ $\frac{2n}{m}$ $\frac{n}{2m}$

Arjun asked in Algorithms Feb 15, 2022

by Arjun

10.3k views

1 vote

1 answer

4

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?

s_dr_13 asked in Algorithms Mar 6, 2019

966 views

0 votes

0 answers

5

hashing
A) (1-(N / K)) ^ r b) (1-(K / N)) ^ r c) (1+(N / K)) ^ r-1 d) (1-(K / N)) ^ r-1

Rahul_Rathod_ asked in DS Dec 28, 2018

by Rahul_Rathod_

415 views

0 votes

1 answer

6

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$)

Rajat Agrawal007 asked in DS Dec 19, 2018

by Rajat Agrawal007

692 views

1 vote

2 answers

7

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 various other keys not equal to k. Assuming simple uniform hashing, what is the probability that one of the r searches probes the slot containing the single element stored in the table?

Somoshree Datta 5 asked in Algorithms Oct 4, 2018

by Somoshree Datta 5

1.2k views

0 votes

1 answer

8

Nancy Pareta asked in Algorithms Aug 15, 2018

by Nancy Pareta

440 views

1 vote

0 answers

9

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.

hrcule asked in DS Aug 9, 2018

by hrcule

510 views

0 votes

1 answer

10

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?

Parimal Paritosh asked in Programming in C Mar 8, 2018

by Parimal Paritosh

793 views

1 vote

0 answers

11

atleast a chain of 3 in hashing
Consider a hash table with 8 slots that uses chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted, atleast a chain of size 3 is created? (assume simple uniform hashing is used)

MIRIYALA JEEVAN KUMA asked in Probability Jan 20, 2018

by MIRIYALA JEEVAN KUMA

293 views

1 vote

0 answers

12

Hash tables
if m! is used is in uniform hashing probe sequence , shouldn't ans be c)

Pawan Kumar 2 asked in Programming in C Jan 13, 2018

by Pawan Kumar 2

255 views

4 votes

4 answers

13

Hashing
Suppose you insert three keys into a hash table with m slots. Assuming the simple uniform hashing assumption, and given that collisions are resolved by chaining, what is the probability that both slots 0 and 1 are empty? (A) (m−2) /(m−1) (B) (m−2) /m (C) ((m−2) /m )3 (D) None

Shubham Kumar Gupta asked in DS Dec 3, 2017

by Shubham Kumar Gupta

1.6k views

1 vote

1 answer

14

Hashing
The average number of probe required when inserting an element with load factor alpha (assume uniform hashing) 1 / 1-alpha how? Please explain

Shivi rao asked in Algorithms Oct 31, 2017

885 views

2 votes

3 answers

15

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

A_i_$_h asked in Algorithms Sep 18, 2017

3.4k views

0 votes

1 answer

16

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

smartmeet asked in DS Feb 8, 2017

4.5k views

1 vote

1 answer

17

ME Full Syllabus Test 1
consider a hash table with 8 slots that uses chaining for collision resolution.The table is initially empty. What is the probability that after 4 keys are inserted, atleast a chain of size 3 is created?(assume simple uniform hashing is used) a. 29*8-3 b.8-4 c 8-3 d 3*8-1

Vasu_gate2017 asked in Algorithms Jan 23, 2017

by Vasu_gate2017

751 views

Page:

Recent questions tagged uniform-hashing