Classify the Hashing Functions based on the various methods by which the key value is found.
Answer Posted / rohit sah
Direct method,
Subtraction method,
Modulo-Division method,
Digit-Extraction method,
Mid-Square method,
Folding method,
Pseudo-random method.
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
What are the different binary tree traversal techniques?
Which sorting algorithm is considered the fastest?
Differentiate between priorityqueue and treeset.
Do all declaration statements result in a fixed reservation in memory?
What is the top of a stack?
Is array faster than arraylist?
What are the different data structures?
Can array store heterogeneous data?
What is doubly linked list in data structure?
What is the space complexity of bubble sort?
How do I sort hashset?
Describe the height term in a tree.
What is structure of data type?
What is map keyset?
How do you declare An array of three char pointers