Dale - Computer Science Illuminated 119

# Dale - Computer Science Illuminated 119 - can occur using...

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

92 Chapter 4 Gates and Circuits Figure 4.2 Various representations of an AND gate Logic Diagram Symbol Boolean Expression Truth Table 1 0 – 6 7 A A B X B 0 0 1 1 0 1 0 1 X 0 0 0 1 AND Gate An AND gate is shown in Figure 4.2. Unlike a NOT gate, which accepts one input signal, an AND gate accepts two input signals. The values of both input signals determine what the output signal will be. If the two input values for an AND gate are both 1, the output is 1; otherwise, the output is 0. The AND operation in Boolean algebra is expressed using a single dot ( ). Sometimes an asterisk (*) is used to represent this operator. And often the operator itself is assumed. For example A B is often written AB. Because there are two inputs, and two possible values for each input, there are four possible combinations of 1 and 0 that can be provided as input to an AND gate. Therefore, there are four possible situations that
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: can occur using the AND operator in a Boolean expression: 0 ⋅ 0 equals 0 0 ⋅ 1 equals 0 1 ⋅ 0 equals 0 1 ⋅ 1 equals 1 Likewise, the truth table showing the behavior of the AND gate has four rows, showing all four possible input combinations. The output column of the truth table is consistent with results of these Boolean expressions. OR Gate An OR gate is shown in Figure 4.3. Like the AND gate, there are two inputs to an OR gate. If the two input values are both 0, the output value is 0; otherwise, the output is 1. The Boolean algebra OR operation is expressed using a plus sign (+). The OR gate has two inputs, each of which can be one of two values, so as with an AND gate there are four input combinations and therefore four rows in the truth table....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online