- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- Which hash function satisfies the condit...

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

Answer» A. h(k) = lowerbound(km) |

View all MCQs in:
Data Structures (DS)

- Uniform distribution of the hash address throughout the given set L is __________.
- The hashing file space is divided into_______________.
- What is the hash function used in the division method?
- How many steps are involved in creating a hash function using a multiplication method?
- What is the hash function used in multiplication method?
- Using division method, in a given hash table of size 157, the key of value 172 be placed at position
- What is the table size when the value of p is 7 in multiplication method of creating hash functions?
- What is the average retrieval time when n keys hash to the same slot?
- The possibility of two different keys k1 & k2 yielding the same hash address is called__________.
- Which of the following statements for a simple graph is correct?

Login to Continue

It will take less than 2 minutes

Report MCQ