Scribd
Upload
22 views8 pages

CO Unit-1

Boolean algebra is a mathematical framework for logical operations on binary variables, represented by 1 (true) and 0 (false). It includes key operations such as conjunction (AND), disjunction (OR), and negation (NOT), and is essential for simplifying and analyzing digital logic circuits. The document also outlines various laws, theorems, and truth tables related to Boolean algebra and its applications in logic gates.

Uploaded by

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

CO Unit-1

Boolean algebra is a mathematical framework for logical operations on binary variables, represented by 1 (true) and 0 (false). It includes key operations such as conjunction (AND), disjunction (OR), and negation (NOT), and is essential for simplifying and analyzing digital logic circuits. The document also outlines various laws, theorems, and truth tables related to Boolean algebra and its applications in logic gates.

Uploaded by

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

1

`
UNIT-1
Boolean Algebra
Boolean algebra is a branch of algebra dealing with logical operations on variables. There can
be only two possible values of variables in boolean algebra, i.e. either 1 or 0. In other words,
the variables can only denote two options, true or false. The three main logical operations of
boolean algebra are conjunction, disjunction, and negation.

In elementary algebra, mathematical expressions are used to mainly denote numbers whereas,
in boolean algebra, expressions represent truth values. The truth values use binary variables
or bits "1" and "0" to represent the status of the input as well as the output. The logical
operators AND, OR, and NOT form the three basic boolean operators. In this article, we will
learn more about the definition, laws, operations, and theorems of Boolean algebra.

What is Boolean Algebra?


Boolean algebra is also known as binary algebra or logical algebra. The most basic
application of boolean algebra is that it is used to simplify and analyze various digital logic
circuits. Venn diagrams can also be used to get a visual representation of any boolean algebra
operation.

Boolean Algebra Definition


Boolean algebra can be defined as a type of algebra that performs logical operations on
binary variables. These variables give the truth values that can be represented either by 0 or 1.
The basic Boolean operations are conjunction, disjunction, and negation. The logical
operators AND, OR, and NOT are used to represent these operations respectively.
Furthermore, these operations are analogous to intersection, union, and complement of sets in
set theory. Some of the Boolean algebra rules are:

• Any variable that is being used can have only two values. Binary 1 for HIGH and
Binary 0 for LOW.
• Every complement variable is represented by an overbar i.e. the complement of
variable B is represented as B¯. Thus if B = 0 then B¯= 1 and B = 1 then B¯= 0.
• Variables with OR are represented by a plus (+) sign between them. For example
OR of A, B, C is represented as A + B + C.
• Two or more variables with logical AND are represented by writing a dot between
them such as A.B.C. Sometimes the dot may be omitted like ABC.

Let us look at an example,


Suppose we have two variables A = 1 and B = 0. We have to perform the AND operation.
The boolean expression can be represented as A.B = 1.0 = 0.
If we have to perform the logical OR operation then the boolean expression is given as
A + B = 1 + 0 = 1.
If we apply the NOT operation on both the input variables then we get ¯¯¯¯A¯ = 0
and ¯¯¯¯B¯ = 1.

Boolean Algebra Expression


Boolean algebra expressions are statements that make use of logical operators such as AND,
OR, NOT, XOR, etc. These logical statements can only have two outputs, either true or false.
In digital circuits and logic gates "1" and "0" are used to denote the input and output
conditions. For example, if we write A OR B it becomes a boolean expression. There are
2
`
many laws and theorems that can be used to simplify boolean algebra expressions so as to
optimize calculations as well as improve the working of digital circuits.
Boolean Algebra Operations
There are three basic Boolean algebra operations. These are conjunction, disjunction, and
negation. The equivalent logical operators to these operations are given below.
• AND operator: It is analogous to conjunction. In a boolean expression, "•" is used
to represent the AND operator. This operator returns true if and only if all input
operands are true.
• OR operator: This operator is equivalent to disjunction. In a boolean expression,
"+" symbol is used to represent the OR operator. The operator returns true if and
only if one or more of the input operands are true.
• NOT operator: This logical operator is comparable to negation. NOT operator
returns true if the input variable is false. Similarly, if the input variable is false it
returns true. An overline on the variable is used to represent this operator.

Boolean Algebra Laws


The main use of boolean algebra is in simplifying logic circuits. By applying Boolean algebra
laws, we can simplify a logical expression and reduce the number of logic gates that need to
be used in a digital circuit. Some of the important boolean algebra laws are given below:

Distributive Law
The distributive law says that if we perform the AND operation on two variables and OR the
result with another variable then this will be equal to the AND of the OR of the third variable
with each of the first two variables. The boolean expression is given as
A + B.C = (A + B) (A + C)

Thus, OR distributes over AND


