Hashing & Hash Functions
Understand how hash functions work, their properties, and why broken hashes like SHA-1 are dangerous.
0%
Confidence · no data yet
After this skill you can…
- Explain the four properties of secure hash functions
- Identify SHA-1, SHA-256, and bcrypt use cases
- Audit dependencies for weak hash usage
Prerequisites
Watch (10 videos)
CS50 2014 - Deep Thoughts - Hash Table
→ Design hash functions→ Resolve collisions
CS50 2014 - Week 6
→ Use hash functions→ Handle collisions→ Optimize hash table performance
Week 7: Monday - CS50 2009 - Harvard University
→ Optimize hash tables→ Use trees and binary search trees
Understanding Hashmaps | Geeks Classes Live | GeeksforGeeks
→ Use Hash functions→ Optimize data storage
Hash table double hashing
→ Implement double hashing in a hash table→ Understand the trade-offs between different hashing techniques
Organize fruits with a hash table
→ Design a hash function→ Optimize hash table performance
Internal Working of Hashmap | GeeksforGeeks
→ Resolve collisions in Hashmap→ Optimize Hashmap performance
Hash table quadratic probing
→ Implement hash tables with quadratic probing→ Resolve collisions using quadratic probing→ Explain the trade-offs between different collision resolution techniques
Hash Table Open Addressing Removals
→ Implement hash tables with open addressing→ Resolve collisions using linear probing, quadratic probing, and double hashing
DeepCamp AI