Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / pavan
Hash Table: is a data structure in which keys are mapped to array positions by a hash function. This table can be searched for an item in O(1) time using a hash function to form an address from the key. The easiest way to conceptualize a hash table is to think of it as an array. When a program stores an element in the array, the elements key is transformed by a hash function that produces array indexes for that array.
Hash Function: is a function which, when applied to the key, produces an integer which can be used as an address in a hash table. The intent is that elements will be relatively randomly and uniformly distributed. In the example above the code for the hash function would look like this (assuming TABLE_SIZE was defined 100):
| Is This Answer Correct ? | 5 Yes | 1 No |
Post New Answer View All Answers
Tell me about circular linked list?
Name the areas in which you can apply data structures extensively?
Explain Queue
How can we delete the first node from the singly linked list?
Write a program for reversing the Single Linked List?
What is a B tree?
What are the disadvantages array implementations of linked list?
What is two-dimensional array?
What is the minimum number of nodes that a binary tree can have?
If we try to add duplicate key to the hashmap, what will happen?
What is binary tree and its types?
What is the method to find the complexity of an algorithm?
What do you know about different sorting algorithms?
What is entryset method in map?
Is selection sort greedy?
