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
How many times is merge sort called?
Define secondary clustering?
What is max heapify?
What does a treemap do?
What is list data structure?
What is hashing technique?
How many links are there in a binary tree of N nodes?
What are the advantages of binary search over linear search?
What is Another name of Dynamically allocating memory.
Is array part of collection framework?
Does treemap allow null key?
How many types of linked lists are there?
What are common data structures?
write a code for Implementation of stack and queues.
Why is merge sort faster?
