Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged uniform-hashing
1
votes
1
answer
31
MIT QUIZ
plz explain otherwise i ll memorize it..
plz explain otherwise i ll memorize it..
2018
410
views
2018
asked
Nov 23, 2016
Algorithms
uniform-hashing
mit-quiz
+
–
1
votes
1
answer
32
MIT QUIZ
2018
595
views
2018
asked
Nov 23, 2016
Algorithms
uniform-hashing
mit-quiz
+
–
16
votes
2
answers
33
Hashing
Using open addressing with linear probing, we sequentially insert three distinct keys k1, k2 and k3 into a hash table of size m. Assuming simple uniform hashing, what is the probability that we will need three probes, when inserting the third key, k3? 3/m 2/m2 3/m2 2/m Please explain the solution.
Using open addressing with linear probing, we sequentially insert three distinct keys k1, k2 and k3 into a hash table of size m. Assuming simple uniform hashing, what is ...
agoh
3.3k
views
agoh
asked
Nov 2, 2016
Algorithms
hashing
data-structures
algorithms
uniform-hashing
+
–
2
votes
1
answer
34
Topic-Hashing, Made Easy Test Series problem . Please explain and concept also.
Please explain also--
Please explain also
Devwritt
468
views
Devwritt
asked
Oct 27, 2016
Algorithms
made-easy-test-series
uniform-hashing
+
–
0
votes
1
answer
35
MADE EASY 2016 TEST SERIES
Given a hash table with 6 keys and 10 slots, with simple uniform hashing. If collisions are resolved by chaining then the probability that first slot ends up empty?
Given a hash table with 6 keys and 10 slots, with simple uniform hashing. If collisions are resolved by chaining then the probability that first slot ends up empty?
Anshul_S
483
views
Anshul_S
asked
Oct 26, 2016
Algorithms
algorithms
hashing
uniform-hashing
numerical-answers
made-easy-test-series
+
–
3
votes
1
answer
36
Hashing+Probaility
Rahul Jain25
801
views
Rahul Jain25
asked
Oct 8, 2016
DS
hashing
probability
uniform-hashing
binomial-distribution
+
–
0
votes
1
answer
37
made easy
what is the expected number of probs requires when inserting an element into an open address hash table with load factor x (assume uniform hashing) a 1/(1-x) b 1/(1+x) c 1/x d 2/(2-x)
what is the expected number of probs requires when inserting an element into an open address hash table with load factor x (assume uniform hashing)a 1/(1-x)b 1/(1+x)c 1/x...
qwertyui
449
views
qwertyui
asked
Sep 24, 2016
Algorithms
hashing
uniform-hashing
made-easy-test-series
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register