Dale - Computer Science Illuminated 120

# Dale - Computer Science Illuminated 120 - 4.2 Gates 93...

This preview shows page 1. Sign up to view the full content.

4.2 Gates 93 Figure 4.3 Various representations of an OR gate Logic Diagram Symbol Boolean Expression Truth Table 1 0 – 8 7 AB 0 0 1 1 0 1 0 1 X 0 1 1 1 A B X Figure 4.4 Various representations of an XOR gate Logic Diagram Symbol Boolean Expression Truth Table 1 0 – 7 0 0 1 1 0 1 0 1 X 0 1 1 0 A B X XOR Gate The XOR, or exclusive OR, gate is shown in Figure 4.4. An XOR gate produces 0 if its two inputs are the same, and a 1 otherwise. Note the difference between the XOR gate and the OR gate; they differ only in one input situation. When both input signals are 1, the OR gate produces a 1 and the XOR produces a 0. Sometimes the regular OR gate is referred to as the inclusive OR, because it produces a 1 if either or both of its inputs is a 1. The XOR
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online