LOGIC GATES , TRUTH TABLES & DEFINITION

AND gate

The AND gate is an electronic circuit that gives a high output (1) only if all its inputs are high.
A dot (.) is used to show the AND operation i.e. A.B.  Bear in mind that this dot is sometimes
omitted i.e. AB
OR gate

The OR gate is an electronic circuit that gives a high output (1) if one or more of its inputs are
high.  A plus (+) is used to show the OR operation.

NOT gate

The NOT gate is an electronic circuit that produces an inverted version of the input at its output.  It is
also known as an inverter.  If the input variable is A, the inverted output is known as NOT A.  This is
also shown as A', or A with a bar over the top, as shown at the outputs.

NAND gate

This is a NOT-AND gate which is equal to an AND gate followed by a NOT gate.  The
outputs of all NAND gates are high if any of the inputs are low. The symbol is an AND gate
with a small circle on the output. The small circle represents inversion.
NOR gate

This is a NOT-OR gate which is equal to an OR gate followed by a NOT gate.  The outputs of
all NOR gates are low if any of the inputs are high.
The symbol is an OR gate with a small circle on the output. The small circle represents
inversion.
 
 
EXOR gate

The 'Exclusive-OR' gate is a circuit which will give a high output if either, but not both, of
its two inputs are high.  An encircled plus sign ( ) is used to show the EOR operation.

EXNOR gate

The 'Exclusive-NOR' gate circuit does the opposite to the EOR gate. It will give a low output if either, but not
both, of its two inputs are high. The symbol is an EXOR gate with a small circle on the output. The small circle
represents inversion.
NOT, AND & OR gates using NAND gate

BOOLEAN THEOREMS\LAWS
-Use to simplify Boolean expressions

Multiple Variable Theorems

Commutative Law
-The order in which two variables is OR or AND is unimportant, the result is the same

A·B = B·A
A+B = B+A

Associative Law
- This law allows the removal of brackets from an expression and regrouping of the variables.

(A·B)·C = A·(B·C) = A·B·C

(A+B)+C = A+(B+C) = A+B+C

Distributive Law
- This law permits the multiplying or factoring out of an expression

A·(B+C) = (A·B) + (A·C)

A+(B·C) = (A+B) · (A+C)

Involution Rules
-A term that is inverted twice is equal to the original term.
-an even number of inversions cancel each other
_
A = A

DeMorgan's Theorem

(1) Two separate terms NOR´ed together is the same as the two terms inverted (Complement) and AND´
 ___ _ _
A+B = A · B (NOR)

(2) Two separate terms NAND´ed together is the same as the two terms inverted (Complement) and OR´
___ _ _
A·B = A + B (NAND)

Single variable Theorems

X.0=0 X+X=X

X.1=X X+X=1

X.X= X X. X = X

X+0=X X+1=1
Sum Of Products (SOP)
Sum of products expression consist of 2 or more AND terms (products) that are ORed together.
Example:

1. ABC + BC ABC √
2. AB + ABC + CD + D ABC X
3. AB + CD + EF + GK + HL DKL √
DKL X
NOTED: in SOP the inversion sign cannot cover more than obe variable in a term.