Bissoy.com
Doctors Medicines MCQs Q&A

Consider a hash table of size 7, with hash function H (k) = k % 7, and pseudo random i = (i + 5) % 7. We want to insert the following keys one by one from left to right. 15, 11, 25, 16, 9, 8, 12 What will be the position of the key 25, if we use random probing?

Consider a hash table of size 7, with hash function H (k) = k % 7, and pseudo random i = (i + 5) % 7. We want to insert the following keys one by one from left to right. 15, 11, 25, 16, 9, 8, 12 What will be the position of the key 25, if we use random probing? Correct Answer 2

Since we are using random probing:

Insert 15:

(15)%7 = 1

Insert 11:

(11)%7 = 4

Insert 25:

(25)%7 = 4 // collision:

i = 4

 i = (i + 5) % 7    // using random function

i = (4 + 5)%7 = 2

Hence 25 position is 2nd

Related Questions

If a + b + c + d = 4, then find the value of $$\frac{1}{{\left( {1 - a} \right)\left( {1 - b} \right)\left( {1 - c} \right)}}$$     + $$\frac{1}{{\left( {1 - b} \right)\left( {1 - c} \right)\left( {1 - d} \right)}}$$     + $$\frac{1}{{\left( {1 - c} \right)\left( {1 - d} \right)\left( {1 - a} \right)}}$$     + $$\frac{1}{{\left( {1 - d} \right)\left( {1 - a} \right)\left( {1 - b} \right)}}$$     is?
If a + b + c + d = 4, then the value of $$\frac{1}{{\left( {1 - a} \right)\left( {1 - b} \right)\left( {1 - c} \right)}}$$     + $$\frac{1}{{\left( {1 - b} \right)\left( {1 - c} \right)\left( {1 - d} \right)}}$$     + $$\frac{1}{{\left( {1 - c} \right)\left( {1 - d} \right)\left( {1 - a} \right)}}$$     + $$\frac{1}{{\left( {1 - d} \right)\left( {1 - a} \right)\left( {1 - b} \right)}}$$     is?
Consider a 13 element hash table for which f(key) = key mod 13 is used with integer keys. Assuming linear probing is used for collision resolution, at which location would the key 103 be inserted, if the keys 661, 182, 24 and 103 are inserted in that order?
What is linear_congruential_engine? for some w using Mersenne Twister algorithm b) Pseudo-random number engine that generates random unsigned integers c) Pseudo-random number engine that generates random unsigned integers in the range for some w using lagged Fibonacci generator d) Pseudo-random number engine that generates random signed integers in the range for some w using Mersenne Twister algorithm
A Hash function f is defined as f(key) = key mod 7. With linear probing, while inserting the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0, in which location the key 11 will be stored (count table Index 0 as 0th location)?
The Hamiltonian of a particle is given by $$H = \frac{{{p^2}}}{{2m}} + V\left( {\left| {\overrightarrow {\bf{r}} } \right|} \right) + \phi \left( { + \left| {\overrightarrow {\bf{r}} } \right|} \right)\overrightarrow {\bf{L}} .\overrightarrow {\bf{S}} ,$$        where $$\overrightarrow {\bf{S}} $$ is the spin, $$V\left( {\left| {\overrightarrow {\bf{r}} } \right|} \right)$$  and $$\phi \left( {\left| {\overrightarrow {\bf{r}} } \right|} \right)$$  are potential functions and $$\overrightarrow {\bf{L}} \left( { = \overrightarrow {\bf{r}} \times \overrightarrow {\bf{p}} } \right)$$   is the angular momentum. The Hamiltonian does not commute with
Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
The value of the expression $$\frac{{{{\left( {a - b} \right)}^2}}}{{\left( {b - c} \right)\left( {c - a} \right)}} + $$   $$\frac{{{{\left( {b - c} \right)}^2}}}{{\left( {a - b} \right)\left( {c - a} \right)}} + $$    $$\frac{{{{\left( {c - a} \right)}^2}}}{{\left( {a - b} \right)\left( {b - c} \right)}}$$   = ?
$$\frac{{{{\left( {4.53 - 3.07} \right)}^2}}}{{\left( {3.07 - 2.15} \right)\left( {2.15 - 4.53} \right)}} + \, $$     $$\frac{{{{\left( {3.07 - 2.15} \right)}^2}}}{{\left( {2.15 - 4.53} \right)\left( {4.53 - 3.07} \right)}} + \,\, $$     $$\frac{{{{\left( {2.15 - 4.53} \right)}^2}}}{{\left( {4.53 - 3.07} \right)\left( {3.07 - 2.15} \right)}}$$     is simplified to :
Suppose we are given n keys, m hash table slots, and two simple uniform hash functions h1 and h2. Further, suppose our hashing scheme uses h1 for the odd keys and h2 for the even keys. What is the expected number of keys in a slot?