Hashing (3.1) Flashcards
1
Q
Hashing
A
Process of taking an input and performing some form of calculation on input that’d output value of fixed size
2
Q
Why is hashing extremely secure?
A
It cannot be reversed to get back to original input
3
Q
2 uses of hashing
A
- Storing passwords
- Creating hash tables
4
Q
Hash table
A
Array which is coupled with hash function
5
Q
Collision
A
When 2 keys produce same hashed value
6
Q
How is data in hash tables able to be accessed so fast?
A
Keys have unique 1-to-1 relationship with address at which they’re stored
7
Q
Load factor
A
Way of indicating how full hash table is
8
Q
Formula of load factor
A
No. of occupied elements in hash table ÷ total no. of elements in hash table
