Scribd
Upload
13 views

03.Boolean_algebra

The document provides an overview of Boolean algebra, including its key components, applications, and basic theorems. It explains the types of logic gates, their functions, and how they relate to Boolean expressions. Additionally, it covers derived logic gates and their characteristics.

Uploaded by

lavanyaprasadstudy
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 views

03.Boolean_algebra

The document provides an overview of Boolean algebra, including its key components, applications, and basic theorems. It explains the types of logic gates, their functions, and how they relate to Boolean expressions. Additionally, it covers derived logic gates and their characteristics.

Uploaded by

lavanyaprasadstudy
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

Table of contents

Boolean Algebra
Key Components
Applications
Logic gates
Types of Logic Gates:
AND Gate:
OR Gate:
NOT Gate (Inverter):
Boolean Expressions:
Applications:
Basic theorems in Boolean Algebra:
De Morgan’s theorem I :
DeMorgan’s Theorem II :
Derived Logic Gates

Boolean Algebra
Boolean algebra is a branch of mathematics that deals with logical values and incorporates
binary variables. It is a system of mathematical logic that represents relationships between
entities, using binary values (0 and 1) to represent true and false, respectively. This algebraic
system was first introduced by George Boole in the 19th century and has since been widely
applied in computer programming languages, digital electronics, and information theory.

Key Components

1. Binary Variables: Boolean variables can take on values 0 (false) or 1 (true).

2. Logical Operations: Three basic operations are defined:

a) Conjunction (∧): AND operation, represented by a dot (.) or ∧. b) Disjunction (∨): OR


operation, represented by a plus sign (+) or ∨. c) Negation (¬): NOT operation, represented by
a tilde (~) or ¬.

3. Truth Tables: Boolean expressions can be evaluated using truth tables, which show the
output for all possible combinations of input values.

4. De Morgan’s Laws: Two important theorems in Boolean algebra, used to simplify Boolean
expressions: De Morgan’s First Law: (X+Y)‘=X’Y’ De Morgan’s Second Law: X’Y’=X’+Y’

Applications

1. Digital Circuits: Boolean algebra is used to analyze and simplify digital circuits or digital
gates.

2. Computer Programming Languages: Boolean algebra is fundamental in programming


languages, as it provides a way to represent and manipulate logical conditions.
3. Information Theory: Boolean algebra is used in information theory to study the properties
of digital information and its transmission.

Logic gates
Logic gates are the building blocks of digital circuits and systems. They perform basic logical
operations on one or more binary inputs (0s and 1s) and produce a single binary output. The
relationship between the input and output is based on a specific logic, which defines the gate’s
type.

Types of Logic Gates:

AND Gate:

Produces an output of 1 only if all inputs are 1. Otherwise, the output is 0.

Truth Table:

A | B | Y
0 | 0 | 0
0 | 1 | 0
1 | 0 | 0
1 | 1 | 1

OR Gate:

Produces an output of 1 if any input is 1. Otherwise, the output is 0.

Truth Table:

A | B | Y
0 | 0 | 0
0 | 1 | 1
1 | 0 | 1
1 | 1 | 1
NOT Gate (Inverter):

Produces the opposite output of the input (0 becomes 1, and 1 becomes 0).

Truth Table:

A | Y
0 | 1
1 | 0

Boolean Expressions:

Logic gates can be represented using Boolean algebra, which uses variables (A, B, etc.) and
logical operators (+, ⋅, ¬) to describe the gate’s behavior.

AND Gate: A ⋅ B OR Gate: A + B NOT Gate: ¬A

Applications:

Logic gates are used in nearly every digital device, including computers, smartphones, and
memory devices. They enable data manipulation, processing, and storage by executing logical
operations.

Basic theorems in Boolean Algebra:


1. De Morgan’s Theorems: De Morgan’s First Law: (X+Y)‘=X’Y’ De Morgan’s Second Law:
X’Y’=X’+Y’

2. Indempotence Law : This law states that a) x+x=x b) x.x=x where x=0 or 1.

3. Involution law : This law states that : (x’)’=x This law is also called double-inversion rule.

4. Complementary Law : a) X+X’=1 b) X.X’=0

5. Commutative Law: The order of variables can be switched in addition or multiplication


without changing the result. (a) X+Y=Y+X , (b) X.Y=Y.X

6. Associative Law: The order in which variables are combined with each other does not
affect the result. (a) X+(Y+Z)=(X+Y)+Z (b) X.(YZ)=(XY).Z

7. Distributive Law: The operation of AND (conjunction) distributes over OR (disjunction), and
vice versa. (a) X(Y+Z)=XY+XZ (b) X+YZ=(X+Y)(X+Z)

8. Inversion Law: The complement of the complement of any number is the number itself.
(X’)’=X
9. Absorption Law: (a) X+XY=X (b) X.(X+Y)=X

De Morgan’s theorem I :
It states that : (X+Y)‘=X’Y’ Proof : o prove this theorem, complementary law is applied

X+X’=1 and X.X’=0 ie (X+Y)+X’Y’=1

(X+Y).X’Y’=0

Let us prove first part :

(X+Y)+X’Y’=1

(X+Y)+X’Y’=((X+Y)+X’).((X+Y)+Y’)

=(X+X'+Y).(X+Y+Y')

=(1+Y).(X+1)

=1.1

=1

Let us prove second part:

(X+Y).X’Y’=0

(X+Y).X’Y’=X’Y’.(X+Y)

= X'Y'X+X'YY'

=0.Y'+X'.0

=0+0=0.

Thus (X+Y)'=X'Y', then theorem proved.

DeMorgan’s Theorem II :

It states that ,

X’Y’=X’+Y’

proof: In order to prove we should apply complementary Law

X+X’=1 and X.X’=0

Proof : First part

ie XY+(X’+Y’) =1, LHS

XY+(X’+Y’)= (X’+Y’+X).(X’+Y’+Y)

= (1+Y')+(X'+1)

= 1.1

=1

Second part : XY.(X’+Y’) =0, RHS


XY.(X’+Y’) =0

X.X’.Y+XYY’=0.Y+X.0

=0+0

=0

Hence X'Y'=X'+Y', theorem proved.

Derived Logic Gates


These are the gates which are derived from basic three gates, that is AND, NOT and OR

1. NOR Gate: A NOR gate has two or more input signals but only one output signal . Here all
inputs are low(0) then the output signal is high.

2. NAND Gate : A NAND Gate has two more input signals but only one tput signal. Here if all
the inputs are high (1) inputs then the output produced is Zero(0).
3. XOR Gate :

A XOR gate has two or more inputs but produces one output signal. This gate produces output
high (1) for only those input combinations that have odd number of 1’s.
4. XNOR Gate : The XNOR Gate is logically equivalent to an inverted XOR. ie XOR gate
followed by a NOT gate(invertor) .The XNOR gate produces high (1) output, when the
input combination has even number of 1’s.

You might also like