Register

Recent questions tagged hashing

1 votes
0 answers
121
Hashing_And_Probability
Consider a hash table with 9 slots that use collision-resolution with chaining and the table is initially empty. What is the probability that after 4 insertions, at least a chain of size 3 is created?
Consider a hash table with 9 slots that use collision-resolution with chaining and the table is initially empty. What is the probability that after 4 insertions, at least...
User Avatar
0 votes
0 answers
125
DataStructure
is hashing there in gate 2019 syllabus?
is hashing there in gate 2019 syllabus?
User Avatar
1 votes
2 answers
126
NIELIT 2018-65
For a given hash table $T$ with $10$ slots that stores $1000$ elements, the load factor $\alpha$ for $T$ is $100$ $0.01$ $200$ $1.05$
For a given hash table $T$ with $10$ slots that stores $1000$ elements, the load factor $\alpha$ for $T$ is$100$$0.01$$200$$1.05$
User Avatar
0 votes
0 answers
128
wooe OTS 0
Answer : 4.604
Answer : 4.604
User Avatar
0 votes
0 answers
129
Hashing + Counting , Source : ME OTS
Anyone please give a solution to solve such question as it is difficult in one go.
Anyone please give a solution to solve such question as it is difficult in one go.
User Avatar
0 votes
0 answers
130
MadeEasy Test Series 2018: Programming & DS - Hashing
What is the number of collisions while doing insert operation on the hash table? Options are 3 4 5 6 Answer is 4 Can anyone tell me how? ​​
What is the number of collisions while doing insert operation on the hash table? Options are 3456Answer is 4Can anyone tell me how? ​​
User Avatar
0 votes
0 answers
131
Made Easy Algorithms Test - 2
https://gateoverflow.in/?qa=blob&qa_blobid=8164680937983732221 I don't understand the solution at all. I thought 91,33,44,and 77 can come in any possible ways but that has been said wrong.
https://gateoverflow.in/?qa=blob&qa_blobid=8164680937983732221I don't understand the solution at all. I thought 91,33,44,and 77 can come in any possible ways but that has...
User Avatar
0 votes
1 answer
132
Gate Forum
User Avatar
0 votes
2 answers
133
double hashing
can any one explain double hashing example
can any one explain double hashing example
User Avatar
1 votes
1 answer
135
Dbms test1
User Avatar
0 votes
0 answers
136
Made easy w/b
User Avatar
3 votes
2 answers
140
Hashing
User Avatar
0 votes
0 answers
141
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
Which of following is true ?A. A secure hash function can never produce any collisions.B. Cryptographic function is deterministicC. Host using DHCP on wired network can b...
User Avatar
1 votes
0 answers
144
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.
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 us...
User Avatar
0 votes
1 answer
145
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 .
Which of the following is the least suitable hash function H(x) where X is some non negative integer ?1. h(k) =k%n2.h(k) =k*k %n3.h(k)=(gcd(k+1,2k+2) +k ) %nLinear probin...
User Avatar
1 votes
0 answers
146
Hashing
What is the difference between hashing and addressing? Because the definition of open addressing and closed hashing seems to be the same.
What is the difference between hashing and addressing? Because the definition of open addressing and closed hashing seems to be the same.
User Avatar
0 votes
2 answers
147
UGC NET CSE | July 2018 | Part 2 | Question: 23
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
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 ...
User Avatar
2 votes
1 answer
150
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??
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??
User Avatar
Page: