Which hash function satisfies the condition of simple uniform hashing?

1.	Which hash function satisfies the condition of simple uniform hashing?(a) h(k) = lowerbound(km)(b) h(k)= upperbound(mk)(c) h(k)= lowerbound(k)(d) h(k)= upperbound(k)I would like to ask this question from Hash Tables in chapter Hash Tables of Data Structures & Algorithms II got this question during an interview.
Answer» correct OPTION is: (a) h(K) = lowerbound(km) 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).

Which hash function satisfies the condition of simple uniform hashing?(a) h(k) = lowerbound(km)(b) h(k)= upperbound(mk)(c) h(k)= lowerbound(k)(d) h(k)= upperbound(k)I would like to ask this question from Hash Tables in chapter Hash Tables of Data Structures & Algorithms II got this question during an interview.

Answer»

correct OPTION is: (a) h(K) = lowerbound(km)

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).

Discussion

No Comment Found

Related InterviewSolutions

What is a hash table?(a) A structure that maps values to keys(b) A structure that maps keys to values(c) A structure used for storage(d) A structure used to implement stack and queueMy query is from Hash Tables topic in chapter Hash Tables of Data Structures & Algorithms IThis question was addressed to me during a job interview.
If several elements are competing for the same bucket in the hash table, what is it called?(a) Diffusion(b) Replication(c) Collision(d) DuplicationI'm obligated to ask this question of Hash Tables in section Hash Tables of Data Structures & Algorithms IThis question was addressed to me by my school principal while I was bunking the class.
What is direct addressing?(a) Distinct array position for every possible key(b) Fewer array positions than keys(c) Fewer keys than array positions(d) Same array position for all keysI want to ask this question from Hash Tables topic in section Hash Tables of Data Structures & Algorithms IThe question was posed to me by my college director while I was bunking the class.
What is the search complexity in direct addressing?(a) O(n)(b) O(logn)(c) O(nlogn)(d) O(1)Asked question is from Hash Tables in division Hash Tables of Data Structures & Algorithms IThis question was addressed to me in a national level competition.
What is a hash function?(a) A function has allocated memory to keys(b) A function that computes the location of the key in the array(c) A function that creates an array(d) A function that computes the location of the values in the arrayThe origin of the question is Hash Tables in portion Hash Tables of Data Structures & Algorithms IThis question was addressed to me during an interview.
Which of the following is not a technique to avoid a collision?(a) Make the hash function appear random(b) Use the chaining method(c) Use uniform hashing(d) Increasing hash table sizeMy question is taken from Hash Tables topic in section Hash Tables of Data Structures & Algorithms II got this question by my school teacher while I was bunking the class.
What is the load factor?(a) Average array size(b) Average key size(c) Average chain length(d) Average hash table lengthQuestion is from Hash Tables in division Hash Tables of Data Structures & Algorithms IThis question was addressed to me in homework.
What is simple uniform hashing?(a) Every element has equal probability of hashing into any of the slots(b) A weighted probabilistic method is used to hash elements into the slots(c) Elements has Random probability of hashing into array slots(d) Elements are hashed based on priorityQuery is from Hash Tables topic in section Hash Tables of Data Structures & Algorithms IThis question was addressed to me by my college professor while I was bunking the class.
In simple uniform hashing, what is the search complexity?(a) O(n)(b) O(logn)(c) O(nlogn)(d) O(1)My question is from Hash Tables in division Hash Tables of Data Structures & Algorithms II have been asked this question in an international level competition.
In simple chaining, what data structure is appropriate?(a) Singly linked list(b) Doubly linked list(c) Circular linked list(d) Binary treesI want to ask this question from Hash Tables in division Hash Tables of Data Structures & Algorithms IThis question was posed to me in exam.

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment