0
If you read up on hashing, why hashing is done, what are its uses. Then you will be able to answer your own question. More to the point you will have studied the material that your homework question is intended to make you study. It is educational.
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
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
Why do you use hashing and not array?
Hashing provides a method to search for data.Hashing provides a method to search for data.Hashing provides a method to search for data.Hashing provides a method to search for data.
What is the difference between passing an array and passing single value data to a function?
Passing a single value to a function is often just a simple integer. But passing an array, character string or other data structure is typically "pass by reference", or in other words, the calling statement will 'point to' the place in memory where the data structure resides.When a function is called using a pointer to a data structure, both the calling environment and the called function are referencing the same data; any changes made to the data in the structure by the function will have changed the data that the original calling environment sees.However, when a value is passed to a function, the function creates it's own copy of the value, and can change it in any way without changing the original value.
Which hashing function uses 160-bit digest?
SHA-1 is a function that uses 160-bit digest.
What are the subject-matters of data structure?
types of data structure types of data structure
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
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.
Which hashing function includes 128-bit hash value and is often used to verify the intergrity of data?
MD5
What is Homomorphic Hashing?
Homomorphic Hashing is a algorithm technique used for verifying data.
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.
Why do you use hashing and not array?
Hashing provides a method to search for data.Hashing provides a method to search for data.Hashing provides a method to search for data.Hashing provides a method to search for data.
What is the difference between passing an array and passing single value data to a function?
Passing a single value to a function is often just a simple integer. But passing an array, character string or other data structure is typically "pass by reference", or in other words, the calling statement will 'point to' the place in memory where the data structure resides.When a function is called using a pointer to a data structure, both the calling environment and the called function are referencing the same data; any changes made to the data in the structure by the function will have changed the data that the original calling environment sees.However, when a value is passed to a function, the function creates it's own copy of the value, and can change it in any way without changing the original value.
Explain the distinction between closed an open hashing discus the relative merits of each technique in database application?
Closed hashing involves storing all key-value pairs directly in the hash table, while open hashing involves using separate data structures (such as linked lists) to handle collisions. Closed hashing typically has better memory management and faster access times for non-colliding keys, while open hashing can handle a larger number of collisions without needing to resize the hash table. In database applications, closed hashing may be preferred for smaller datasets with minimal collisions, while open hashing may be more suitable for handling large volumes of data with frequent collisions.
Explain the distinction between closed an open hashing Discuss the relative merits of each technique in database application?
A hash table is where data storage for a key-value pair is done by generating an index using a hash function. Open Hashing (aka Separate chaining) is simpler to implement, and more efficient for large records or sparse tables. Closed Hashing (aka Open Addressing) is more complex but can be more efficient, especially for small data records.
Which hashing function uses 160-bit digest?
SHA-1 is a function that uses 160-bit digest.
Which hashing algorithm is used to verify the integrity of data that has been transmitted over a network?
MD5
What are different types of hashing techniques are there in DBMS?
there are 2 types of hashing techniques 1- Static hashing 2-Dynamic hashing
