Scribd
Upload
2 views24 pages

L3 - Boolean Algebra 1

Boolean algebra is a mathematical framework for manipulating logical values, crucial for digital circuits and programming. It involves variables, constants, and operators like NOT, AND, and OR, and is represented through expressions and truth tables. The document also includes exercises for simplifying Boolean expressions and converting truth tables into Boolean expressions.

Uploaded by

rayhan.khandaker
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
2 views24 pages

L3 - Boolean Algebra 1

Boolean algebra is a mathematical framework for manipulating logical values, crucial for digital circuits and programming. It involves variables, constants, and operators like NOT, AND, and OR, and is represented through expressions and truth tables. The document also includes exercises for simplifying Boolean expressions and converting truth tables into Boolean expressions.

Uploaded by

rayhan.khandaker
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/ 24

EEE 211: Digital Logic Design

Lecture – 3 : Boolean Algebra 1

1
What is it?

Boolean algebra is a branch of mathematics dealing


with logical values (true/false) represented by 0
(false) and 1 (true). It provides a set of rules and
operations for manipulating these values
Why is it important?

Boolean algebra is fundamental in understanding the


principles behind digital circuits, computer
programming, and logic design. It forms the basis for
designing complex electronic systems and
algorithms.
How to represent it?
Variables: Symbolic representations of logical values (e.g., X, Y, Z). They
can be assigned either 0 or 1.
Boolean Constants: The two fixed values: 0 (false) and 1 (true).
Operators:
• NOT (~, ¬, or '): Inverts the value of a single variable (e.g., ~1 = 0, ~0
= 1).
• AND (⋅, ∧, or &): Returns 1 only if both inputs are 1 (e.g., 1 ⋅ 1 =
1, otherwise 0).
• OR (+, ∨, or |): Returns 1 if at least one input is 1 (e.g., 0 + 1 =
1, otherwise 0).
Boolean Expressions: Composed of variables, constants, and operators
using parentheses for order of operations (e.g., ~(X + Y) ⋅ Z).
How to represent it?
Basic Laws of Boolean Algebra
Truth Table

A truth table is a breakdown of all the possible truth values


returned by a logical expression. A truth value is typically
either true or false, or 1 or 0. In some cases, the value
might be based on another binary system, such as on and
off or open and closed, but these are not as common.
Truth Table
A truth table is a breakdown of all the possible truth values
returned by a logical expression. A truth value is typically
either true or false, or 1 or 0. In some cases, the value
might be based on another binary system, such as on and
off or open and closed, but these are not as common.
Logic Gates
Logic Gates
Logic Gates
Logic Gates
Logic Gates
Logic Gates
Logic Gates
Simplification of Boolean Expression
Simplification of Boolean Expression
Simplification of Boolean Expression
Simplification of Boolean Expression

Exercise :
1. (A + B’ + C’) (A + B’ + C) (A + B + C’)

2. (AB’(C+BD) + A’B’)C

3. XY + X(Y+Z) + Y(Y+Z)
Simplification of Boolean Expression

1.
Simplification of Boolean Expression

2.
Simplification of Boolean Expression

3.
Truth Table to Boolean Expression
Practice

Write Boolean
Expression from
truth table

You might also like