Professional Documents
Culture Documents
(CSE 2105)
2
2
Boolean Algebra
Boolean Algebra 3
3
Boolean Operations & Expressions
Boolean Algebra 4
4
Boolean Addition
Boolean addition is equivalent to the OR operation
0+0 = 0 0+1 = 1 1+0 = 1 1+1 = 1
Boolean Algebra 5
5
Boolean Multiplication
Boolean multiplication is equivalent to the AND
operation
0·0 = 0 0·1 = 0 1·0 = 0 1 ·1 = 1
Boolean Algebra 6
6
Laws & Rules of Boolean Algebra
The basic laws of Boolean algebra:
The commutative laws
The associative laws
The distributive laws
Boolean Algebra 7
7
Commutative Laws
Boolean Algebra 8
8
Associative Laws
A A A+B
A+(B+C)
B B
(A+B)+C
C B+C C
Boolean Algebra 9
9
Distributive Laws
B A AB
B+C
C B
X
X
A A
C AC
X=A(B+C) X=AB+AC
Boolean Algebra 10
10
Rules of Boolean Algebra
1. A 0 A 7. A A A
2. A 1 1 8. A A 0
3. A 0 0 9. A A
4. A 1 A 10. A AB A
5. A A A 11. A A B A B
6. A A 1 12.( A B)( A C ) A BC
___________________________________________________________
A, B, and C can represent a single variable or a combination of variables.
Boolean Algebra 11
11
DeMorgan’s
Theorems
12
12
DeMorgan’s Theorems
DeMorgan’s theorems provide mathematical
verification of:
DeMorgan’s Theorems 13
13
DeMorgan’s Theorems
DeMorgan’s Theorems 14
14
DeMorgan’s Theorems (Exercises)
X Y Z
X Y Z
X Y Z
W X Y Z
DeMorgan’s Theorems 15
15
DeMorgan’s Theorems (Exercises)
( A B C)D
ABC DEF
AB C D EF
A BC D( E F )
DeMorgan’s Theorems 16
16
Boolean Analysis of
Logic Circuits
17
17
Boolean Analysis of Logic Circuits
A(B+CD)
A
A(B+CD)=1 0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
When A=1 and 0 1 0 1 0
B=1 regardless 0 1 1 0 0
of the values 0 1 1 1 0
1 0 0 0 0
of C and D 1 0 0 1 0
When A=1 and C=1 1 0 1 0 0
Thank You!
26
26