of the NAND gate is C = (A . B) Read this as "C" equals NOT of A AND B" or "C" equals the complement of A AND B". For example if both the inputs are Chapter Page - - C = ( . )= = The truth table for NAND gate is Input Output A B C Table .
Truth Table for NAND Gate . . Bubbled OR Gate The logic circuit of bubbled OR gate is A A B B C=A + B Fig. .
Logic Circuit of Bubbled OR Gate The output of this circuit can be written as C = A + B The above circuit can be redrawn as the bubbles on the input, where the bubbles represents the inversion. A B C Fig. . Logic Symbol of Bubbled OR Gate We refer this as bubbled OR gate.
The truth table for the bubbled OR is Input Output A B C Table . Truth Table for Bubbled OR Gate If we compare the truth tables of the bubbled OR gate with NAND gate, they are identical. So the circuits are interchangeable. Therefore, (A .
B) = A + B Which establishes the De Morgan's second theorem. . . XOR Gate The XOR (exclusive - OR) gate acts in the same way as the logical "either/or." The output is "true" if either, but not both, of the inputs are "true".
The output is "false" if both inputs are "false" or if both inputs are "true." Another way of looking at this circuit is to observe that the output is if the inputs are different, but if the inputs are the same. The logic circuit of XOR gate is A B A C = A.B+ A.B A A.B B A.B B Fig. . Logic Circuit of XOR Gate The output of the XOR gate is The truth table for XOR gate is Input Output A B C Table .
Truth Table for XOR Gate In boolean algebra. exclusive - OR operator ⊕ or "encircled plus". Hence C = A ⊕