Scribd
Upload
20 views3 pages

Switch Representation of The OR Function

The document discusses different logic functions, including OR, NOT, AND, NAND, and NOR. It describes what each function represents at a high level, such as the OR function producing a true output if one or more inputs are true. It also provides switch representations to illustrate how each logic function can be modeled using switches.

Uploaded by

Guyan Gordon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views3 pages

Switch Representation of The OR Function

The document discusses different logic functions, including OR, NOT, AND, NAND, and NOR. It describes what each function represents at a high level, such as the OR function producing a true output if one or more inputs are true. It also provides switch representations to illustrate how each logic function can be modeled using switches.

Uploaded by

Guyan Gordon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

The Logic OR Function function states that an output action will become TRUE if either one “OR” more

events are TRUE, but the order at which they occur is unimportant as it does not affect the final result.

Switch Representation of the OR Function

Switch Representation of the NOT Function

The Logic NOT Function is simply a single input inverter that changes the input of a logic level
“1” to an output of logic level “0” and vice versa.

The “logic NOT function” is so called because its output state is NOT the same as its input state
with its Boolean Expression generally denoted by a bar or overline ( ¯ ) over its input symbol
which denotes the inversion operation, (hence its name as an inverter).

As NOT gates perform the logic INVERT or COMPLEMENTATION function they are more
commonly known as Inverters because they invert the signal. In logic circuits this negation can
be represented by a normally closed switch.
The Logic AND Function function states that two or more events must occur together and at the same
time for an output action to occur. The order in which these actions occur is unimportant as it does not
affect the final result. For example, A & B = B & A. In Boolean algebra the Logic AND Function follows the
Commutative Law which allows a change in position of either variable.

Switch Representation of the AND Function

The Logic NAND Function only produces an


output when “ANY” of its inputs are not
present and in Boolean Algebra terms the
output will be TRUE only when any of its
inputs are FALSE.

Switch Representation of the


NAND Function

The Logic NOR Function only produces and output when “ALL” of its inputs are not present
and in Boolean Algebra terms the output will be TRUE only when all of its inputs are FALSE.

Switch Representation of the NOR Function

You might also like