Help authour, Buy PDF Ebook >>>Click Here<<<
Hashing Functions Multiple choice Questions and Answers (MCQs)
Question 1 |
Which scheme uses a randomization approach?
hashing by division | |
hashing by multiplication | |
universal hashing | |
open addressing |
Question 1 Explanation:
Universal hashing scheme uses a randomization approach whereas hashing by division and hashing by multiplication are heuristic in nature.
Question 2 |
Which hash function satisfies the condition of simple uniform hashing?
h(k) = lowerbound(km) | |
h(k)= upperbound(mk) | |
h(k)= lowerbound(k) | |
h(k)= upperbound(k) |
Question 2 Explanation:
If the keys are known to be random real numbers k independently and uniformly distributed in the range 0<=k<=1, the hash function which satisfies the condition of simple uniform hashing is
h(k)= lowerbound(km).
Question 3 |
A good hash approach is to derive the hash value that is expected to be dependent of any patterns that might exist in the data.
True | |
False |
Question 3 Explanation:
A hash value is expected to be unrelated or independent of any patterns in the distribution of keys.
Question 4 |
Interpret the given character string as an integer expressed in suitable radix notation.
Character string = pt
14963 | |
14392 | |
12784 | |
14452 |
Question 4 Explanation:
The given character string can be interpreted as (112, 116) (Ascii values) then expressed as a radix-128 integer, hence the value is 112*128 + 116 = 14452.
Question 5 |
What is the hash function used in the division method?
h(k) = k/m | |
h(k) = k mod m | |
h(k) = m/k | |
h(k) = m mod k |
Question 5 Explanation:
In division method for creating hash functions, k keys are mapped into one of m slots by taking the reminder of k divided by m.
There are 5 questions to complete.