3. Introduction
What dose Boolean algebra mean?
Boolean algebra is the branch of algebra in which the
values of the variables are the truth values true and false,
.usually denoted 1 and 0 respectively
4. Application of Boolean Algebra
-It is used to perform the logical operations in digital
computer.
-In digital computer True represent by ‘1’ (high volt) and False
.represent by ‘0’ (low volt)
-Boolean Algebra applied in computers electronic circuits. These
circuits perform Boolean operations and these are called logic
circuits or logic gates.
5. Lows and rules of Boolean algebra
Laws of Boolean algebra:
Laws of Boolean algebra has three types:
-Commutative Laws
-Associative Laws
-Distributive Law
6. Commutative Laws
The commutative law of addition for two variables is written
as A+B = B+A
The commutative law of multiplication for two variables is
A.B = B.A
7. Associative Laws
The associative law of addition is written as follows for
three variables: A + (B + C) = (A + B) + C
lThe associative law of multiplication is written as follows
for three variables: A(BC) = (AB)C
