Register

Recent questions tagged hashing

2 2 votes
1 answers 1 answer
802
802 views
gatebook
someone explain
User Avatar
0 0 votes
0 0 answers
1.1k
1.1k views
Hashing Question
Why 4 is multiplied in part. In the solution.
User Avatar
2 2 votes
1 1 answer
1.7k
1.7k views
is number of comparisons equal to number of collisons
Consider the hash table of size 12 that uses open addressing with linear probing. Let h(k) = k mod12 be thehash function used. A sequence of records with keys 43, 63, 84,...
User Avatar
1 1 vote
1 1 answer
1.8k
1.8k views
ME Full Syllabus Test 1
consider a hash table with 8 slots that uses chaining for collision resolution.The table is initially empty. What is the probability that after 4 keys are inserted, atlea...
User Avatar
0 0 votes
1 answers 1 answer
1.5k
1.5k views
Hashing
A hash table of length 100 uses chaining.What is the probability that all the values are hashed into the same slot after 5 insertions?
User Avatar
3 3 votes
1 1 answer
1.8k
1.8k views
quadratic probing collison loop count??
Given the input sequence {11,33,43,79,19} and hash table of size 10 with the hash function h(k)=k mod 10. If hash tables uses quadratic probing,the number of collisions o...
User Avatar
3 3 votes
1 answers 1 answer
3.7k
3.7k views
Hashing
Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search...
User Avatar
4 4 votes
2 answers 2 answers
1.3k
1.3k views
MADE EASY TEST SERIES
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’.What is the expected number of colliding pairs of elements, if we ...
User Avatar
6 6 votes
2 answers 2 answers
1.6k
1.6k views
Test by Bikram | Mock GATE | Test 1 | Question: 16
Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision?$0.123$$0.14...
User Avatar
0 0 votes
2 2 answers
1.1k
1.1k views
MadeEasy Subject Test: Programming & DS - Hashing
True Or False.....? Explain...?
User Avatar
1 1 vote
1 answers 1 answer
1.7k
1.7k views
DS :True / False
In hash function using linear probing to reduce collision, the number of probes required to insert an item is identical with number of probes needed to retrieve it.is it ...
User Avatar
0 0 votes
1 1 answer
862
862 views
Virtual Gate Test Series: Algorithms - Hash Table
plz explain?
User Avatar
0 0 votes
2 2 answers
1.4k
1.4k views
Algorithm ADA made easy
consider the following keys that are hashed into table in the order using giving hash function h(i)=(2i+5)mod1112,44,13,88,23,94,11,39,20,16,5 Assume hash tables has loca...
User Avatar
0 0 votes
1 answers 1 answer
706
706 views
Made Easy
User Avatar
1 1 vote
1 answers 1 answer
842
842 views
Algorithms Hashing
Consider the following keys that are hashed into table in the order given using hash function\[\begin{array}{l}h(i)=(2 i+5) \text { mod11 } \\12,44,13,88,23,94,11,39,20,1...
User Avatar
0 0 votes
1 1 answer
890
890 views
MadeEasy Test Series: Programming & DS - Hashing
anybody give detailed explnation please
User Avatar
1 1 vote
1 answers 1 answer
1.1k
1.1k views
MadeEasy Test Series: Programming & DS - Hashing
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of elements, if we...
User Avatar
0 0 votes
1 answers 1 answer
683
683 views
MadeEasy Test Series: Programming & DS - Hashing
User Avatar
3 3 votes
1 1 answer
1.3k
1.3k views
ME -- Hashing
Suppose there are $11$ slots in a Hash Table. At an instant there are $5$ empty slots and a new element $x$ is inserted in Hash Table. What is the the probablity that new...
User Avatar
2 2 votes
1 answers 1 answer
4.9k
4.9k views
Test by Bikram | Data Structures | Test 2 | Question: 22
Suppose you have the following set of keys to insert into a hash table that can hold $11$ values. $113, 117, 97, 100, 114, 108, 116, 105, 99$. Which of the following bes...
User Avatar
1 1 vote
1 answers 1 answer
1.4k
1.4k views
Test by Bikram | Data Structures | Test 2 | Question: 21
Following keys have to be inserted in exact order into the hash table with $9$ slots.$5, 28, 19, 15, 20, 33, 12, 17, 10$The auxiliary hash functions is $h(k)=K$ mod table...
User Avatar
1 1 vote
1 answers 1 answer
1.2k
1.2k views
Test by Bikram | Data Structures | Test 2 | Question: 14
If memory is limited and the entire dictionary cannot be stored in a hash table, we can still get an efficient algorithm that almost always works. We declare an array H_T...
User Avatar
1 1 vote
2 answers 2 answers
3.0k
3.0k views
Test by Bikram | Data Structures | Test 2 | Question: 9
Suppose you have a hash table that can hold $100$ elements. It currently stores $30$ elements (in one of $30$ possible different locations in the hash table). The probab...
User Avatar
1 1 vote
1 1 answer
1.2k
1.2k views
Hashing
How do i prove that : : : In hashing n items into a hash table with k locations, the expected number of collisions is $n - k + k( 1-\frac{1}{k})^n$ ??
User Avatar
16 16 votes
3 3 answers
5.7k
5.7k views
GATE CSE 1990 | Question: 13b
Consider a hash table with chaining scheme for overflow handling:What is the worst-case timing complexity of inserting $n$ elements into such a table?For what type of ins...
User Avatar
0 0 votes
0 0 answers
508
508 views
What do you interpret from question?
It took me hell a lot of time. Still cann't figure out question??
User Avatar
1 1 vote
1 answers 1 answer
1.4k
1.4k views
Programming and DS
User Avatar
0 0 votes
1 1 answer
1.0k
1.0k views
Hashing
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining).1)What is th...
User Avatar
0 0 votes
1 answers 1 answer
2.1k
2.1k views
Hashing
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining).1)What is th...
User Avatar
0 0 votes
3 3 answers
2.6k
2.6k views
Gate Computer Science FB group post
A hash table has space for 100 records .what is the probability of collision before it is 5% full?? a. 0.25b. 0.10c. 0.40d. 0.20
User Avatar
Page: