Data & Hashing
Explore data representation, hash functions, hash tables, and probabilistic data structures.
Recommended Prerequisites
These are recommendations - you can start this track at any time.
About this track
Explore data representation, hash functions, hash tables, and probabilistic data structures.
The Data & Hashing track collects 4 modules and 16 lessons into a single ordered path. Each module ends with a checkpoint quiz; passing the checkpoint unlocks the next module so you can track your progress without guessing whether the material has stuck.
You start with "Data Representation" and finish on "Bloom Filters & Probabilistic Data Structures". The whole track sits inside the Core Computing area of the curriculum, so the writing assumes the prerequisites listed above and skips ground that an earlier track has already covered.
What this track covers
- Data Representation — How computers represent text, images, sound, and floating-point numbers using binary.
- Hashing Fundamentals — Discover how hash functions turn arbitrary data into fixed-size fingerprints. Learn about determinism, the avalanche effect, collision resistance, and meet the hash functions that underpin modern computing.
- Hashmaps & Hash Tables — See how hash functions power the fastest general-purpose data structure. Understand buckets, collision resolution, load factors, rehashing, and why hashmaps give you O(1) lookups.
- Bloom Filters & Probabilistic Data Structures — When approximate answers are good enough. Learn about bloom filters, count-min sketch, HyperLogLog, and why trading precision for speed and space is sometimes the smartest move.
How the track works
Every lesson is a short page with diagrams, runnable examples, and the kind of edge-case footnotes you usually only find in textbooks. Where it makes sense, the lesson is paired with a CPU simulation or a coding challenge so you can poke at the idea instead of just reading about it.
The lessons themselves are free to read with a free account. The 4 checkpoint quizzes that gate the next module are also free, as are the lesson IDE and CPU simulations. Optional 777-tier tools — the step-through debugger, decompiler, ROP gadget builder, heap visualiser, and exploit labs — sit alongside the lessons but are not required to follow the track from start to finish.
You can jump in at any point. Be Bitwise is built around a free forever curriculum, with no time limits and no expiring access. Pick the next lesson when you have an hour; come back when you do not.