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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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
Recent questions tagged hashing
0
votes
0
answers
1
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
in
DS
by
hrcule
(
251
points)

14
views
hashing
datastructure
uniformhashing
probability
0
votes
1
answer
2
Hash Function
Which of the following is the least suitable hash function H(x) where X is some non negative integer ? 1. h(k) =k%n 2.h(k) =k*k %n 3.h(k)=(gcd(k+1,2k+2) +k ) %n Linear probing is used for collision resolution .
asked
Aug 4
in
DS
by
ashwina
Active
(
2k
points)

49
views
hashing
datastructure
+1
vote
0
answers
3
Hashing
What is the difference between hashing and addressing? Because the definition of open addressing and closed hashing seems to be the same.
asked
Aug 2
in
Databases
by
Asutosh
(
359
points)

13
views
hashing
datastructure
+1
vote
1
answer
4
CLRS 11.26
Suppose we have stored n keys in a hash table of size m, with collisions resolved by chaining, and that we know the length of each chain, including the length L of the longest chain. Describe a procedure that selects a key uniformly at random from among the keys in the hash table and returns it in expected time O(L * (1 + m/n)).
asked
Jul 11
in
Algorithms
by
mohitjarvissharma
(
351
points)

42
views
algorithms
hashing
chaining
+1
vote
1
answer
5
madeeeasy work book hashing
WHICH OF THE FOLLOWING IS THE BEST CHOICE AS $m$ IN THE HASH FUNCTION $h(k)=k \mod m$?? $61$ $701$ $81$ answer is given as $701$ but how??
asked
Jun 17
in
Programming
by
eyeamgj
Active
(
3.4k
points)

91
views
datastructure
hashing
0
votes
0
answers
6
Gate_2019_Mock_Paper
Please explained in detail hashing question
asked
Jun 7
in
Algorithms
by
Harikesh Kumar
Active
(
1.4k
points)

61
views
algorithms
datastructure
hashing
0
votes
1
answer
7
Gate_2019_Mock_Paper
Please explained in detail
asked
Jun 7
in
Algorithms
by
Harikesh Kumar
Active
(
1.4k
points)

42
views
algorithms
datastructure
hashing
+1
vote
1
answer
8
hashing
A hash table is used when number of keys actually stored it any point of time is small as compared to the number of possible keys. please explain this line with suitable example.
asked
May 5
in
Programming
by
once_2019
(
297
points)

66
views
hashing
datastructure
0
votes
0
answers
9
compile design question from runtime environment
asked
Apr 16
in
Compiler Design
by
Ronish Jariwala 1
(
87
points)

51
views
runtimeenvironments
compilerdesign
hashing
trees
0
votes
0
answers
10
compile design from university paper
asked
Apr 15
in
Compiler Design
by
Ronish Jariwala 1
(
87
points)

27
views
compile
compilerdesign
hashing
tree
0
votes
1
answer
11
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
in
Programming
by
Parimal Paritosh
(
213
points)

78
views
hashing
uniformhashing
algorithms
0
votes
1
answer
12
Uttrakhand Asst. Professor Exam41
Which of the following is not used for hash function? Midsquare method Division method Folding method Probe method
asked
Mar 2
in
Others
by
gatecse
Boss
(
18.1k
points)

37
views
uttarakhandasstprof2018
datastructure
hashing
+1
vote
0
answers
13
Hash Table and IPv6
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = kmod 10 and linear probing. The number of different insertion sequence of the key values using the given hash function and linear ... send the packet from source to destination with minimum number of hops. D) both b and c. I think it is B).
asked
Jan 22
in
Programming
by
Shubhanshu
Boss
(
15.1k
points)

160
views
hashing
datastructure
chaining
computernetworks
ipv6
+3
votes
0
answers
14
HashingMadeEasy
Please explain primary and secondary clustering in brief. I tend to forget their difference because their definitions seem quite similar to me. And also, which one is true? According to me it was S1 and S3 but given is S3 only.
asked
Jan 21
in
Algorithms
by
MiNiPanda
Loyal
(
8.3k
points)

171
views
algorithms
datastructure
hashing
+2
votes
0
answers
15
made easy test series
asked
Jan 18
in
DS
by
Abhishek Kumar Singh
Junior
(
949
points)

95
views
hashing
madeeasytestseries
+1
vote
0
answers
16
Made Easy Full Test  Hashing + Probability
asked
Jan 18
in
Probability
by
Akash Mishra
Junior
(
999
points)

167
views
hashing
datastructure
probability
conditionalprobability
+4
votes
0
answers
17
hashing
Consider a hash table with 10 slots. Collisions are resolved using linear probing. The probability that if first 3 slots are unfilled and 4th insertions leads to a collisions
asked
Jan 17
in
DS
by
rajoramanoj
Active
(
4.3k
points)

