📖 Samacheer Kalvi · 11th TN - English Medium · Computer Science · Page 38question

Part - II - Boolean Algebra · Part 4

Chapter 2: Chapter 2 · Computer Science

Example

example if both the inputs are , C = ( + ) = = The truth table for NOR gate is Input Output A B C Table . Truth Table for NOR Gate Chapter Page - - . . Bubbled AND Gate The Logic Circuit of Bubbled AND Gate A B A C=A.B B Fig. . Logic circuit of Bubbled AND Gate In the above circuit, invertors on the input lines of the AND gate gives the output as C = ( A . B) This circuit can be redrawn as the bubbles on the inputs, where the bubbles represent inversion. A B C Fig. . Logic Symbol of Bubbled AND Gate We refer this as bubbled AND gate. Let us analyse this logic circuit for all input possiblities. If A = and B = C=( . ) = . = If A = and B = C=( . ) = . = If A = and B = C=( . ) = . = If A = and B = C=( . ) = . = Here the truth table is Input Output A B C You can see that, a bubbled AND gate produces the same output as a NOR gate. So, You can replace each NOR gate by a bubbled AND gate. In other words the circuits are interchangeable. Therefore (A + B) = A . B Which establishes the De Morgan's first theorem. . . NAND Gate The NAND gate operates an AND gate followed by a NOT gate. It acts in the manner of the logical operation "AND" followed by inversion. The output is "false" if both inputs are "true", otherwise, the output is "true". In otherwords the output of the NAND gate is if and only if both the inputs are , otherwise the output is . The logic circuit of NAND gate is A A.B C=A.B B Fig. . Logic Circuit of NAND Gate The logical symbol of NAND gate is A B C Fig. . Logic Symbol of NAND Gate The output

Related topics

Have a question about this topic?

Get an AI answer grounded in your actual textbook — with the exact page reference.

Ask AI about this topic →