Logic Gates
AND - NOT -OR
LOGIC GATES
Logic gates are pieces of hardware that have one or more inputs and one out put. Gates can be combined
in such a way to obtain a desired output out of a combination of possible inputs. Logic gates work with
binary numbers, therefore the output must always be either a 1 or a 0.
For an ‘N’ number of inputs, the highest possible combination for a gate is 2N
where 2 stands for binary or the possibility of either ‘1’ or ‘0’ (two options) and where ‘N’ is the number of
inputs
TRUTH TABLES
Truth tables are tables which are set to list the possible inputs and find their corresponding outputs.
By looking at a truth table, one is able to know the output of any possible combination of inputs!
The NOT gate, the OR gate and the AND gate are three main types of logic gates.
BOOLEAN EXPRESSIONS
Boolean Expressions are equivalent expressions of the logic state of gates. For example, the Boolean
expression for:
a NOT gate with input A and output C: C = NOT A
an OR gate with inputs A & B and output C: C = A OR B
an AND gate with inputs A & B and output C: C = A AND B
Truth table of a NOT gate
INPUT (A) OUTPUT (C)
NOT GATE 0 1
The output of a NOT gate is the
1 0
of its input. If the input is TRUE, then the output
is FALSE, and if the input is FALSE, the output
is NOT C
. NOT gates can have only A
one input and one output. A NOT gate is also
or else
known as an inverter.
It can be written as:
A C
C=NOT A, or C=A, or C=A’
Truth table of an OR gate
INPUT (A) INPUT (B) OUTPUT (C)
0 0 0
0 1 1
OR GATE
1 0 1
The output of an OR gate is TRUE if
1 1 1
any input is TRUE, otherwise the
output is FALSE. An OR gate have
two or more inputs and one output. A
OR C
It can be written as:
B
C=A OR B, or C=A+B, or C=A | B or else
A
C
B
Truth table of an AND gate
INPUT (A) INPUT (B) OUTPUT (C)
0 0 0
0 1 0
AND GATE
1 0 0
The output of an AND gate is TRUE if
ALL inputs are TRUE, otherwise the 1 1 1
output is FALSE. An AND gate have two
or more inputs and one output.
A
It can be written as:
AND C
B
C=A AND B, or C=A.B, or C=A^B
or else
A
C
B
From the Truth Tables note that for n inputs, there are 2n combinations of inputs.
Therefore, if we have 1 input, there are 21 combinations, combinations.
if we have 2 inputs, there are 2 combinations, 4 combinations.
2
if we have 4 inputs, there are 24 combinations, combinations.
if we have inputs, there are 2 combinations, 64 combinations.
6
