0
Well hash tables can store any type of data be it the fundamental data types like int, float, char or derived data types like structure , strings etc
Implementation in C++ at the Related link below.
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
What is hash key?
hash key is an element in the hash table. it is the data that you will combine (mathematical) with hash function to produce the hash.
Advantage and distadvantage in hash table?
ANSWER A hash table is a way to find data in an array, when you have a known key and an unknown value that corresponds to the key. You use a hashing function on the key to create an index into the hash table containing the value. In the ideal case, this directly returns the corresponding value. In the usual case, a collision can occur. This means that the hashed key points to multiple possible values. A hash table is usually used on large arrays that would take a long time to search using other methods. A hash table can be very fast and use very little memory, and does not require the array to be sorted. The source code is slightly more complicated than some search methods. With a poorly designed hashing function when the hashed keys do not correspond one-to-one with the values, the secondary search after a hash collision can take a large amount of time.
What is double hashing in data structure?
if collision is occurred in hash function then we can solve this problem by using double hash function
Can tables only display one type of data at a time?
Not necessarily. A table of structures can store a variety of data types provided the structures themselves are of the same type.
What is a hashing algorithm?
hashing algorithm contain two components - hashing function & collision. hashing is mechanism which generally used in random file organization to convert the record key value into address.
What is hash key?
hash key is an element in the hash table. it is the data that you will combine (mathematical) with hash function to produce the hash.
Define hashing and describe briefly including types of hashing and where it is used and advantages and disadvantages of hashing?
Hashing is performed on arbitrary data by a hash function. A hash function is any function that can convert data to either a number or an alphanumeric code. There are possibly as many types of hashing as there are data. How precisely the hash function works depends on what data it is meant to generate a hash code from. Hashing is used for a variety of things. For example, a hash table is a data structure used for storing data in memory. Instead of iterating through the structure to find a specific item, we associate a key (hash code) to a particular item (data). A hash code can be generated from a file or disk image. If the data does not match the code, then the data is assumed to be corrupted. Hashing has the advantage of taking a larger amount of data and representing it as a smaller amount of data (hash code). The code generated is unique to the data it came from. Generating a hash code can take time however, depending on the function and the data. Some hash functions include Bernstein hash, Fowler-Noll-Vo hash, Jenkins hash, MurmurHash, Pearson hashing and Zobrist hashing.
What is hash table in sql?
temp table
What is the major advantage of a hash table?
The major advantage of a hash table is its speed. Because the hash function is to take a range of key values and transform them into index values in such a way that the key values are distributed randomly across all the indices of a hash table.
Insert value into hash table?
Insertion in hash tables is based on a 'key' value which is calculated on the basis of a hash function. This hash function generates the key based on what type of data it is fed. For example hash function for an integer input might look like this : int hash(int val) { return (val%101); } where return value of hash function would become a key. Complete implementation can be found at: http://simplestcodings.blogspot.com/2010/07/hash-table.html
What is a MS Access table?
A table in any database is where the data of certai types is stored. I.e. Address table
Which of the following do you need to consider when you make a table in SQL?
Data types
Is a table is the best way to simultaneously display data types?
true
Advantage and distadvantage in hash table?
ANSWER A hash table is a way to find data in an array, when you have a known key and an unknown value that corresponds to the key. You use a hashing function on the key to create an index into the hash table containing the value. In the ideal case, this directly returns the corresponding value. In the usual case, a collision can occur. This means that the hashed key points to multiple possible values. A hash table is usually used on large arrays that would take a long time to search using other methods. A hash table can be very fast and use very little memory, and does not require the array to be sorted. The source code is slightly more complicated than some search methods. With a poorly designed hashing function when the hashed keys do not correspond one-to-one with the values, the secondary search after a hash collision can take a large amount of time.
Is hashish a depressant?
It really depends what type of hash your talking about. Some types of hash have depressants in them, but hash by itself is not considered a depressant.
When you sort data in a query the records in the underlying table are actually rearranged?
No. Most queries list off data, but does not affect the underlying data. Certain types of query can be used to change data in a table, but do not re-arrange the order of the data in the table itself. That is determined by the indexes, mainly the primary key. You can sort the data in the table itself and have it remain that way.
Hashing in DBMS?
Hashing is the technique of to retrieving the datas in the database. for example,we created one index for one main table,so how we can retrieve the index from that main table? ans- to using one function we can retrieve the data,that function is called hash function. hash function format is h(search key)=pointer or bucket identifier.
