Scribd
Upload
29 views10 pages

ADE (1) Ca1

Uploaded by

omnamahshivay987654
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
29 views10 pages

ADE (1) Ca1

Uploaded by

omnamahshivay987654
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/ 10

Academy of Technology

Department: Computer Science & Engineering Semester: 3rd


Paper Name: Analog & Digital Electronics Paper Code: ESC - 301

Power Point Presentation on Boolean Algebra

Presented by,

Name of the Student: Vaskar Ghosh University Roll No.: 16900123157


To fulfil the requirement of Continuous Assessment 1 [CA1] of B. Tech Course

1
Basic Concepts:
Boolean Algebra is a mathematical system used to analyze and simplify logical
expressions. It deals with binary variables and logical operations like AND, OR,
and NOT.
Principles:
The principles of Boolean Algebra include laws and theorems that govern the
behavior of logical operations. Understanding these principles is key to
simplifying complex expressions.
Applications:
Boolean Algebra is fundamental in digital electronics, programming, and
computer science. It forms the basis of logic gates and truth tables.

2
BOOLEAN OPERATIONS:
AND:
• Represented by “ . ”​
• Returns true value(1)if both the operands are true (1).

OR:
• Represented by “+”​
• Returns true value(1) if at least one of the operands is true (1).​
NOT:
• Represented by “ ‘ ”​
• Returns the opposite of the operands value.

3
Truth Table:
• PURPOSE : Display how Boolean expression evaluate to true or false.
• EXAMPLE : For AND operation:

A B Y=A.B
0 0 0
0 1 0
1 0 0
1 1 1

4
BOOLEAN ALGEBRA LAWS:
• Commutative Law: A+B=B+A , A.B=B.A
• Associative Law: (A+B)+C=A+(B+C) , (A.B).C=A.(B.C)
• Distributive Law: A.(B+C)=(A.B)+(A.C) , A+(B.C)=(A+B).(A+C)
• AND LAW: A.0=0 , A.1=A , A.A=A , A.A’=0
• OR LAW: A+0=A , A+1=1 , A+A=A , A+A’=1
• INVERSION LAW: A’’=A
• ABSORPTION LAW: A+A.B=A(1+B)=A , A(A+B)=A
• REDUDANT LITERAL LAW: A+A’.B=A(1+B)+A’.B=A+B , A.(A’+B)=A.B

5
DE MORGAN’S THEOREM:
• STATEMENT 1: The complement of the products of two variables
is equal to the sum of the complements of individual variables.
(A.B)’=A’+B’

• STATEMENT 2: The complement of sum of two variables is equal


to the product of the complement of each variable.
(A+B)’=A’.B’

6
KARNAUGH MAPS(K-MAPS):

• Purpose: Simplify Boolean algebra expressions and logic circuit design.


• Structure: Grid representing truth table min-terms.
• Grouping: Combine adjacent 1s in powers of two (1, 2, 4, 8…).
• Benefit: Reduces expression complexity and streamlines logic circuits.

7
CONCLUSION:
• Core Idea: Boolean algebra uses binary variables and operations (AND,
OR, NOT) for logical expressions.
• Key Benefits: Simplifies and optimizes digital circuits and algorithms.
• Applications: Vital in computer science, electronics, and digital system
design.

Summary: Understanding Boolean algebra is essential for efficient logic


design and problem-solving in technology.

8
REFERENCES:
 Fundamentals of Digital Circuits, A. Anand Kumar, 2nd Edition, PHI.
 Digital Circuits & Design, S. Salivahanan & A. Arivazhagan.
 Boolean Algebra and Its Applications" by J. D. Hill and G. A. Peterson.
 "Digital Logic Design: Principles and Practices" by John F. Wakerly.

9
Thank You​

10

You might also like