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
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
Recent questions tagged hashing
0
votes
0
answers
1
Self Doubt
Given the input sequence {11, 33, 43, 99, 34, 79, 19} and hash table of size 10 with the hash function h(k) = k mod 10. If hash table uses quadratic probing, the number of collisions occurred while mapping the given sequence is ______ for quadratic probing H'(k,i) = (h(k) ... only intial hash function given no values for c1 and c2 ?? when should we consider H'(k) = (h(k) + i^2) mod m ??
asked
3 days
ago
in
Programming
by
jatin khachane 1
Active
(
3.3k
points)

9
views
hashing
0
votes
0
answers
2
DataStructure
is hashing there in gate 2019 syllabus?
asked
6 days
ago
in
DS
by
abhishek1995_cse
(
159
points)

30
views
datastructure
hashing
0
votes
0
answers
3
ADA:Hashing: Probability of collision
In the following question why is the probability multiplied by 2?
asked
Dec 8
in
Algorithms
by
chauhansunil20th
Active
(
1.9k
points)

35
views
algorithms
hashing
chaining
madeeasytestseries
+1
vote
0
answers
4
TestBook test series
The keys 44, 63, 29, 78, 23, 6, 81, 14, 13, 12 and 52 are inserted into an initially empty hash table of length 12 using linear probing with hash function h(k)= k mod 12. What is the probability that the 10th slot will be filled next? i. ... left which have a probability of filling as 1 because no matter what index we get for the next insert we are going to fill 10th slot only.
asked
Oct 31
in
Algorithms
by
vinay chauhan
(
469
points)

117
views
testbooktestseries
algorithms
hashing
+1
vote
1
answer
5
Dbms test1
asked
Oct 27
in
Databases
by
Shivani gaikawad
Junior
(
743
points)

31
views
databases
hashing
0
votes
0
answers
6
Made easy w/b
asked
Oct 13
in
Programming
by
Manoj Kumar Pandey
(
45
points)

29
views
hashing
0
votes
0
answers
7
Selfdoubt  Case of Deletion when Open Addressing is used for collision resolution
asked
Oct 5
in
Algorithms
by
Soumya29
Boss
(
14.2k
points)

85
views
hashing
algorithms
+2
votes
1
answer
8
Hashing with Linear probing
Consider an initially empty hash table of length 10. Following are the keys in hash table inserted using mod function h(k)=k mod 10. Slot Number Value 0 1 91 2 3 33 4 44 5 23 6 64 7 77 8 9 How many different insertion sequences of keys would result in the above hash table? My answer comes to be 56, is it correct?
asked
Sep 22
in
Programming
by
Ayush Upadhyaya
Boss
(
18.9k
points)

172
views
hashing
datastructure
0
votes
0
answers
9
Hash function
Which of following is true ? A. A secure hash function can never produce any collisions. B. Cryptographic function is deterministic C. Host using DHCP on wired network can be prevented against DHCP spoofing attacks. D. None
asked
Sep 15
in
Computer Networks
by
Na462
Loyal
(
7.5k
points)

29
views
hashing
computernetworks
0
votes
1
answer
10
hashing
given keys: 224562,137456,214562 140145,214576,162145 144467,199645,234534 Using the digitextraction method (first, third and fifth digits) and quadratic probing, stores the keys shown above in an array with 19 elements. What is the indexes of bin into which all the records are inserted? hint : digit extraction(1,3,5) for 224562>246 mod 19 = 18 and soon.
asked
Aug 31
in
DS
by
balaganesh
(
129
points)

46
views
quadratic
probing
hashing
datastructure
+1
vote
0
answers
11
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
(
281
points)

42
views
hashing
datastructure
uniformhashing
probability
0
votes
1
answer
12
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
(
2.1k
points)

131
views
hashing
datastructure
+1
vote
0
answers
13
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
(
439
points)

27
views
hashing
datastructure
0
votes
1
answer
14
UGCNETJuly2018II23
A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 18? 3 4 5 6
asked
Jul 13
in
Others
by
Pooja Khatri
Active
(
5.1k
points)

229
views
ugcnetjuly2018ii
datastructure
hashing
0
votes
1
answer
15
UGCNETJuly2018II70
Consider a hash table of sze seven, with starting index zero, and a hash function (7x+3) mod 4. Assuming that the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Here " ... 1, 3, 8, 10, ___, ___, ___ 1, ___, 3, ___, 8, ___, 10 3, 10, ___, ____, 8, ___, ___
asked
Jul 13
in
Others
by
Pooja Khatri
Active
(
5.1k
points)

113
views
ugcnetjuly2018ii
datastructure
hashing
+1
vote
1
answer
16
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
(
375
points)

86
views
algorithms
hashing
chaining
+1
vote
1
answer
17
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
Loyal
(
6.3k
points)

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

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

58
views
algorithms
datastructure
hashing
+1
vote
1
answer
20
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
Junior
(
529
points)

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

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

30
views
compile
compilerdesign
hashing
tree
0
votes
1
answer
23
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
(
265
points)

82
views
hashing
uniformhashing
algorithms
0
votes
1
answer
24
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.3k
points)

45
views
uttarakhandasstprof2018
datastructure
hashing
+1
vote
0
answers
25
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
(
17k
points)

181
views
hashing
datastructure
chaining
computernetworks
ipv6
+4
votes
0
answers
26
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
Boss
(
17.4k
points)

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

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

225
views
hashing
datastructure
probability
conditionalprobability
+4
votes
0
answers
29
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.6k
points)

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

42
views
datastructure
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
IIT HYDERABAD M.Tech (RA) 3Years Winter Session Interview experience
INDIAN AIR FORCE
GATE BOOK _ TEST SERIES DOUBT_
Visualizing complex C code
GATE Book Test Series
Follow @csegate
Gatecse
Recent questions tagged hashing
Recent Blog Comments
First of all, congratulations!
I can...
Congrats man. You wrote gate in B.Tech 3rd year?
Thank You so much sir for giving tips. I will...
Please elucidate this really important...
44,311
questions
49,802
answers
164,506
comments
65,865
users