- Computer Science Engineering (CSE)
- Data Structures (DS)
- The possibility of two different keys k1...

Q. |
## The possibility of two different keys k1 & k2 yielding the same hash address is called__________. |

A. | merge. |

B. | obstacle. |

C. | overlapping. |

D. | collision. |

Answer» C. overlapping. |

View all MCQs in:
Data Structures (DS)

- What is the average retrieval time when n keys hash to the same slot?
- Uniform distribution of the hash address throughout the given set L is __________.
- Which hash function satisfies the condition of simple uniform hashing?
- What is the hash function used in the division method?
- Using division method, in a given hash table of size 157, the key of value 172 be placed at position
- How many steps are involved in creating a hash function using a multiplication method?
- What is the hash function used in multiplication method?
- What is the table size when the value of p is 7 in multiplication method of creating hash functions?
- Base address is the address of __________.
- A B-tree of order 4 and of height 3 will have a maximum of keys.

Login to Continue

It will take less than 2 minutes

Report MCQ