Digital Logic
26 articles in this topic
Sequential Circuits in Digital Electronics: Flip-Flops, Registers and a Worked Mod-4 Counter
Learn to trace sequential logic edge by edge, then design and verify a two-bit synchronous counter using state tables, D-input equations and timing constraints.
Number Representation in Digital Electronics: Conversions, Complements and Worked Examples
Learn number representation through exact conversions, signed encodings, binary arithmetic, special codes, fixed point and IEEE 754 worked examples.
Logic Gates in Digital Electronics: Truth Tables, Boolean Expressions and Worked Examples
Learn the seven basic logic gates, build and minimise a complete three-input truth table, then implement the result using only NAND gates. Hardware bubbles and delay paths are included.
Digital Systems and Boolean Algebra Basics: Complete Guide with a Worked Example
Connect bits, truth tables, Boolean laws, canonical forms, K-maps, and gates by following one three-input function from specification to a simplified circuit.
Digital Electronics for GATE: Official Syllabus Map, Weightage Logic and Prep Order
Turn the compact GATE CS Digital Logic syllabus into a practical study sequence, then learn how to audit past-paper weightage without treating it as a forecast.
Combinational Circuits in Digital Electronics: Design, MUX, Decoders and Worked Examples
Learn a repeatable method for converting a logic specification into a verified combinational circuit, then apply it to adders, multiplexers, decoders, parity and hazards.
Boolean Minimization in Digital Electronics: Laws, K-Maps and Worked Examples
Learn to reduce Boolean expressions with auditable algebra, legal K-map groups, don't-cares, and truth-table checks. Includes complete SOP and POS examples.
Shift Registers, Ring and Johnson Counters for GATE: Frequency Division and Timing Numericals Solved
Build a 4-bit ring counter and Johnson counter state by state, then use their mod values to solve frequency-division and maximum-clock questions.
Universal Gates for GATE: Realizing Any Function with Only NAND or Only NOR, and Counting the Minimum Gates
Turn SOP into NAND-only and POS into NOR-only circuits, count every gate, and learn the exact two-input counts for AND, OR, XOR and XNOR.
Multiplexer Realization for GATE: Implementing Any Boolean Function with a Smaller MUX, Solved
Learn why a smaller MUX is enough for a Boolean function, then wire a complete 4:1 example without guessing any data input.
Flip-Flop Conversion for GATE: Excitation Tables and the SR, JK, D, T Conversion Recipe, Solved
Convert one flip-flop into another with the target transition, the available device's excitation table and a K-map. The solved JK-to-T case shows every row.
Sequential circuits: flip-flops, latches and counters explained
Sequential circuits for GATE: SR, D, JK and T flip-flops, excitation tables, latch versus flip-flop, and a fully worked synchronous counter design example.