Descriptive Review on Collision Resolution Technique in Data Structure
Main Article Content
Abstract
A situation when the resultant hashes for two or more data elements in the data set U, maps to the same location in the has table, is called a hash collision. In such a situation two or more data elements would qualify to be stored/mapped to the same location in the hash table. to resolve the problem of collision we use collision resolution technique. There are some useful technique with the help of them we can reduce collision from hash table
Article Details
Section
How to Cite
References
[1].Wikipedia
[2].http://research.cs.vt.edu/AVresearch/hashing/introduction.php
[3].http://www.cs.cornell.edu/courses/cs312/2008sp/lectures/lec20.html
[4].http://faculty.kfupm.edu.sa/ics/saquib/ICS202/Unit29_Hashing2.pdf
[5].Images are taken from Wikimedia commons.
[6].Nalluri, S. K., & Parasaram, V. K. B. (2016). Early Approaches to Robotic
Process Automation in Enterprise Systems. International Journal of Humanities
and Information Technology, 1(01), 12-28.
https://doi.org/10.21590/ijhit.01.01.06
[7.]Parasaram, V. K. B., & Nalluri, S. K. (2016). A Comparative Analysis of
Risk Management Frameworks in Enterprise IT Projects. SAMRIDDHI : A
Journal of Physical Sciences, Engineering and Technology, 8(02), 147-155.