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
Recent questions tagged uniform-hashing
7
votes
1
answer
1
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
by
Arjun
3.1k
views
gatecse-2022
algorithms
hashing
uniform-hashing
1-mark
1
vote
1
answer
2
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
by
s_dr_13
768
views
hashing
data-structures
uniform-hashing
probability
0
votes
0
answers
3
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_
264
views
hashing
data-structures
probability
uniform-hashing
0
votes
1
answer
4
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
406
views
uniform-hashing
1
vote
2
answers
5
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
772
views
test-series
hashing
uniform-hashing
probability
0
votes
1
answer
6
#testseries
Nancy Pareta
asked
in
Algorithms
Aug 15, 2018
by
Nancy Pareta
233
views
test-series
uniform-hashing
time-complexity
1
vote
0
answers
7
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
342
views
hashing
data-structures
uniform-hashing
probability
0
votes
1
answer
8
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
Mar 8, 2018
by
Parimal Paritosh
637
views
hashing
uniform-hashing
algorithms
1
vote
0
answers
9
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
204
views
probability
combinatory
algorithms
uniform-hashing
1
vote
0
answers
10
Hash tables
if m! is used is in uniform hashing probe sequence , shouldn't ans be c)
Pawan Kumar 2
asked
in
Programming
Jan 13, 2018
by
Pawan Kumar 2
163
views
uniform-hashing
4
votes
4
answers
11
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.3k
views
hashing
data-structures
uniform-hashing
1
vote
1
answer
12
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
by
Shivi rao
652
views
hashing
uniform-hashing
2
votes
3
answers
13
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
by
A_i_$_h
2.6k
views
uniform-hashing
0
votes
1
answer
14
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
by
smartmeet
3.4k
views
hashing
data-structures
chaining
uniform-hashing
1
vote
1
answer
15
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
349
views
hashing
uniform-hashing
made-easy-test-series
1
vote
1
answer
16
MIT QUIZ
plz explain otherwise i ll memorize it..
2018
asked
in
Algorithms
Nov 23, 2016
by
2018
261
views
uniform-hashing
mit-quiz
1
vote
1
answer
17
MIT QUIZ
2018
asked
in
Algorithms
Nov 23, 2016
by
2018
320
views
uniform-hashing
mit-quiz
15
votes
2
answers
18
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
2.4k
views
hashing
data-structures
algorithms
uniform-hashing
2
votes
1
answer
19
Topic-Hashing, Made Easy Test Series problem . Please explain and concept also.
Please explain also--
Devwritt
asked
in
Algorithms
Oct 27, 2016
by
Devwritt
255
views
made-easy-test-series
uniform-hashing
0
votes
1
answer
20
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?
Anshul_S
asked
in
Algorithms
Oct 26, 2016
by
Anshul_S
285
views
algorithms
hashing
uniform-hashing
numerical-answers
made-easy-test-series
Page:
1
2
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged uniform-hashing
Recent Blog Comments
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...