Foundations path
Digital Electronics
The building blocks every chip starts from: number systems and binary arithmetic, logic gates and Boolean algebra, Karnaugh maps, combinational and sequential circuits, finite state machines, fast adders, multipliers, floating point, and error correction.
- 11
- lessons
- Beginner
- level
- Free
- every lesson
Digital Electronics
- 1Number Systems & Binary ArithmeticBinary, octal, decimal and hexadecimal, how to convert between them, and how a circuit adds and subtracts using two's complement.
- 2Logic Gates & Boolean AlgebraThe seven basic gates with their truth tables and symbols, why NAND and NOR are universal, and the Boolean algebra rules that let you simplify an expression by hand.
- 3Karnaugh Maps (K-Maps)Simplifying a Boolean function visually instead of algebraically, why the map is laid out in Gray-code order, grouping rules, don't-care conditions, and a full worked example.
- 4Combinational Logic CircuitsCircuits whose output depends only on the current inputs: half and full adders, ripple-carry addition, multiplexers, decoders, encoders and magnitude comparators.
- 5Sequential Logic CircuitsCircuits that remember: SR and D latches, the master-slave D flip-flop, setup and hold time, and why a flip-flop is built from two latches instead of one.
- 6Finite State Machines (FSM)Moore and Mealy machines, state diagrams and state tables, and a fully worked sequence-detector example in both styles.
- 7Digital Electronics Interview Q&AShort, direct answers to the questions interviewers actually ask about number systems, gates, K-maps, adders and sequential logic, gathered from the earlier lessons in this path.
- 8Fast Adders: Carry LookaheadWhy ripple-carry addition is too slow for a wide adder, how generate and propagate signals compute every carry directly, and a fully worked 4-bit example.
- 9Multipliers and Barrel ShiftersArray multiplication built from adders, and barrel shifters that shift or rotate by any amount in one pass using a chain of 2-to-1 muxes.
- 10Fixed-Point and Floating-Point RepresentationRepresenting fractions in binary: fixed-point Q formats, IEEE 754 single-precision floating point, a fully worked encoding example, and the standard's special values.
- 11Error Detection and CorrectionParity bits, why they can only detect and not correct, and a fully worked Hamming(7,4) example that both detects and corrects a single-bit error.