Question:
If on applying a hash function, every items of a list maps to unique index in the hash table it is called.
If on applying a hash function, every items of a list maps to unique index in the hash table it is called.
Updated On: Apr 19, 2024
- Complete hash function
- Total hash function
- Remainder hash function
- Perfect hash function
Hide Solution
Verified By Collegedunia
The Correct Option is D
Solution and Explanation
The correct option is(D): Perfect hash function
Was this answer helpful?
0
0
Top Questions on Hashing
- Consider performing uniform hashing on an open address hash table with load factor \(α = \frac{n}{m}< 1\), where n elements are stored in the table with m slots. The n m expected number of probes in an unsuccessful search is at most \(\frac{1}{1-\alpha}\)
Inserting an element in this hash table requires at most ______ probes, on average. - Match the items in Column 1 with the items in Column 2 in the following table :
Column 1 Column 2 (p) First In First Out (i) Stacks (q) Lookup Operation (ii) Queues (r) Last In First Out (iii) Hash Tables - Match the following:
List I List II 1 FIFO a Stack 2 Look up op. b Queue 3 Last-In first out c Hash table
Questions Asked in CUET exam
- A person walks 10 m North, then turns right and walks 5 m, then turns right again and walks 10 m. What direction is he facing now?
- CUET (UG) - 2025
- Direction sense
- A and B can complete a task in the ratio 3:2. If together they complete the task in 20 days, how long will A alone take?
- CUET (UG) - 2025
- Time and Work
- Which data structure follows the Last-In-First-Out (LIFO) principle?
- CUET (UG) - 2025
- Data Structures
- What is the primary function of an operating system?
- CUET (UG) - 2025
- Operating Systems
- What is the time complexity of a binary search algorithm on a sorted array?
- CUET (UG) - 2025
- Data Structures
View More Questions