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
What is the need of sorting?
Is pointer a variable?
Explain the Linked List
Is hashmap sorted?
How to reverse singly link list?
How many null values are allowed in hashmap?
Which is best book for data structures?
What is the order of b tree?
What is the purpose of thread?
What are the applications of priority queues?
Who created quicksort?
Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
What are the topics in data structures?
What member function places a new node at the end of the linked list?
What are the properties of binary heap?
