Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged hashing
0
votes
0
answers
151
Gate_2019_Mock_Paper
Please explained in detail hashing question
Please explained in detail hashing question
Harikesh Kumar
283
views
Harikesh Kumar
asked
Jun 7, 2018
Algorithms
algorithms
data-structures
hashing
+
–
0
votes
1
answer
152
Gate_2019_Mock_Paper
Please explained in detail
Please explained in detail
Harikesh Kumar
426
views
Harikesh Kumar
asked
Jun 7, 2018
Algorithms
algorithms
data-structures
hashing
test-series
+
–
1
votes
1
answer
153
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.
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 e...
once_2019
294
views
once_2019
asked
May 5, 2018
Programming in C
hashing
data-structures
+
–
4
votes
2
answers
154
ISRO2018-36
A hash table with $10$ buckets with one slot pet per bucket is depicted here. The symbols, $S1$ to $S7$ ... $4$ $5$ $6$ $3$
A hash table with $10$ buckets with one slot pet per bucket is depicted here. The symbols, $S1$ to $S7$ are initially entered using a hashing function with linear probing...
Arjun
2.5k
views
Arjun
asked
Apr 22, 2018
Algorithms
isro2018
algorithms
hashing
linear-probing
+
–
0
votes
1
answer
155
Self doubt
Let |U| = $m^{2}$and consider hashing with chaining. For any hash function h : U → {1, 2, . . . , m − 1}, there exists a sequence of m insertions that leads to a chain of length m. Explain
Let |U| = $m^{2}$and consider hashing with chaining. For any hash function h : U → {1, 2, . . . , m − 1}, there exists a sequence of m insertions that leads to a cha...
Kaluti
619
views
Kaluti
asked
Apr 19, 2018
Algorithms
algorithms
hashing
+
–
0
votes
0
answers
156
compile design question from runtime environment
Ronish Jariwala 1
542
views
Ronish Jariwala 1
asked
Apr 15, 2018
Compiler Design
runtime-environment
compiler-design
hashing
tree
+
–
0
votes
1
answer
157
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?
Can someone explain Secondary Clustering to me? The distance between two successive probes is quadratic. I get it, but how are clusters being formed?
Parimal Paritosh
809
views
Parimal Paritosh
asked
Mar 8, 2018
Programming in C
hashing
uniform-hashing
algorithms
+
–
0
votes
1
answer
158
Uttrakhand Asst. Professor Exam-41
Which of the following is not used for hash function? Mid-square method Division method Folding method Probe method
Which of the following is not used for hash function?Mid-square methodDivision methodFolding methodProbe method
gatecse
6.0k
views
gatecse
asked
Mar 2, 2018
Unknown Category
uttarakhand-asst-prof-2018
data-structures
hashing
+
–
2
votes
1
answer
159
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).
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 num...
Shubhanshu
1.2k
views
Shubhanshu
asked
Jan 22, 2018
Programming in C
hashing
data-structures
chaining
computer-networks
ipv6
+
–
6
votes
0
answers
160
Hashing-MadeEasy
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.
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 tru...
MiNiPanda
2.3k
views
MiNiPanda
asked
Jan 21, 2018
Algorithms
algorithms
data-structures
hashing
+
–
2
votes
0
answers
161
MadeEasy Test Series 2018: Programming & DS - Hashing
Abhishek Kumar Singh
581
views
Abhishek Kumar Singh
asked
Jan 18, 2018
DS
programming
data-structures
hashing
made-easy-test-series
+
–
4
votes
0
answers
162
Made Easy Full Test - Hashing + Probability
Question - Consider a hash table with 8 slots that use chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted, at least a chain of size 3 is created? (assume simple uniform hashing is used) Correct answer - $29*8^{^{-3}}$ My answer - $8*8^{^{-3}}$
Question - Consider a hash table with 8 slots that use chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inse...
Akash Mishra
1.1k
views
Akash Mishra
asked
Jan 18, 2018
Probability
hashing
data-structures
probability
conditional-probability
+
–
5
votes
0
answers
163
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
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 collis...
rajoramanoj
723
views
rajoramanoj
asked
Jan 17, 2018
DS
hashing
probability
+
–
2
votes
0
answers
164
hashing
pranab ray
212
views
pranab ray
asked
Jan 15, 2018
Programming in C
data-structures
hashing
+
–
10
votes
4
answers
165
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 __________.
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 1912...
VS
3.4k
views
VS
asked
Dec 31, 2017
DS
data-structures
hashing
+
–
5
votes
2
answers
166
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 :
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) ...
sunil sarode
4.4k
views
sunil sarode
asked
Dec 30, 2017
DS
hashing
data-structures
+
–
1
votes
2
answers
167
ISRO-DEC2017-50
The characters of the string $\text{K R P C S N Y T J M}$ are inserted into a hash table of the size of size $10$ using a hash function $h(x)=(ord(x)-ord(A)+1)$ $mod$ $10$ If linear probing is used to resolve collisions, then the following insertion causes the collision $Y$ $C$ $M$ $P$
The characters of the string $\text{K R P C S N Y T J M}$ are inserted into a hash table of the size of size $10$ using a hash function$h(x)=(ord(x)-ord(A)+1)$ $mod$ $10$...
gatecse
3.4k
views
gatecse
asked
Dec 17, 2017
Algorithms
isrodec2017
hashing
easy
+
–
0
votes
1
answer
168
Made_easy Tst
i have done it like this..... (1/8)3+ 7/(8)3=8-2 .....how this is wrong...???
i have done it like this.....(1/8)3+ 7/(8)3=8-2 .....how this is wrong...???
hs_yadav
402
views
hs_yadav
asked
Dec 16, 2017
Algorithms
made-easy-test-series
hashing
probability
+
–
0
votes
0
answers
169
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)
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 inpu...
rahul sharma 5
904
views
rahul sharma 5
asked
Dec 8, 2017
Algorithms
algorithms
hashing
+
–
0
votes
2
answers
170
MadeEasy Test Series: Algorithms - Hashing
S1 :- if load factor of hash table is less than 1 then there are no collision S2:- As the size of hash table increases, the number of collisions will decrease. True false?
S1 :- if load factor of hash table is less than 1 then there are no collisionS2:- As the size of hash table increases, the number of collisions will decrease.True false?
rahul sharma 5
1.7k
views
rahul sharma 5
asked
Dec 4, 2017
Algorithms
algorithms
made-easy-test-series
test-series
hashing
+
–
5
votes
1
answer
171
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.
Consider the following keys that are hashed into the hash table in the order given using the hash functionWhere to handle the collision chaining is used, after inserting ...
junaid ahmad
1.4k
views
junaid ahmad
asked
Dec 3, 2017
Programming in C
hashing
+
–
4
votes
4
answers
172
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
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 ...
Shubham Kumar Gupta
1.6k
views
Shubham Kumar Gupta
asked
Dec 3, 2017
DS
hashing
data-structures
uniform-hashing
+
–
1
votes
1
answer
173
Book: GK Publication, Chapter: DS & Publication, Exercise -I Q:74
Que: When key values are real, a similar data representation might be produced by using a hashing function with? A. Mod B. Div C. Trunc D. Log N
Que: When key values are real, a similar data representation might be produced by using a hashing function with?A. ModB. DivC. TruncD. Log N
samsaurabh
844
views
samsaurabh
asked
Dec 1, 2017
Algorithms
hashing
+
–
0
votes
1
answer
174
MadeEasy Subject Test: Programming & DS - Hashing
charul
507
views
charul
asked
Nov 27, 2017
DS
made-easy-test-series
data-structures
hashing
+
–
2
votes
1
answer
175
hashing
difference between unsuccessful and successful probe?
difference between unsuccessful and successful probe?
nikkey123
874
views
nikkey123
asked
Nov 21, 2017
DS
hashing
data-structures
2017
+
–
0
votes
0
answers
176
made easy test series
chandra sai
231
views
chandra sai
asked
Nov 18, 2017
DS
hashing
data-structures
+
–
0
votes
1
answer
177
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)^(n-k) * nCk (C) (1/k)^k * (1-1/k)^(n-k) * nCk (D) None of the above
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 bei...
Saikat Dutta
1.1k
views
Saikat Dutta
asked
Nov 17, 2017
Programming in C
hashing
+
–
1
votes
2
answers
178
Virtual Gate Test Series: Algorithms - Hash Table(Linear Probing)
Mk Utkarsh
545
views
Mk Utkarsh
asked
Nov 11, 2017
Algorithms
algorithms
hashing
virtual-gate-test-series
+
–
1
votes
0
answers
179
Hashing - Linear Probing
ankitgupta.1729
1.0k
views
ankitgupta.1729
asked
Nov 9, 2017
Algorithms
hashing
+
–
1
votes
1
answer
180
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
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 colli...
Kaluti
544
views
Kaluti
asked
Nov 9, 2017
Programming in C
hashing
linear
probing
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register