Hashing Algorithm
Hashing is basically what it is a searching technique and in searching of some data. If you use it. This hashing technique then the time taken is that is a constant time. THe main thing is in data processing is the main or the common paradigm is to store the data and after that to retrieve that data. IN this video I am going to discuss with you this chaining method. How to use this method to resolve the collision. In. The video I'll discuss all these techniques with the help of example. So in this video we'll discuss the techniques. In closed hashing three methods are there to resolve collision. See you can not remove the collision. You can only minimize the collision Okay. What is closed addressing. This is also known as open hashing and in this case what method is used to resolve the collision that is. Chaining method okay Okay now let us we have one hash table. This hash table. What is the value 9. 18. 18. 18 plus 3 is 21 21. More 10 is 1 here at one position at one index. You can store this 9.. Chaining method can be used to resolve the collision in keynesian. The next video I'm going to show how the staining method is used to solve the collision.. THe technique is the technique you will use chaining method separate chaining. The video will show the technique being used in a different way of resolving collisions.. Linear probing method will be used to resolve the or to minimize the collision Okay now let 's kiss the linear probing method with the help of same question. The same question is there. These are the keys same hash function is there to k plus 3 same. You have to use division method. Only the changes you 're supposed to use open addressing. THe size of this hash table is 0 to 9 then go backward and this one is 0. The order of element in the hash table would be you has applicant. start over from 0 zero-please 13 then 9 then 12. Then you will not write the sex directly. One in two places are free.. The order of the order of elements in the hash table is three. Two. These are blank then six, then 11, then two, then seven and then three. Karenia is Karenia, Karenia and Karenia are Karenia. THe first free location was this one sixth place and the second free place was sixth place. Nick Nick Nick said y'all grab circle together so this is the basic idea of linear probing and next video
Written for
- Institution
- MAKAUT University
- Course
- Data Structure and Algorithm
Document information
- Uploaded on
- March 19, 2023
- Number of pages
- 6
- Written in
- 2022/2023
- Type
- Class notes
- Professor(s)
- Nil
- Contains
- All classes
Subjects
-
dsa
-
hashing alforithm