Boolean algebra:

George Boole a nineteenth-century English mathematician developed a system of logical

algebra by which reasoning can be expressed mathematically Boolean algebra that deals with
binary number system .George Boole (1815-1864) an English mathematician developed it
for:

 Simplify representation
 Manipulation of propositional logic

Fundamental concepts of Boolean algebra:

Boolean algebra is a logical algebra in which symbols are used to represent logic levels any
symbol can be used however letters of the alphabet are generally used since the logic levels
are generally associated with symbol 1 and 0

 Use of binary digit

 Logical Addition
 Logical Multiplication
 Complementation

Use of Binary Digit:

Boolean equations can have either of two possible values 0 and 1

Logical Addition:
Symbol ‘+’ also known as ‘OR’ operator used for logical addition

Logical multiplication:
Symbol ‘.’ also known as ‘AND’ operator used for logical multiplication

Complementation:
Symbol ‘-’also known as ‘NOT’ operator used for complementation

Operator precedence:
 Each operator has a precedence level
 Higher the operator’s precedence level ,earlier it is evaluated
 Expression is scanned from left to right
 First expression enclosed with in parenthesis are evaluated
 Then , all complement (NOT) operation are performed
 Then all ‘.’(AND) operation are performed
 Finally all operation ‘+’(OR) operation are performed

1
Boolean algebra laws:

 Commutative law
 Associative law
 Distributive law
 Annulment law
 Identity law
 Idempotent law
 Complement law

 Commutative law:
It states that the interchanging of the order of operands in a Boolean equation does not
change result
FOR EXAMPLE:
OR operator A+B=B+A
AND operator A*B=B*A
 Associative law:
It states that the AND operation are done on two or more than two variables
FOR EXAMPLE:
A*(B*C) = (A*B)*C
 Distributive law:
It states that the multiplication of two variables and adding result with a variable will
Result in the same values as multiplication of addition of the variables
FOR EXAMPLE:
A+BC-(A+B) (A+C)
 Annulment law:

A.0= 0

A+1=1

 Identity law :
A.1=A
A+0=A
 Idempotent law:
A+A=A
A.A=A

2
  Boolean function:
A Boolean function is an expression formed with:

Binary variables

Operators (OR, AND, and NOT)

Parentheses and equal sign

The value of a Boolean function can be either 0 or 1

Boolean function may be represented as:

X Y Z W
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1

 The number of rows in the tables is equal to 2n where n is the number of literals in the
function
 The combination of 0s and 1s for rows of this tables are obtained from the binary
number by counting from 0 to 2n -1

Minimization of Boolean functions:

Minimization of Boolean function deals with:

 Reduction in number of literals

 Reduction in number of terms

Minimization is achieved through manipulating expression to obtain equal and simpler

expression (having fewer literals and /or terms)

3
X Y Z F1 F2
0 0 0 0 0

0 0 1 1 1

0 1 0 0 0

0 1 1 1 1

1 0 0 1 1

1 0 1 1 1

1 1 0 0 0

1 1 1 0 0

4
Logic gates:

 Logic gates are electronic circuits that operates on one or more inputs
signals to produce standard output signal

 Are the building blocks of all the circuits in a computer

 Some of the most basic and useful logic gates are AND ,OR, NAND
And NOR gates

5
AND GATE:
Physical realization of logical multiplication (AND) operation

Generates an output signal of 1 only if all input signal are also 1

Truth table:

inputs outputs

A B C= A.B

0 0 0

0 1 0

1 0 0

1 1 1

6
OR GATE:
Physical realization of logical addition (OR) operation

Generates an output signal of 1 if at least one of the inputs signal is also 1

Truth table:

Inputs Outputs

A B C=A+B

0 0 0

0 1 1

1 0 1

1 1 1

7
NOT GATE:
Physical realization of complementation operation

Generates an output signal which is the reverse of input signal

Truth table:

input output

A -

0 1

1 0

8
NAND GATE:
Complemented AND gate

Generates an output signal of:

 1 if any one of the input is a 0

 0 when all the inputs are 1

Truth table:
Inputs outputs

A B C=A+B

0 0 1

0 1 1

1 0 1

1 1 0

9
NOR GATE:
Complemented OR gate

Generates an output signal of:

 1 only when all inputs are 0

 0 if any one of input is a1

TABLE:

INPUTS OUTPUTS

A B C=A.B

0 0 1

0 1 0

1 0 0

1 1 0

10
Logic gates:
When logic gates are interconnected to form a gating / logic network it is known as
combinational logic circuit

The Boolean algebra expression for a given logic circuit can be derived by systematically
progressing from input to output on the gates

The three logic gates (AND, OR and NOT) are logically complete because any Boolean
expression can be realized as logic circuit using only these three gates

11