Scribd
Upload
11 views11 pages

Boolean Algorithm

Uploaded by

AMILA SADIK
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views11 pages

Boolean Algorithm

Uploaded by

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

Computer Assingment

Boolean algorithm
Sub Topic: Types of Boolean Algorithms
Introduction
Boolean algebra is the category of algebra in which the variable’s values are the truth values, true and false,
ordinarily denoted 1 and 0 respectively. It is used to analyze and simplify digital circuits or digital gates. It is also
called Binary Algebra or logical Algebra. It has been fundamental in the development of digital electronics and is
provided for in all modern programming languages. It is also used in set theory and statistics.

Boolean algebra was introduced by George Boole


in 1847 as a tool for the mathematical analysis of
logic.
Properties and laws
Properties Laws
There are three main properties in boolean There are three common laws
algorithm in boolean algorithm
• associative • complement laws
• commutative, • identity laws
• distributive • double negation law.

There are als more Laws


Like : Involution Law,Idempotent
Law , Absorption Law and so on
Complement Law

This law states that in case a complement is added to any


variable, then it would give one, whereas when we
multiply this variable with its own complement, then it
would result in ‘0’, i.e.,

X + X’ = 1
X.X’ = 0
Identity Law

This law states that a variable would


remain unchanged when it is ANDed
with '1' or ORed with '0', i.e., X. 1 = X.
i.e.,
• X.1 = X
• X+0=X
Double negation Law

This law states that whenever a variable is with two negations, then its
symbol would ultimately get cancelled out while the original variable
is obtained with it, i.e.,

((X)’)’ = X
p ≡ ¬(¬ p )
Associative Law

According to this law, the order of an operation does not matter


when the priority of the given variables are similar, such as ‘*’
and ‘/’, i.e.,
• X + (Y + Z) = (X + Y) + Z
• X.(Y.Z) = (X.Y).Z
Commutative Law

The order of the variable or two different terms does not matter
according to this law. It can be represented as follows,
• X+Y=Y+X
• X.Y = Y.X
Distributive Law

Using this law, we try to understand how the opening up of the


brackets available in an operation, i.e.,

X.(Y+Z) = (X.Y) + (X.Z)


X + (Y.Z) = (X + Y).(X + Z)

You might also like