Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Hashing
s_dr_13
asked
in
Algorithms
Mar 6, 2019
970
views
1
vote
1
vote
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?
hashing
data-structures
uniform-hashing
probability
s_dr_13
asked
in
Algorithms
Mar 6, 2019
by
s_dr_13
970
views
answer
comment
Follow
share this
share
2 Comments
by
srestha
commented
Mar 7, 2019
reply
Follow
share this
for successful search $\frac{2}{10}$
unsuccessful search $\frac{8}{10}$
0
0
by
MiNiPanda
commented
Mar 8, 2019
reply
Follow
share this
unsuccessful searches = 5
successful searches = 2 (approx)
1
1
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
10/8 ln 5 and 5 for successful and unsuccessful search respectively.
If X is load factor.
Successful search = $(1/X) log (1/(1-x))$
Unsuccessful search = $1/(1-x)$
smsubham
answered
Mar 7, 2020
by
smsubham
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Rahul_Rathod_
asked
in
DS
Dec 28, 2018
415
views
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
hashing
data-structures
probability
uniform-hashing
1
vote
1
vote
0
answers
2
hrcule
asked
in
DS
Aug 9, 2018
510
views
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
hashing
data-structures
uniform-hashing
probability
16
votes
16
votes
2
answers
3
agoh
asked
in
Algorithms
Nov 2, 2016
3,244
views
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.
agoh
asked
in
Algorithms
Nov 2, 2016
by
agoh
3.2k
views
hashing
data-structures
algorithms
uniform-hashing
3
votes
3
votes
1
answer
4
Rahul Jain25
asked
in
DS
Oct 8, 2016
772
views
Hashing+Probaility
Rahul Jain25
asked
in
DS
Oct 8, 2016
by
Rahul Jain25
772
views
hashing
probability
uniform-hashing
binomial-distribution
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy