Register

NiELIT 2016 HASHING
closed

• closed by
645 views
0 votes
0 votes
closed as a duplicate of: Hash table
A hash table has space for 100 records. Then probability of collision before the table is 100% full is?

A 0.45

B 0.5

C 0.3

D 0.34

 

How to solve this problem?
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
tishhaagrawal asked Dec 16, 2023
354 views
Made Easy Test Series : Consider an open addressing hashing scheme with m slots and n keys. Assuming uniform hashing, the expected number of empty slots in the hash table for m=7 and n=3 is equal to ____________(Round off to two decimal places)
Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...
User Avatar
0 votes
0 votes
0 answers
3
rsansiya111 asked Mar 12, 2022
375 views
NPTEL Assignment of Hashing Techniques
Canadian postal codes have the format LDL DLD, where L is always a letter (between A-Z), D is always a digit (0-9), and is always a single space. For example, the postal code for the University of Waterloo is N2L 3G1. Devise a suitable hash function for this system.
Canadian postal codes have the format LDL DLD, where L is always a letter (between A-Z), D is always a digit (0-9), and is always a single space. For example, the postal ...
User Avatar
Link Copied!