- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- Using division method, in a given hash t...

Q. |
## Using division method, in a given hash table of size 157, the key of value 172 be placed at position |

A. | 19 |

B. | 72 |

C. | 15 |

D. | 17 |

Answer» C. 15 |

View all MCQs in:
Data Structures (DS)

- What is the table size when the value of p is 7 in multiplication method of creating hash functions?
- 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?
- Uniform distribution of the hash address throughout the given set L is __________.
- What can be the value of m in the division method?
- Which hash function satisfies the condition of simple uniform hashing?
- 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__________.
- If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.

Login to Continue

It will take less than 2 minutes

Report MCQ