N/APosted on - 03/09/2015
Hello! What is Hashing in Computer Science? Is it a data structure or not? What are its uses and when and how is it used in computer science? What are Hash Tables in Computer Science and when are they used? Are they based on the principles of hashing or not?
Hashing and Hash Tables in Computer Science
“Hashing” means in the terms of Computer Science that it is a transformation of some string characters into a shorter fixed length value.
Yes, “Hashing” is a “Data Structure” which is used in Computer Science.
The uses of “Hashing” are as follows:
It is used to index database items.
It is used to retrieve database items.
It is also used to for finding an item faster.
It is used for finding the original values.
It is used for implementing an associative array.
It is also used to compute index into array of buckets and slots.
In Computer Science, it is used as a “Hash Function”, “Hash table” and for “Collision resolution”.
In Computer Science, “Hash Table” is a data structure which is used to implement an associative array and a structure which can map the keys into values. “Hash Table” are used, when:
Implementing an associative array.
Compute index into array of buckets and slots.
Yes, the “Hash Table” is always based on the principles of “Hashing”.
Hope this answer will help you a lot.