Scribd
Upload
13 views8 pages

Boolean Algebra

Boolean algebra is a branch of algebra focused on logical operations and binary variables, with applications in simplifying digital circuits. It includes basic operations such as AND, OR, and NOT, governed by laws like commutative, associative, and distributive laws. Various logic gates, including AND, OR, NOT, NAND, NOR, XOR, and XNOR, are utilized to perform these operations in digital systems.

Uploaded by

nayakkrish446
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
13 views8 pages

Boolean Algebra

Boolean algebra is a branch of algebra focused on logical operations and binary variables, with applications in simplifying digital circuits. It includes basic operations such as AND, OR, and NOT, governed by laws like commutative, associative, and distributive laws. Various logic gates, including AND, OR, NOT, NAND, NOR, XOR, and XNOR, are utilized to perform these operations in digital systems.

Uploaded by

nayakkrish446
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

BOOLEAN ALGEBRA:

 Boolean algebra is the branch of algebra that deals with logical operations and binary variables.
 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.
 Boolean Algebra has various applications. It is used to simplify logical circuits that are the backbone of modern
technology.

Boolean Algebra Operations:

The basic operations of Boolean algebra are as follows:

 Conjunction or AND operation


 Disjunction or OR operation
 Negation or Not operation
 Below is the table defining the symbols for all three basic operations.

Operator Symbol Precedence

NOT ‘ (or) ¬ Highest

AND . (or) ∧ Middle

OR + (or) ∨ Lowest

Boolean Algebra Truth Table:

A ¬A

True False

False True
A B A∧B A∨B

True True True True

True False False True

False True False True

False False False False

Laws of Boolean Algebra


There are six types of Boolean algebra laws. They are:

a. Commutative law
b. Associative law
c. Distributive law
d. AND law
e. OR law
f. Inversion law

Commutative Law

Commutative law states that changing the sequence of the variables does not have any effect on the
output of a logic circuit.

A. B = B. A

A+B=B+A

Associative Law

It states that the order in which the logic operations are performed is irrelevant as their effect is the
same.

( A. B ). C = A . ( B . C )

( A + B ) + C = A + ( B + C)

Distributive Law

Distributive law states the following conditions:

A. ( B + C) = (A. B) + (A. C)
A + (B. C) = (A + B) . ( A + C)

AND Law

These laws use the AND operation. Therefore they are called AND laws.

A .0 = 0

A.1=A

A. A = A

OR Law

These laws use the OR operation. Therefore they are called OR laws.

A +0=A

A+1=1

A+A=A

Inversion Law

In Boolean algebra, the inversion law states that double inversion of variable results in the original
variable itself.

2. Draw a truth table for A(B+D).


3. Draw Truth Table for P + P.Q = P
4. Draw Truth Table for P.Q + P + Q
Basic Logic Gates:
Logic gates are used to carry out logical operations on single or multiple binary inputs and give
one binary output. In simple terms, logic gates are the electronic circuits in a digital system.

Types of Basic Logic Gates:


There are several basic logic gates used in performing operations in digital systems.
The common ones are

 OR Gate
 AND Gate
 NOT Gate
 XOR Gate
 NOR Gate
 NAND Gate
 XNOR Gate

OR Gate
 In an OR gate, the output of an OR gate attains state 1 if one or more inputs
attain state 1.
 The Boolean expression of the OR gate is Y = A + B, read as Y equals A ‘OR’ B.
 The truth table of a two-input OR basic gate is given as
A B Y

0 0 0

0 1 1

1 0 1

1 1 1


AND Gate
In the AND gate, the output of an AND gate attains state 1 if and only if all the inputs are in
state 1.

The Boolean expression of AND gate is Y = A.B


The truth table of a two-input AND basic gate is given as
A B Y

0 0 0

0 1 0

1 0 0

1 1 1

NOT Gate
In a NOT gate, the output of a NOT gate attains state 1 if and only if the input does not attain
state 1.

The Boolean expression is:-


It is read as Y equals NOT A.
The truth table of NOT gate is as follows

A
0 1
1 0
When connected in various combinations, the three gates (OR, AND and NOT) give us basic
logic gates, such as NAND and NOR gates, which are the universal building blocks of digital
circuits.
NAND Gate

This basic logic gate is the combination of AND and NOT gates.
The Boolean expression of the NAND gate is

The truth table of a NAND gate is given as

A B Y

0 0 1

0 1 1

1 0 1

1 1 0

NOR Gate
This gate is the combination of OR and NOT gates. The Boolean expression of the NOR gate

is

The truth table of a NOR gate is as follows


A B Y

0 0 1

0 1 0

1 0 0

1 1 0

Exclusive-OR gate (XOR Gate):


In an XOR gate, the output of a two-input XOR gate attains state 1 if one adds only input and
attains state 1.

The Boolean expression of the XOR gate is

The
The truth table of an XOR gate is:-

A B Y

0 0 0

0 1 1

1 0 1

1 1 0
Exclusive-NOR Gate (XNOR Gate)
In the XNOR gate, the output is in state 1 when both inputs are the same, that is, both 0 or both
1.

The Boolean expression of the XNOR gate

The truth table of an XNOR gate is given below


A B Y
0 0 1
0 1 0
1 0 0
1 1 1
The diagram of XNOR gate is:

You might also like