Boolean algebra is the branch of algebra used in digital circuits and computers to represent logical operations using binary values of 1 and 0. It has laws like commutative, associative, and distributive laws that define how logical operations like addition and multiplication are performed. Boolean algebra is applied in computer logic circuits and allows computers to perform logical operations that process binary data.

1. BOOLEAN ALGEBRA
Mohammed Alomaym
202624018

2. Index
-Introduction.
.-Application of Boolean algebra
-Lows of Boolean algebra.
-Boolean Addition.
-Boolean Multiplication
-Rules of Boolean algebra
-Kahoot
-Review.

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

8. Distributive Law
The distributive law is written for three variables as follows:
A(B + C) = AB + AC

9. Boolean Multiplication and Addition

10. Rules of Boolean Algebra.