Classify the Hashing Functions based on the various methods by which the key value is found.
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 |
What is a minimum spanning tree?
Which interfaces are implemented by concurrentskiplistset?
What is the use of threaded binary tree?
Define circular list?
Can you have an arraylist of arrays?
What is data structure and why we need them?
What is heap tree explain with example?
What is application of data structure?
State the properties of a binary tree?
What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest?
19 Answers ABB, SDE,
Explain the Linked List
What is the use of placement new?