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
State the advantages of using infix notations?
Tell me the difference between the character array and a string.
Is hashtable throw concurrentmodificationexception?
Does arraylist have index?
Can we change load factor of hashmap?
Is array static or dynamic?
What are the issues that hamper the efficiency in sorting a file?
What is the best data structure and algorithm to implement cache?
What sorting algorithm should be used for sorting strings?
How long does it take to master data structures and algorithms?
What is Another name of Dynamically allocating memory.
What is binary tree? Explain its uses.
Give us a program to reverse a linked list.
Differentiate between priorityqueue and treeset.
How does quick sort work?
