The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Search results for uniformhashing
+1
vote
1
answer
1
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?
asked
Mar 6, 2019
in
Algorithms
by
s_dr_13

285
views
hashing
datastructures
uniformhashing
probability
+12
votes
2
answers
2
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.
asked
Nov 2, 2016
in
Algorithms
by
agoh
Active

716
views
hashing
datastructures
algorithms
uniformhashing
+8
votes
3
answers
3
TIFR2016A4
There are $n$ balls $b_1, \dots ,b_n$ and $n$ boxes. Each ball is placed in box chosen independently and uniformly at random. We say that $(b_i, b_j)$ is a $\textit{colliding pair}$ if $i<j$, and $b_i$ and $b_j$ are placed in the same box. WHat is the expected number of $\textit{colliding pairs}$? $\frac{n1}{2}$ $0$ $1$ $\frac{n}{4}$ $\begin{pmatrix} n \\ 2 \end{pmatrix}$
asked
Dec 26, 2016
in
Others
by
jothee
Veteran

447
views
tifr2016
probability
uniformhashing
0
votes
0
answers
4
hashing
A) (1(N / K)) ^ r b) (1(K / N)) ^ r c) (1+(N / K)) ^ r1 d) (1(K / N)) ^ r1
asked
Dec 28, 2018
in
DS
by
Rahul_Rathod_

96
views
hashing
datastructures
probability
uniformhashing
0
votes
1
answer
5
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$)
asked
Dec 19, 2018
in
DS
by
Rajat Agrawal007

128
views
uniformhashing
+4
votes
4
answers
6
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
asked
Dec 3, 2017
in
DS
by
Shubham Kumar Gupta

223
views
hashing
datastructures
uniformhashing
+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.
asked
Aug 9, 2018
in
DS
by
hrcule

107
views
hashing
datastructures
uniformhashing
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?
asked
Mar 8, 2018
in
Programming
by
Parimal Paritosh

154
views
hashing
uniformhashing
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)
asked
Jan 20, 2018
in
Probability
by
MIRIYALA JEEVAN KUMA
Active

76
views
probability
combinatory
algorithms
uniformhashing
+1
vote
0
answers
10
Hash tables
if m! is used is in uniform hashing probe sequence , shouldn't ans be c)
asked
Jan 13, 2018
in
Programming
by
Pawan Kumar 2
Active

65
views
uniformhashing
+1
vote
1
answer
11
Hashing
The average number of probe required when inserting an element with load factor alpha (assume uniform hashing) 1 / 1alpha how? Please explain
asked
Oct 31, 2017
in
Algorithms
by
Shivi rao

202
views
hashing
uniformhashing
0
votes
1
answer
12
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
asked
Feb 8, 2017
in
DS
by
smartmeet
Active

1k
views
hashing
datastructures
chaining
uniformhashing
+1
vote
1
answer
13
MIT QUIZ
plz explain otherwise i ll memorize it..
asked
Nov 23, 2016
in
Algorithms
by
2018
Loyal

109
views
uniformhashing
+1
vote
1
answer
14
MIT QUIZ
asked
Nov 23, 2016
in
Algorithms
by
2018
Loyal

180
views
uniformhashing
+3
votes
1
answer
15
Hashing+Probaility
asked
Oct 8, 2016
in
DS
by
Rahul Jain25
Loyal

282
views
hashing
probability
uniformhashing
binomialdistribution
To see more, click for the
full list of questions
or
popular tags
.
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
GATE Overflow Test Series  GATE CSE 2021
IIT gandhinagar mtech cse2020
IIT Delhi Research Interview Shortlists out
IIT Gandhinagar interview experience
IIT Gandhinagar Interview 2020
Subjects
All categories
General Aptitude
(1.9k)
Engineering Mathematics
(8.2k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Search results for uniformhashing
Recent Blog Comments
Verification will automatically expire after 400...
My Verification is showing as "Not verified Yet"...
The point calculation formula is changed. We were...
Keep doing problems. Chances are high that you...
The price will be the same till June 30th.
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,215
questions
60,009
answers
201,233
comments
94,695
users