Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged hashing
0
votes
0
answers
31
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 ...
rsansiya111
360
views
rsansiya111
asked
Mar 12, 2022
DS
data-structures
hashing
+
–
19
votes
2
answers
32
GATE CSE 2022 | Question: 6
Suppose we are given $n$ keys, $m$ hash table slots, and two simple uniform hash functions $h_{1}$ and $h_{2}.$ Further suppose our hashing scheme uses $h_{1}$ for the odd keys and $h_{2}$ for the even keys. What is the expected number of keys in a slot? $\frac{m}{n}$ $\frac{n}{m}$ $\frac{2n}{m}$ $\frac{n}{2m}$
Suppose we are given $n$ keys, $m$ hash table slots, and two simple uniform hash functions $h_{1}$ and $h_{2}.$ Further suppose our hashing scheme uses $h_{1}$ f...
Arjun
10.3k
views
Arjun
asked
Feb 15, 2022
Algorithms
gatecse-2022
algorithms
hashing
uniform-hashing
1-mark
+
–
0
votes
1
answer
33
Data structure: hashing
A hash table has spaces for 50 records. Then the probability of collision before the table is 10% full is_______. 10% of 50 = 5, so we need to find the probability of collision before we insert 5 slots. *When hash table empty, prob. of ... no. of slots = 200 then probability = 0.95 Why probability of collision is increasing very rapidly? Please give a detailed explanation.
A hash table has spaces for 50 records. Then the probability of collision before the table is 10% full is_______.10% of 50 = 5, so we need to find the probability of coll...
Crackca
872
views
Crackca
asked
Nov 22, 2021
DS
hashing
data-structures
+
–
26
votes
1
answer
34
GATE CSE 2021 Set 1 | Question: 47
Consider a $\textit{dynamic}$ hashing approach for $4$-bit integer keys: There is a main hash table of size $4$. The $2$ least significant bits of a key is used to index into the main hash table. Initially, the main hash table entries are empty. Thereafter, when more keys are hashed ... notation)? $5,9,4,13,10,7$ $9,5,10,6,7,1$ $10,9,6,7,5,13$ $9,5,13,6,10,14$
Consider a $\textit{dynamic}$ hashing approach for $4$-bit integer keys:There is a main hash table of size $4$.The $2$ least significant bits of a key is used to index in...
Arjun
7.7k
views
Arjun
asked
Feb 18, 2021
Algorithms
gatecse-2021-set1
multiple-selects
algorithms
hashing
2-marks
+
–
Page:
« prev
1
2
3
4
5
6
7
...
11
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register