What is Hashing (BCA 3rd-sem)

Definition of Hashing

A hashing table identify different search operation use in data structure. With the help of hash table and key value. The primary of operation of Hashing function. The primary value of find corresponding. Hashing is the insertion and delectation form. 

Example of Hashing

1). Primary value:- Employee name

2). Corresponding value:- Employee address

A hash table the location or add person same through arithmetical or logical operation. With the help of key element of table. There are many operation use in hash table.

a). Insertion

b). Delectation

c). Arrange the data (sorting)

Read Also- Data Structure  (BCA-3rd- semester)

Hashing table location

Key.                          Index.                 Value

                                    

Student name.         0.               Student info

                                      1

                                      2

  Hashing function

                              

A well define mathematical function which convert of data large amount of the small number of a data index. With the help of key value element . It value written of hash function known as hash value. There are basic requirement for hash function.

a). Input value

b). Output value

c). Key element

d).Type of array

e). Hashing function address

Property of hash function

• Continuous process
• Low cost
• Variable range
• Uniform
• Small hash value

Types of hash function

• Division hash function
• Mid sequence hash function
• Floating hash function
• Multiple hash function