What is hashing technique? Describe in brief.
- 1 Answers
- 1136 Views
- I also Faced
- E-Mail Answers
Answer / Kapil Deol
Hashing is a technique used to map keys or values to indices in an array, providing quick data access with constant time complexity (O(1)). The hash function takes an input key and produces a unique index in the hash table. Collisions may occur when multiple inputs produce the same index, which can be managed using various collision resolution methods like chaining and open addressing.
| Is This Answer Correct ? | 0 Yes | 0 No |
Is sorting a math skill?
What is dequeue in data structure?
What is the difference between array list and vector list?
Can we change the size of an array at run time?
Can we add elements to final list?
How to reverse a singly linked list?
Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements.
What is the complexity of arrays sort?
List the area of applications where stack data structure can be used?
How to cut or remove an element from the array?
how to delete first node from singly linked list?
What method removes the value from the top of a stack?
Windows 