132
views
hashing
probability
+2
votes
0
answers
18
hashing
asked
Jan 15
in
Programming
by
pranab ray
Junior
(
895
points)

37
views
datastructure
hashing
+7
votes
4
answers
19
Hashing (Test Series)
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = k mod 10 and linear probing. 0 1 91 2 2 3 13 4 24 5 12 6 62 7 77 8 82 9 The number of different insertion sequence of the key values using the given hash function and linear probing will result in the hash table shown in above __________.
asked
Jan 1
in
DS
by
VS
Loyal
(
8.9k
points)

602
views
hashing
+2
votes
0
answers
20
Double hashing
How many probes takes place to insert a sequence of numbers: 14, 17, 25, 37, 34, 16, 26, into a hash table of size 11, using Double hashing, where h(x) = x mod 11, h2(x) = x mod 7 + 1 ? I am getting collision even after using h2(x) for 16 Please somebody can explain it? Given solution :
asked
Dec 30, 2017
in
DS
by
sunil sarode
Active
(
1.3k
points)

228
views
hashing
datastructure
+1
vote
1
answer
21
ISRODEC201750
The characters of the string $\text{K R P C S N Y T J M}$ are inserted into a hash table of size of size $10$ using hash function $h(x)=(ord(x)ord(A)+1)$ If linear probing is used to resolve collisions, then the following insertion causes collision $Y$ $C$ $M$ $P$
asked
Dec 17, 2017
in
Algorithms
by
gatecse
Boss
(
18.1k
points)

699
views
isrodec2017
hashing
0
votes
0
answers
22
Algorithms: Test Series(Hashing)
Consider an initially empty symbol table implemented using a hash table of size ‘B’ with hash function h(C) = C mod B. In worst case for any possible sequence of inputs where N > B, what is the order of growth of inserting N (key, value) pairs with distinct key into table, if separate chaining is used to resolve collisions? A Ο(N) B Ο (N log N) C Ο(N3) D Ο(N2)
asked
Dec 8, 2017
in
Algorithms
by
rahul sharma 5
Boss
(
24.5k
points)

155
views
algorithms
hashing
+4
votes
1
answer
23
Hashing
Consider the following keys that are hashed into the hash table in the order given using the hash function Where to handle the collision chaining is used, after inserting all the above keys in table if 2 new keys inserted into table the what is the probability new items hashed into empty slot ? ................... ... ............................................... I am getting 5/11 * 4/11.
asked
Dec 3, 2017
in
Programming
by
junaid ahmad
Loyal
(
9k
points)

302
views
hashing
+4
votes
3
answers
24
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
Junior
(
547
points)

115
views
hashing
datastructure
uniformhashing
+1
vote
1
answer
25
Book: GK Publication, Chapter: DS & Publication, Exercise I Q:74
asked
Dec 1, 2017
in
Algorithms
by
samsaurabh
(
83
points)

61
views
hashing
0
votes
0
answers
26
made easy test series
asked
Nov 27, 2017
in
DS
by
charul
Active
(
1.3k
points)

133
views
madeeasytestseries
datastructure
hashing
+1
vote
1
answer
27
hashing
difference between unsuccessful and successful probe?
asked
Nov 21, 2017
in
DS
by
nikkey123
Active
(
1.5k
points)

100
views
hashing
datastructure
2017
0
votes
0
answers
28
made easy test series
asked
Nov 19, 2017
in
DS
by
chandra sai
Active
(
1.2k
points)

76
views
hashing
datastructure
0
votes
1
answer
29
Probability of collision
A hash table has spaces for 100 records. Then the probability of collision before the table is 10% full,is a. 0.45 b. 0.5 c. 0.3 d. 0.34(approx)
asked
Nov 18, 2017
in
Algorithms
by
student2018
Active
(
1.1k
points)

204
views
algorithms
hashing
0
votes
1
answer
30
Gate academy
Suppose that we have a hash table with n slots with collisions resolved by chaining. Suppose that n keys are inserted into the table What is the probability of k keys being mapped to a single slot. Each key is equally likely to be hashed to each slot. Find the probability P(k) that exactly k keys hash into ... 1 1/n)^(nk) * nCk (C) (1/k)^k * (11/k)^(nk) * nCk (D) None of the above
asked
Nov 17, 2017
in
Programming
by
Saikat Dutta
(
261
points)

95
views
hashing
Page:
1
2
3
4
5
next »
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
Schedule for GATE 2019
GATE 2019 official website
Correct way of preparation
Right process to start solving MCQs in Comp.Sc.
UGC NET JULY 2018 Results
Follow @csegate
Gatecse
Recent questions tagged hashing
Recent Blog Comments
Books are there but don't think any will leave ...
Sir i have placed the order Details are PAYMENT ...
Sir i am placing order for gate overflew book ...
Yes, their tracking system is incomplete. ...
India post don't update the tracking details. No ...
38,084
questions
45,574
answers
132,084
comments
49,063
users