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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Search results for uniformhashing
0
votes
0
answers
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
in
Algorithms
by
s_dr_13
(
133
points)

96
views
hashing
datastructure
uniformhashing
probability
0
votes
0
answers
2
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_
(
415
points)

43
views
hashing
datastructure
probability
uniformhashing
0
votes
1
answer
3
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
Junior
(
561
points)

75
views
uniformhashing
+4
votes
4
answers
4
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
(
443
points)

179
views
hashing
datastructure
uniformhashing
+1
vote
0
answers
5
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
(
209
points)

71
views
hashing
datastructure
uniformhashing
probability
0
votes
1
answer
6
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
(
213
points)

105
views
hashing
uniformhashing
algorithms
+1
vote
0
answers
7
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
(
2.3k
points)

57
views
probability
permutationandcombination
algorithms
uniformhashing
+1
vote
0
answers
8
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
(
4.2k
points)

32
views
uniformhashing
+1
vote
1
answer
9
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
Junior
(
523
points)

167
views
hashing
uniformhashing
+6
votes
2
answers
10
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
(
97.7k
points)

346
views
tifr2016
probability
uniformhashing
0
votes
1
answer
11
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
(
4.8k
points)

947
views
hashing
datastructure
chaining
uniformhashing
+8
votes
1
answer
12
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
(
1.7k
points)

507
views
hashing
datastructure
algorithms
uniformhashing
+1
vote
1
answer
13
MIT QUIZ
plz explain otherwise i ll memorize it..
asked
Nov 23, 2016
in
Algorithms
by
2018
Loyal
(
6.7k
points)

91
views
uniformhashing
+1
vote
1
answer
14
MIT QUIZ
asked
Nov 23, 2016
in
Algorithms
by
2018
Loyal
(
6.7k
points)

159
views
uniformhashing
+2
votes
1
answer
15
Hashing+Probaility
asked
Oct 8, 2016
in
DS
by
Rahul Jain25
Boss
(
10.9k
points)

255
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
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
My journey from Wipro to an IISc student  GATE 2019
Follow @csegate
Search results for uniformhashing
Recent Blog Comments
@Anmol 300 books will be dispatched this month...
Dear Respected Sir, If I prebook now i.e.22...
Can you check your Spam too? Address confirmation...
yeah me too. I did not get the address...
49,811
questions
54,540
answers
188,429
comments
75,603
users