What is hashing technique?
Answer / Arvind Saini
Hashing Technique refers to a method of converting data of arbitrary size, such as a string or number, into a fixed-size value (hash value or hash code) using a mathematical function called the hash function. This process is used in various applications like password storage, error detection, and indexing.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is the difference between a stack and an array?
How many sorting algorithms are there?
Can we create a null as a key for a map collection?
What is ds tree?
Why you need a data structure?
What is stack in geography?
Define the graph data structure?
why do tree always takes o(log n) time?
What is array define its types?
What is the idea behind splaying?
What is the slowest sorting algorithm?
How will you free the memory that is allocated at run time?