What is a hashing algorithm?

Answer 1

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.

Answer 2

A hashing algorithm takes a variable length data message and creates a fixed size message digest.

When a one-way hashing algorithm is used to generate the message digest the input cannot be determined from the output

Answer 3

In dsata structure a hash table or hash map is a data structure that uses ahash function to efficiently map certain identifiers or keys (e.g., person names) to associatedvalues (e.g., their telephone numbers). The hash function is used to transform the key into the index (the hash) of anarray element (the slot or bucket) where the corresponding value is to be sought. Ideally the hash function should map each possible key to a different slot index, but this ideal is rarely achievable in practice (unless the hash keys are fixed; i.e. new entries are never added to the table after creation). Most hash table designs assume that hash collisions - pairs of different keys with the same hash values - are normal occurrences and must be accommodated in some way. In a well-dimensioned hash table, the average cost (number of instructions) for each lookup is independent of the number of elements stored in the table. Many hash table designs also allow arbitrary insertions and deletions of key-value pairs, at constant average (indeed,amortized[1]) cost per operation.[2][3] In many situations, hash tables turn out to be more efficient thansearch trees or any other table lookup structure. For this reason, they are widely used in many kinds of computer software, particularly forassociative arrays, database indexing,caches, and sets.

Answer 4

Hashing technique is the very efficient method in the searching to the exact data item in a very short time.

Hashing is the process in which we place the each and evey data item at the index of the memory location for the purpose of ease of usability.

Answer 5

Hashing is an algorithm (hash function) to convert a string of characters into a fixed sized text using mathematical functions. The file to be hashed is known as “input” the algorithm used in known as ”hash function” and output is called “Hash Value”, some people call hash value as message digest. Hash value is the value that dictates what exactly in this file and always produces hexadecimal value.

Let’s put it in this way, let’s assume you have many letters at your home from telecommunication companies. You take all of the letters and put that into an envelope and close it. On that envelope you write “Telecom letter”. Now whenever you need to look for letters from telecommunication companies you will look for an envelope with “Telecom letter” on it.

In this case “Telecom letter” is the hash value of all letters you stored from the Telecom company in that envelope. That makes the envelope different from other envelopes you have in your home.

Learn more on: Networkingmania

Answer 6

md5 hashing is a algorithm.it is also called as message digest algorithm.it is used for authentication purpose when we are sending the message from sender side to receiver side.