Computer Science › Section B · Data storage › Topic B.1
Bits, gates, and flip-flops
Everything a computer holds, from a photo to a program, comes down to millions of switches that are either on or off. This topic shows how those two-state values are combined by logic gates, how a circuit can remember a single bit, and how people write long bit patterns compactly.
In this topic
- Bits are symbols
- Boolean operations
- Truth tables
- Gates: Boolean operations in hardware
- Worked example: a half adder
- A circuit that remembers
- Worked example: setting the latch
- Hexadecimal notation
- Worked example: converting with hex
- Common mistakes to avoid
- Key takeaways
This topic is part of Wuanberri Pro. Checking your access…