Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for hashing-probability
62
votes
11
answers
1
GATE IT 2007 | Question: 28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collide...
Ishrat Jahan
28.9k
views
Ishrat Jahan
asked
Oct 29, 2014
DS
gateit-2007
data-structures
hashing
probability
normal
+
–
14
votes
3
answers
2
Hash table
A Hash table has space for 100 records. Then the probability of collision before the table is 10% full is? A 0.45 B 0.5 C 0.3 D 0.34 (approximately)
A Hash table has space for 100 records. Then the probability of collision before the table is 10% full is?A 0.45B 0.5C 0.3D 0.34 (approximately)
Soumyashree
15.4k
views
Soumyashree
asked
Nov 21, 2015
Algorithms
hashing
probability
+
–
0
votes
1
answer
3
Kotidis I., First Exercise Pack 2021-2022.
Consider an extendible hash index, each bucket of which holds N entries. What is the probability that an overflowed bucket needs to be dealt with recursively? “Dealt with recursively” means that all of this bucket’s records are moved to one of the two new buckets that will be created.
Consider an extendible hash index, each bucket of which holds N entries. What is the probability that an overflowed bucket needs to be dealt with recursively? “Dealt wi...
juli
303
views
juli
asked
Apr 2, 2023
Databases
databases
hashing
probability
+
–
49
votes
3
answers
4
GATE CSE 2014 Set 3 | Question: 40
Consider a hash table with $100$ slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first $3$ slots are unfilled after the first $3$ insertions? $(97 \times 97 \times 97) / 100^3$ $(99 \times 98 \times 97) / 100^3$ $(97 \times 96 \times 95) / 100^3$ $(97 \times 96 \times 95 / (3! \times 100^3)$
Consider a hash table with $100$ slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first $3$ slots are unfi...
go_editor
21.8k
views
go_editor
asked
Sep 28, 2014
DS
gatecse-2014-set3
data-structures
hashing
probability
normal
+
–
54
votes
6
answers
5
GATE CSE 1997 | Question: 12
Consider a hash table with $n$ buckets, where external (overflow) chaining is used to resolve collisions. The hash function is such that the probability that a key value is hashed to a particular bucket is $\frac{1}{n}$. The hash table is initially ... in any of the $K$ insertions? What is the probability that the first collision occurs at the $K^{th}$ insertion?
Consider a hash table with $n$ buckets, where external (overflow) chaining is used to resolve collisions. The hash function is such that the probability that a key value ...
Kathleen
10.4k
views
Kathleen
asked
Sep 29, 2014
DS
gate1997
data-structures
hashing
probability
normal
descriptive
+
–
0
votes
1
answer
6
MadeEasy Test Series: Programming & DS - Hashing
Consider the following keys that are hashed into the hash table in the order given using the hash function H(i) = (3i+5)mod11. 12,44,13,88,23,94,11,39,20,16,5 where to handle the collision chaining is used, after inserting ... in table if 2 new keys inserted into table, what is the probability new items hashed into empty slot?(upto 2 decimal places)
Consider the following keys that are hashed into the hash table in the order given using the hash function H(i) = (3i+5)mod11.12,44,13,88,23,94,11,39,20,16,5where to hand...
Ollie
618
views
Ollie
asked
Jan 11, 2019
DS
made-easy-test-series
hashing
probability
+
–
1
votes
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?
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...
Somoshree Datta 5
1.2k
views
Somoshree Datta 5
asked
Oct 4, 2018
Algorithms
test-series
hashing
uniform-hashing
probability
+
–
1
votes
1
answer
8
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...
s_dr_13
959
views
s_dr_13
asked
Mar 6, 2019
Algorithms
hashing
data-structures
uniform-hashing
probability
+
–
0
votes
1
answer
9
Made Easy Test Series:Algorithm-Mathematical Solution
Consider a hash table with $n$ slots that uses chaining for collision resolution, table is initially empty. What is the probability that after $4$ keys are inserted then atleast a chain of size $3$ is created, when the value of $n=9$___________ They have done ... $3??$ Plz chk it
Consider a hash table with $n$ slots that uses chaining for collision resolution, table is initially empty. What is the probability that after $4$ keys are inserted then ...
srestha
387
views
srestha
asked
May 8, 2019
Algorithms
made-easy-test-series
algorithms
hashing
probability
+
–
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
Rahul_Rathod_
413
views
Rahul_Rathod_
asked
Dec 28, 2018
DS
hashing
data-structures
probability
uniform-hashing
+
–
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...
hrcule
500
views
hrcule
asked
Aug 9, 2018
DS
hashing
data-structures
uniform-hashing
probability
+
–
4
votes
0
answers
12
Made Easy Full Test - Hashing + Probability
Question - Consider a hash table with 8 slots that use chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted, at least a chain of size 3 is created? (assume simple uniform hashing is used) Correct answer - $29*8^{^{-3}}$ My answer - $8*8^{^{-3}}$
Question - Consider a hash table with 8 slots that use chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inse...
Akash Mishra
1.1k
views
Akash Mishra
asked
Jan 18, 2018
Probability
hashing
data-structures
probability
conditional-probability
+
–
5
votes
0
answers
13
hashing
Consider a hash table with 10 slots. Collisions are resolved using linear probing. The probability that if first 3 slots are unfilled and 4th insertions leads to a collisions
Consider a hash table with 10 slots. Collisions are resolved using linear probing. The probability that if first 3 slots are unfilled and 4th insertions leads to a collis...
rajoramanoj
706
views
rajoramanoj
asked
Jan 17, 2018
DS
hashing
probability
+
–
1
votes
0
answers
14
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)
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, atle...
MIRIYALA JEEVAN KUMA
289
views
MIRIYALA JEEVAN KUMA
asked
Jan 20, 2018
Probability
probability
combinatory
algorithms
uniform-hashing
+
–
0
votes
1
answer
15
Made_easy Tst
i have done it like this..... (1/8)3+ 7/(8)3=8-2 .....how this is wrong...???
i have done it like this.....(1/8)3+ 7/(8)3=8-2 .....how this is wrong...???
hs_yadav
369
views
hs_yadav
asked
Dec 16, 2017
Algorithms
made-easy-test-series
hashing
probability
+
–
0
votes
1
answer
16
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? 2)What is the expected number of slots that are being nonempty?
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...
Rohan Mundhey
1.7k
views
Rohan Mundhey
asked
Nov 9, 2016
Algorithms
hashing
chaining
probability
descriptive
+
–
0
votes
1
answer
17
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...
Rohan Mundhey
671
views
Rohan Mundhey
asked
Nov 9, 2016
Algorithms
hashing
probability
data-structures
+
–
3
votes
1
answer
18
Hashing+Probaility
Rahul Jain25
760
views
Rahul Jain25
asked
Oct 8, 2016
DS
hashing
probability
uniform-hashing
binomial-distribution
+
–
2
votes
1
answer
19
Hashing
Rahul Jain25
579
views
Rahul Jain25
asked
Oct 8, 2016
DS
algorithms
hashing
data-structures
probability
+
–
0
votes
1
answer
20
hashing
A hash table can store a maximum of 10 records.Currently there are records in locations 1,3,4,7,8,9,10.The probability of a new record going into location 2,with a hash function resolving collisions by linear probing is?
A hash table can store a maximum of 10 records.Currently there are records in locations 1,3,4,7,8,9,10.The probability of a new record going into location 2,with a hash f...
neha singh
3.1k
views
neha singh
asked
Mar 11, 2016
Algorithms
algorithms
hashing
probability
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register