Last Minute Notes Digital Electronics
With hours remaining before your GATE exam, this rapid-revision section consolidates the most frequently tested facts in Digital Electronics. Read carefull...
Quick Revision: Number Systems, Boolean Laws, and Gate Identities
With hours remaining before your GATE exam, this rapid-revision section consolidates the most frequently tested facts in Digital Electronics. Read carefully, visualize each concept, and mentally verify each rule before moving on.
Number system conversions: to convert from decimal to binary, repeatedly divide by 2 and collect remainders bottom-up. For hexadecimal, group binary digits in sets of four from the right. For octal, group in sets of three. Two's complement of a number: invert all bits and add 1. Overflow in two's complement addition occurs when two positive numbers sum to a negative result or two negative numbers sum to a positive result — the carry into the sign bit does not equal the carry out of the sign bit.
Boolean identities to internalize: A AND 0 equals 0, A OR 1 equals 1, A AND A equals A, A OR A equals A, A AND A-complement equals 0, A OR A-complement equals 1. De Morgan's first theorem: complement of (A AND B) equals (A-complement OR B-complement). De Morgan's second theorem: complement of (A OR B) equals (A-complement AND B-complement). These are the backbone of all expression simplification on GATE.
Canonical forms: SOM lists minterms (rows where output is 1). POM lists maxterms (rows where output is 0). The complement of SOM(m0, m2) equals POM(M0, M2) — the same indices appear in both forms.
K-map rules in thirty seconds: groups must be rectangular with size a power of 2, cells wrap around edges, use the fewest and largest possible groups, each group corresponds to one product term in SOP, don't-cares can be included if they help form larger groups.
Gate count and NAND/NOR universality: any Boolean function can be built using only NAND gates or only NOR gates. NAND is OR with inverted inputs; NOR is AND with inverted inputs — apply De Morgan to convert.
Flip-flop excitation tables are critical for sequential circuit design: D flip-flop needs D equal to the next state. JK flip-flop: to go from 0 to 0, set J=0, K=X; from 0 to 1, J=1, K=X; from 1 to 0, J=X, K=1; from 1 to 1, J=X, K=0. T flip-flop toggles when T=1. These tables must be memorized for quick question solving.
Quick Revision: Combinational and Sequential Circuit Summary
This section provides a tight summary of combinational and sequential circuit concepts that GATE recycles across years. Use this as a final checklist before your exam.
MUX key facts: a 2-to-the-n-to-1 MUX has n select lines. To implement any function of n+1 variables with a 2-to-the-n-to-1 MUX, treat n variables as select lines and evaluate the function for each select combination to determine the data inputs. Demultiplexers do the reverse — one input routed to one of 2-to-the-n outputs.
Decoder: n-to-2-to-the-n structure. Output i is 1 only when input equals i. Any SOP can be realized by connecting appropriate outputs to an OR gate. A 3-to-8 decoder can implement any 3-variable function with at most one OR gate.
Half adder: Sum = A XOR B, Carry = A AND B. Full adder: Sum = A XOR B XOR Cin, Cout = AB + BCin + ACin. Ripple carry adder delay for n bits = n times the full adder delay. Carry lookahead computes all carries in parallel using generate G = AB and propagate P = A XOR B.
Subtraction using two's complement: A minus B equals A plus two's complement of B. No separate subtractor needed.
Shift registers: SISO (serial-in serial-out) — data shifts one bit per clock. PISO loads parallel data and shifts out serially. SIPO accepts serial input and presents parallel output. A universal shift register can do all of these.
Counter modulus: a mod-N counter has N distinct states. A 3-bit binary counter is mod-8. To build mod-5, use 3 flip-flops with feedback to reset at count 5.
State machine tip: Moore machines are easier to implement because output depends only on state, so no extra combinational logic ties output to input simultaneously. Mealy machines need fewer states but outputs can change mid-clock cycle, creating glitches.
Hazards in combinational circuits: static-1 hazard occurs when output momentarily goes to 0 during a transition between two 1-output states. Eliminate by adding a consensus term. Knowing hazard theory earns you marks in GATE theoretical questions even without circuit simulation.
Quick Revision: Key Formulas and Last-Minute Problem Patterns
This final rapid-revision block covers formulas, edge cases, and problem patterns that GATE regularly uses to separate prepared students from unprepared ones. Absorb these carefully.
Number of minterms: a function of n variables has exactly 2-to-the-n minterms. Number of distinct Boolean functions of n variables = 2 raised to (2 raised to n). For 2 variables this is 16 functions; for 3 variables this is 256 functions. GATE sometimes asks this directly.
Minimal SOP versus minimal POS: a minimal SOP groups 1s on the K-map; a minimal POS groups 0s. The number of literals in each may differ — one form may not always be simpler than the other. Check both when minimization is asked.
XOR properties for quick computation: A XOR 0 = A, A XOR 1 = A-complement, A XOR A = 0, A XOR A-complement = 1. XOR is its own inverse: (A XOR B) XOR B = A. These identities help solve parity generator/checker questions in seconds.
Parity: even parity means XOR of all bits including parity bit equals 0. Odd parity means XOR equals 1. A single-bit error flips parity; double-bit errors go undetected. Hamming code can detect and correct single-bit errors.
Propagation delay: in a combinational circuit, total delay equals the longest path from input to output measured in gate delays. For a ripple carry adder, longest path goes through all carry chains, so delay = 2n gate delays for an n-bit adder if each full adder is two gate levels deep.
Latch versus flip-flop: a latch is level-triggered (transparent while enable is high); a flip-flop is edge-triggered (captures input only on clock edge). GATE distinguishes these in timing questions.
Race condition in sequential circuits: occurs when two signals change simultaneously and their relative timing determines circuit behavior. Synchronous design eliminates races by clocking all elements together.
Final exam tip: for questions with truth tables, write the canonical SOM immediately. For state machine questions, build the next-state table column by column. For circuit delay questions, trace the critical path manually. Time management wins GATE — 2 minutes per mark is your budget.