Digital Logic
~7 marksBoolean algebra, K-maps, logic gates, flip-flops, and state machines.
4 Topics
Boolean Algebra & K-Map Minimization
Boolean algebra provides the mathematical foundation for digital circuits. Karnaugh maps offer a graphical method to minimise Boolean expressions into minimal SOP or POS forms.
Combinational Circuits
Combinational circuits produce outputs purely based on current inputs with no memory. GATE tests adders, multiplexers, decoders, encoders, and their implementations using gates.
Sequential Circuits — Flip-Flops & State Machines
Sequential circuits have memory; outputs depend on current inputs AND past state. GATE tests flip-flop types, state diagrams, state tables, and Moore vs Mealy machines.
Number Systems & Arithmetic
Computers represent numbers in binary, octal, and hexadecimal. GATE tests 2s complement arithmetic, signed number representation, IEEE 754 floating point, and BCD.
Sign in to track your progress across topics.