Show understanding of a flip-flop (SR, JK)
15.2 Boolean Algebra and Logic Circuits
Boolean Algebra Basics
Boolean algebra is like a set of rules for a digital world where every variable can only be 0 (false) or 1 (true). Think of it as a recipe that tells you how to combine ingredients (logic signals) to get a tasty result (output). The main operations are:
- AND (∧): both must be 1 to get 1.
- OR (∨): at least one 1 gives 1.
- NOT (¬): flips 0 to 1 and 1 to 0.
Some useful identities:
$A \land 1 = A$
$A \lor 0 = A$
$A \lor \lnot A = 1$
$A \land \lnot A = 0$
Logic Gates
Logic gates are the building blocks of digital circuits. They implement the Boolean operations:
| Gate | Symbol | Truth Table | |||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| AND | ∧ |
|
|||||||||||||||
| OR | ∨ |
|
|||||||||||||||
| NOT | ¬ |
|
Flip‑Flops Overview
Flip‑flops are the memory cells of digital electronics. They store one bit of data and change state only on a clock edge. Think of them as tiny digital lockers that open (set) or close (reset) based on signals.
SR Flip‑Flop (Set‑Reset)
🔑 SR flip‑flop has two inputs: S (Set) and R (Reset). The output Q can be 0 or 1, and its complement Q? is always the opposite.
- When S=1 and R=0 → Q becomes 1 (set).
- When S=0 and R=1 → Q becomes 0 (reset).
- When S=0 and R=0 → Q retains its previous value (no change).
- When S=1 and R=1 → invalid state (both set and reset at once).
Truth table:
| S | R | Q (next) | Q? (next) |
|---|---|---|---|
| 0 | 0 | Q (unchanged) | Q? (unchanged) |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | X (invalid) | X (invalid) |
⚠️ Exam tip: Remember that the SR flip‑flop cannot have S=R=1. If you see this in a question, the answer is “invalid” or “undefined”.
JK Flip‑Flop (J‑K)
The JK flip‑flop fixes the SR problem by adding a toggle feature. Inputs J and K behave like S and R but also allow the output to flip when both are 1.
- J=0, K=0 → no change (hold).
- J=0, K=1 → reset (Q=0).
- J=1, K=0 → set (Q=1).
- J=1, K=1 → toggle (Q becomes ¬Q).
Truth table:
| J | K | Q (next) |
|---|---|---|
| 0 | 0 | Q (unchanged) |
| 0 | 1 | 0 |
| 1 | 0 | 1 |
| 1 | 1 | ¬Q (toggle) |
💡 Analogy: Think of a JK flip‑flop as a light switch that can be set, reset, or flipped to the opposite state depending on the button pressed.
⚠️ Exam tip: When given a JK table, you can derive the required input combinations by comparing the current Q and the desired next Q. Remember the toggle case (J=K=1).
Exam Tips & Quick Review
| Tip | Why It Matters |
|---|---|
| Always check for the invalid state in SR flip‑flops. | Questions may ask you to identify or avoid it. |
| Use the toggle property of JK flip‑flops to simplify logic. | It saves time when designing counters or state machines. |
| Draw truth tables before writing equations. | It helps spot patterns and reduces algebra mistakes. |
| Remember that Q? = ¬Q in all flip‑flops. | Useful for simplifying expressions. |
Happy studying! 🎓 Remember: practice drawing circuits and writing truth tables – the more you do, the easier it becomes. Good luck with your exams! 🚀
Revision
Log in to practice.