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.
Recent questions tagged hashing
0
votes
0
answers
1
compile design question from runtime environment
asked
4 days
ago
in
Compiler Design
by
Ronish Jariwala 1
(
87
points)

11
views
runtimeenvironments
compilerdesign
hashing
trees
0
votes
0
answers
2
compile design from university paper
asked
5 days
ago
in
Compiler Design
by
Ronish Jariwala 1
(
87
points)

14
views
compile
compilerdesign
hashing
tree
0
votes
1
answer
3
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
(
169
points)

64
views
hashing
uniformhashing
algorithms
0
votes
1
answer
4
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
(
17.8k
points)

19
views
uttarakhandasstprof2018
datastructure
hashing
+1
vote
0
answers
5
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
(
14.9k
points)

115
views
hashing
datastructure
chaining
computernetworks
ipv6
+3
votes
0
answers
6
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
(
5.8k
points)

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

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

110
views
hashing
datastructure
probability
conditionalprobability
+3
votes
0
answers
9
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)

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

25
views
datastructure
hashing
+6
votes
3
answers
11
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
(
7.5k
points)

439
views
hashing
+2
votes
0
answers
12
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.1k
points)

142
views
hashing
datastructure
+1
vote
1
answer
13
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
(
17.8k
points)

498
views
isrodec2017
hashing
0
votes
0
answers
14
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
(
22.7k
points)

110
views
algorithms
hashing
+4
votes
1
answer
15
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
(
8.8k
points)

272
views
hashing
+4
votes
3
answers
16
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
(
513
points)

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

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

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

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

66
views
hashing
datastructure
0
votes
1
answer
21
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
(
1k
points)

135
views
algorithms
hashing
0
votes
1
answer
22
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
(
243
points)

65
views
hashing
+1
vote
0
answers
23
Hashing  Linear Probing
asked
Nov 9, 2017
in
Algorithms
by
ankitgupta.1729
Active
(
4.2k
points)

135
views
hashing
+1
vote
1
answer
24
data structure
In a hash table of size 6, currently the locations 0, 2, 4 and 5 are occupied. The probability of a new record going into location 1, with a hash function resolving collisions by linear probing is (assume uniform hashing). (A) 2/3 (B) 1/3 (C) 1 (D) 1/6
asked
Nov 9, 2017
in
Programming
by
Kaluti
Loyal
(
5.3k
points)

61
views
hashing
linear
probing
+1
vote
1
answer
25
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
(
775
points)

98
views
hashing
uniformhashing
0
votes
0
answers
26
#Hashing
Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from 1 to 6. Which of the following locations will never be probed if a collision occurs at position 5? A). 4 B). 5 C). 8 D). 6
asked
Oct 31, 2017
in
Programming
by
shivangi5
Active
(
1.4k
points)

61
views
hashing
0
votes
0
answers
27
quradratic probing
which is correct method for QP : 1) 2) H(k) = (H+ i^2)mod m
asked
Oct 31, 2017
in
DS
by
Hira Thakur
Boss
(
12.3k
points)

54
views
hashing
+1
vote
0
answers
28
I have problem to understand the following question , help me to sort it out ?
asked
Oct 31, 2017
in
DS
by
hem chandra joshi
Active
(
4.3k
points)

129
views
hashing
+2
votes
1
answer
29
Uniform Hashing
Suppose we use hash function H(n) to hash n distinct element(keys) into an array T of length m. What is the expected number of colliding pairs of element, if we use simple uniform hashing?
asked
Oct 13, 2017
in
DS
by
srestha
Veteran
(
81.7k
points)

135
views
datastructure
hashing
+1
vote
1
answer
30
Algorithm : Hashing
Consider a hash table consisting of M=11 slots, and suppose integer key value are hashed into the table using hash function h1: int h1(int key) { x = (key + 5)*(key + 5); x = x/6; x = x + key; x = x%11; return x; } Suppose that collisions are resolved ... have been inserted in the given order: 43, 23, 1, 0, 15, 31, 4, 7, 11, 3 Source: http://www.techtud.com/example/hashing
asked
Sep 27, 2017
in
Algorithms
by
rahul sharma 5
Boss
(
22.7k
points)

182
views
algorithms
hashing
Page:
1
2
3
4
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
barc result
Suggestion for IIITH exam
Placement Statistics for Computer Science
IIT Bombay Admission
ISRO 2018
Follow @csegate
Gatecse
Recent questions tagged hashing
Recent Blog Comments
...
link? not getting it
Declared!
got it :) thanks man
JUST VIST "important date" under barc login
34,782
questions
41,758
answers
118,940
comments
41,401
users