Scribd
Upload
10 views2 pages

Boolean Algebra

The document provides an overview of Boolean algebra, which involves algebraic operations on binary values (TRUE and FALSE). It introduces key terminologies such as Boolean expressions, functions, operators, and truth tables, along with fundamental Boolean operators like AND, OR, and NOT. Additionally, it outlines the laws of Boolean algebra, including identity, null, and distributive laws, and presents examples of solving Boolean expressions.

Uploaded by

Wagisha Shree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views2 pages

Boolean Algebra

The document provides an overview of Boolean algebra, which involves algebraic operations on binary values (TRUE and FALSE). It introduces key terminologies such as Boolean expressions, functions, operators, and truth tables, along with fundamental Boolean operators like AND, OR, and NOT. Additionally, it outlines the laws of Boolean algebra, including identity, null, and distributive laws, and presents examples of solving Boolean expressions.

Uploaded by

Wagisha Shree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Boolean algebra and basic law of Boolean algebra

I. Boolean Algebra
 This deals with the algebraic operations on Boolean values – TRUE (1) and FALSE
(0), this means it will take only two input values
 Mathematical manipulation of binary information or binary data
 It was first introduced by George Boole in 1854
Important Terminologies
 Boolean Expression – combination of boolean variables and algebraic operations
 Boolean Function – denotes that function consist number of input values, i.e., one
or more and consist of their results. Ex- {0,1}, {x,y,z}
 Boolean Operator – to be able to perform certain set of operations. Ex – Add
operator ‘+’
 Truth Table – Table that demonstrates the relationship between input values,
operators, functions and their results in a tabular form
Boolean operators
 AND (*) – Binary multiplication. Boolean expression = x * y is written as x AND y (x.y)

x y x.y (x AND
y)
0 0 0
0 1 0
1 0 0
1 1 1

 OR – Binary Addition. Boolean expression = x + y is written as x OR y

x y x+y (x OR y)
0 0 0
0 1 1
1 0 1
1 1 1

 NOT – Binary Complement. Boolean expression = x , if x =0, then x =1

x x
0 1
1 0

*Operator Preference - First preference will be AND, 2nd will be OR and 3rd preference
will be NOT
II. Laws of Boolean Algebra

Boolean Laws AND OR


Identity Law 1.X = X 0+X=X
Null (Dominance) Law 0.X=0 1+X=1
Idempotent Law X.X = X X+X=X
INVERSE LAW X. = 0
X X+ X = 1
COMMUTATIVE LAW XY = YX X+Y=Y+X
ASSOCIATIVE LAW (XY)Z = X(YZ) (X+Y)+Z = X + (Y+Z)
DISTRIBUTIVE LAW X + YZ = (X+Y) X(Y+Z) = XY+XZ
(X+Z)
ABSORPTION LAW X(X+Y)= X X+ XY = X
DeMorgan’s Law ( X Y ) = X +Y X +Y = X Y
Double complement law X =X X =X
Solve following expressions using Boolean Algebra:

i. A + AB = A

Sol. A + AB = A (1 + B) (use NULL law) = A .1 = A

ii. AB+AB’ (or AB+ A B)

Sol.

iii. A’BC + AC

Sol.

iv. A’B +ABC’+ABC

You might also like