Digital Electronics Quick Revision Notes
By Nihar Padave (@niharrr_.28)
1. Boolean Algebra Rules
● A + A = A
● A + A' = 1
● A * A = A
● A * A' = 0
● A + 0 = A
● A * 1 = A
2. Logic Gate Truth Tables
Input A Input B AND OR XOR NAND NOR
0 0 0 0 0 1 1
0 1 0 1 1 1 0
1 0 0 1 1 1 0
1 1 1 1 0 0 0
3. K-Map Simplification Steps
1. Plot values in Karnaugh Map (2, 3 or 4 variable)
2. Group 1s in power of 2s: 1, 2, 4, 8
3. Form simplified equation by combining groups
4. Number System Conversions
● Binary to Decimal: Multiply each bit with 2^position and add
● Decimal to Binary: Divide by 2 repeatedly, write remainders in reverse
● Hex to Binary: Replace each hex digit with 4-bit binary equivalent
5. Flip-Flop Summary
Type Characteristic Equation Output Change On
SR Q(n+1) = S + R'Q S = 1 or R = 1
JK Q(n+1) = JQ' + K'Q J = 1 or K = 1
D Q(n+1) = D Clock Edge
T Q(n+1) = T'Q + TQ' Toggle
6. Important Formulas
● Number of minterms = 2^n (where n = no. of variables)
● Propagation delay = No. of gates × Delay per gate
● Fan-out = Number of inputs driven by output
Follow me on Instagram @niharrr_.28
Stay tuned for more revision guides!
End of Notes