Dale - Computer Science Illuminated 118

Dale Computer - 4.2 Gates 91 Boolean Expression Logic Diagram Symbol A X Truth Table A 0 1 X 1 0 X = Figure 4.1 Various representations of a NOT

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

View Full Document Right Arrow Icon
4.2 Gates 91 Figure 4.1 Various representations of a NOT gate Logic Diagram Symbol Boolean Expression Truth Table AX 0 1 1 0 A X 1 0 –2 or 1. The variable X represents the output signal, whose value (also 0 or 1) is determined by the value of A. By definition, if the input value for a NOT gate is 0, the output value is 1, and if the input value is 1, the output is 0. A NOT gate is sometimes referred to as an inverter because it inverts the input value. In Boolean expressions, the NOT operation is represented by the 2 mark after the value being negated. Sometimes this operation is shown as a hori- zontal bar over the value being negated. In the Boolean expression in Figure 4.1, X is assigned the value determined by applying the NOT opera- tion to input value A. This is an example of an assignment statement , in which the variable on the left of the equal sign takes on the value of the expression on the right-hand side. Assignment statements are discussed further in Chapter 8 on high-level programming languages.
Background image of page 1
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