Study on Hashing Techniques
dc.contributor.author | Khan, Md. Nazmul | |
dc.contributor.author | Ema, Suraiya Tasnim | |
dc.contributor.author | Jahan, Samia | |
dc.date.accessioned | 2018-05-30T04:10:59Z | |
dc.date.available | 2018-05-30T04:10:59Z | |
dc.date.issued | 2018-05-27 | |
dc.identifier.uri | http://dspace.uiu.ac.bd/handle/52243/249 | |
dc.description.abstract | The main aims of this thesis “Study on hashing techniques” are to get familiar with hash functions and hash background, knowing different hashing techniques and collision resolution techniques. It will help you to find out the most efficient way to make hash function for a specific types of data. Collision resolution techniques are also discussed in this paper. Load factor, advantage and disadvantage of different collision resolution techniques can be understood by reading this paper. Time complexity of different searching techniques and compared those techniques with hashing techniques. Proving why hashing is better than other searching techniques and be familiar with the objectives of hashing techniques. | en_US |
dc.language.iso | en | en_US |
dc.publisher | United International University | en_US |
dc.subject | hashing techniques | en_US |
dc.subject | Data Structure | en_US |
dc.subject | collision resolution | en_US |
dc.title | Study on Hashing Techniques | en_US |
dc.type | Thesis | en_US |
Files in this item
This item appears in the following Collection(s)
-
B.Sc Thesis/Project [82]