If we OR two variables then AND their result with another variable then this value will be
equal to the OR of the AND of the third variable with the other two variables. This is given
by:
A .(B+C) = (A.B) + (A.C)

Hence, AND distributes over OR.

Associative Law
According to the associative law, if more than two variables are OR'd or AND'd then the
order of grouping the variables does not matter. The result will always be the same. The
expressions are given as:
A + (B + C) = (A + B) + C
A.(B.C) = (A.B).C

Commutative Law
Commutative law states that if we interchange the order of operands (AND or OR) the result
of the boolean equation will not change. This can be represented as follows:
A+B=B+A
A.B = B.A

Absorption Law
Absorption law links binary variables and helps to reduce complicated expressions by
absorbing the like variables. There are 4 statements that fall under this law given as:
• A + A.B = A
• A (A + B) = A
3
`
• A + Ā.B = A + B
• A.(Ā + B) = A.B

There are some boolean algebra properties and identities that are given as follows:
• A+1=1
• A+0=A
• A.1=A
• A.0=0
• A+A=A
• A.A=A
• ¯¯¯¯¯¯¯¯A¯¯ = A
• A + ¯¯¯¯A¯ = 1
• A . ¯¯¯¯A¯ = 0

Boolean Algebra Theorems


One of the most important theorems in boolean algebra is de morgan's theorem. This theorem
comprises two statements that help to relate the AND, OR, and NOT operators. The two
statements are given as follows:
• When two variables are AND'd and negated the result is equal to the OR of each
negated input variable. The boolean expression
is ¯¯¯¯¯¯¯¯¯¯¯A.B.¯ = ¯¯¯¯A¯ + ¯¯¯¯B¯.
• When two variables are OR'd and negated then this will be equal to the AND of
each negated input variable. This is given by ¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯A+B+¯ = ¯¯¯¯A¯.¯¯¯¯B¯

Boolean Algebra Postulates


Boolean algebra postulates are not laws or theorems but are statements that hold true. These
postulates are the four possible logical OR and logical AND operations as well as the rules
followed by the NOT operator. Given below are the boolean algebra postulates:
• 0+0=0
• 0+1=1
• 1+0=1
• 1+1=1
• 0.0=0
• 0.1=0
• 1.0=0
• 1.1=1
• ¯¯ ¯11¯ = 0
• ¯¯ ¯00¯ = 1

Boolean Algebra and Logic Gates


A logic gate is a building block for any digital circuit. These logic gates need to make the
decision of combining various inputs according to some logical operation and produce an
output. Logic gates perform logical operations based on boolean algebra. Suppose we have
two inputs A and B. Let the output be R. Then given below are the various types and symbols
of logic gates.
4
`

AND gate - R = A.B will be the boolean expression. R will be true if both A AND B are true.

OR gate - The boolean equation is R = A + B. Here, R will be true if either of the inputs A
OR B is true.

NOT gate - This is also known as an inverter and the boolean equation is R = ¯¯¯¯A�¯. This
implies that the output is true only if the input is false.
5
`

NAND gate - This is also the NOT - AND gate. R = ¯¯¯¯¯¯¯¯¯¯¯A.B.¯ is the boolean equation.
The output R will NOT be true if both A AND B are true.

NOR gate - The NOT - OR operation results in the NOR gate. R


= ¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯A+B�+�¯ denotes the boolean equation and implies that R is true if A and B
are NOT true.
6
`
EX - OR gate - This is the exclusive OR gate. It can be created by using a combination of the
above-mentioned gates. R = A ⊕ B is the boolean expression. It means that R is true only if
either A or B is true.

EX - NOR gate - The boolean equation of the exclusive NOR gate is given as R
= ¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯A⊕B⊕¯. It means R is true only if both inputs are either true or false.

Boolean Algebra Truth Table


Boolean algebra truth table can be defined as a table that tells us whether the Boolean
expression holds true for the designated input variables. Such a truth table will consist of only
binary inputs and outputs. Given below are the truth tables for the different logic gates.

AND gate
A B R = A.B

0 0 0

0 1 0

1 0 0
7
`

1 1 1

OR gate
A B R=A+B

0 0 0

0 1 1

1 0 1

1 1 1

NOT gate
A R = ¯¯¯¯A¯

1 0

0 1

NAND gate
A B R = ¯¯¯¯¯¯¯¯¯¯¯A.B.¯

0 0 1

0 1 1

1 0 1

1 1 0

NOR gate
A B R = ¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯A+B+¯

0 0 1

0 1 0

1 0 0
8
`

1 1 0

EX - OR gate
A B R=A⊕B

0 0 0

0 1 1

1 0 1

1 1 0

EX - NOR gate
A B R = ¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯A⊕B⊕¯

0 0 1

0 1 0

1 0 0

1 1 1

You might also like