Interested to Buy Any Domain ? << Click Here >> for more details...
Classify the Hashing Functions based on the various methods by which the key value is found.
- 1 Answers
- 1960 Views
- I also Faced
- E-Mail Answers
Answer / 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 |
How will you explain circular linked list?
What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?
What do you mean by breadth first search (bfs)?
Which is the fastest sorting?
There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?
What do you mean by disjoint set adt?
Why is map not a collection?
How do you find the depth of a binary tree?
What is the complexity of selection sort?
Mention the data structures which are used in graph implementation.
What is the limit of arraylist?
Does treeset allow duplicates?
Windows 
