Hashing is the process of mapping a large amount of data items to a smaller table with the help of hashing function. Hashing is also known as Hashing Algorithm or Message Digest Function. It is a technique to convert a range of key values into a range of indexes of an array.
In this “Hashing – Data Structure and Algorithms” you will learn about the following topics:
- General Ideas about Hashing
- Hashing, Hash Table, Hash Function
- Basic Operations in Hashing
- DataItem, Hash Method, Search Operation, Insert Operation, Delete Operation
- Hash Collision
- Techniques for Hash Collision Resolution
- Separate Chaining (Open Hashing)
- Open Addressing Or Closed Hashing
- Linear Probing, Implementation of Hash Table with Linear Probing
- Quadratic Probing, Implementation Of Hash Table With Quadratic Probing
- Double Hashing, Implementation of Hash Table with Double Hashing
- Good Hash Functions
- Division Method, Multiplication Method, Universal Hashing
- Implementing Hash Table in C
- Rehashing
- Why Rehashing is done?
- How Rehashing is done?
- What is the Load factor in HashMap?
- Extendible Hashing
- Frequently used terms in Extendible Hashing
- Working of Extendible Hashing
- Example based on Extendible Hashing
==== Point to Note ====
If you like to contribute, you can mail us BCA Notes, BCA Question Collections, BCA Related Information, and Latest Technology Information at [email protected].
See your article appearing on BCA Notes (Pokhara University) main page with your designation and help other BCA Students to excel.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 Notes Pdf){kind=link}
0 Comments