Another example of truth table• Logic function:•3 inputs: A, B, C•3 outputs: D, E, F• D = T if at least 1 input is T• E = T if 2 inputs are T• F = T if 3 inputs are TTruth tables• Completely describe any function• can get big quickly• difficult to interpret the functionBoolean algebra• Alternative to truth table• Variables have 0 or 1 values• 3 operators: OR, AND, NOT• OR (+) : A + B• 1 if at least one input is 1• logical sum• AND (•) :• 1 if both inputs are 1• logical product• NOT ( ¯ ) : • 1 if input is 0• inversion• Gates implement these functions¯AA • BLaws of boolean algebraExample• Logic function• 3 inputs: A, B, C• 3 outputs: D, E, F• D = T if at least 1 input is T• E = T if 2 inputs are T• F = T if 3 inputs are T(what can be true and what cannot be )(exactly two inputs are true)Gates• Gates implement circuits for logic functionsAny logic function can be implemented by using AND, OR gates and inversionsMore gates• NOT gate• NAND gate: inverse of AND gate• NOR gate: inverse of OR gateMore gates• XOR gates: different inputs = positive output• Summary truth tablesCombination of logic gatesQ = A AND NOT BD= NOT (A OR B)E = B AND CQ = D OR EWhat will be the