What is hashing technique? Describe in brief.
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 |
What is quick sort?
Can a hashset contain duplicates?
Can an arraylist be null?
What are different types of sorting algorithms?
Define dynamic data structures?
Explain what are the major data structures used in the rdbms?
What is the purpose of thread?
Explain about the different lists available in the collection?
Is it legal to initialize list like this?
How do you clear a stack?
Is treeset synchronized?
What data type is enum?