what is hashing
Answers were Sorted based on User's Feedback
Answer / bipinmca07
Hsshing is a way retrieving records from memory in faster
way.Record is inserted into memory by using hash function
(division,midsqure,folding,digit analysis)and also records
are retrieved using same hash function
Is This Answer Correct ? | 58 Yes | 3 No |
Answer / venukumar
Hashing is a search method that require data to be
organized in a specific manner.It uses a Hash Table(HT) to
store the data items.
Is This Answer Correct ? | 10 Yes | 1 No |
Answer / swapnil
hashing is nothing but which provides fast access to
retrival of data using hash function
Is This Answer Correct ? | 10 Yes | 3 No |
Answer / 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 |
Answer / umesh
Hashing is a way to retrieve/store data on a constant time
independent of the value and position of the data present.
The position is a typically a function of the data stored.
Is This Answer Correct ? | 6 Yes | 3 No |
Answer / surendra gour
Hashing is the technique to search data.Its main purpose to
eliminate the unnecessary searching time by using the direct
addressing method.
Is This Answer Correct ? | 0 Yes | 3 No |
Answer / nilesh
Hashing is a fastest way to retrieve and insert the date
using hash function
Is This Answer Correct ? | 3 Yes | 8 No |
Can hashmap be sorted?
Calculate the efficiency of sequential search?
Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.
How do you implement a stack?
How would you use qsort() function to sort the name stored in an array of pointers to string?
How do you do a heap sort?
What is a linear search?
How do I push an element into a stack?
What does quick sort do?
In an AVL tree, at what condition the balancing is to be done?
How memory is reserved using a declaration statement in data structure?
What is a circular singly linked list?