Professional Documents
Culture Documents
X Y Z
0 0 0
0 1 0
1 0 0
1 1 1
The or-gate
Like the and-gate, the or-gate can have an
arbitrary number of inputs. The output value
is 1 if and only of at least one of the input
values are 1. Otherwise the output is 0. In
other words, the output value is 0 only if all
inputs are 0. The name has been chosen
because the output is 1 if and only if the first
input or the second input, or, ..., or the nth
input is 1.
In circuit diagrams, we draw the or-gate like
this:
The truth table for an or-gate with two
inputs looks like this
X Y Z
0 0 0
0 1 1
1 0 1
1 1 1
The inverter
X Y
0 1
1 0
The nand-gate
The nand-gate is an and-gate with
an inverter on the output. So
instead of drawing several gates
like this:
The nand-gate, like the and-gate can take an
arbitrary number of inputs. The truth table
for the nand-gate is like the one for the and-
gate, except that all output values have
been inverted:
X Y Z
0 0 1
0 1 1
1 0 1
1 1 0
The nor-gate
The nor-gate is an or-gate with an
inverter on the output. So instead of
drawing several gates like this:
The truth table for the nor-gate is like the one
for the or-gate, except that all output values
have been inverted:
X Y Z
0 0 1
0 1 0
1 0 0
1 1 0
Laws of Boolean Algebra
Laws of Boolean Algebra
Laws of Boolean Algebra
Examples
Examples
problems