Polygen | Boolean Algebra Lab

📘 Concepts

📘 Boolean Algebra Theory

What is Boolean Algebra?

Boolean Algebra is a mathematical system used to represent and simplify logical expressions. It was developed by George Boole and forms the foundation of Digital Electronics and Computer Science. Unlike ordinary algebra, Boolean Algebra uses only two values: 0 = FALSE
1 = TRUE

Used in: • Digital Circuits
• Computer Logic
• Microprocessors
• Control Systems
• Programming Logic

Boolean Variables

A Boolean Variable can have only two possible values: A = 0 or 1
B = 0 or 1
C = 0 or 1

Example: A = TRUE
B = FALSE

Boolean Operators

AND → .
OR → +
NOT → '

Examples: A.B
A+B
A'

Basic Logic Gates

Logic Gates are electronic circuits that perform Boolean operations.

AND Gate

Expression: Y = A.B Output is 1 only when all inputs are 1. Truth Table: A B | Y
0 0 | 0
0 1 | 0
1 0 | 0
1 1 | 1

OR Gate

Expression: Y = A + B Output is 1 when any input is 1. Truth Table: A B | Y
0 0 | 0
0 1 | 1
1 0 | 1
1 1 | 1

NOT Gate

Expression: Y = A' Output is the complement of input. Truth Table: A | Y
0 | 1
1 | 0

Universal Gates

Universal Gates can implement any Boolean function without using any other gate. There are two Universal Gates: • NAND Gate
• NOR Gate

NAND Gate

Expression: Y = (A.B)' Truth Table: A B | Y
0 0 | 1
0 1 | 1
1 0 | 1
1 1 | 0

NOR Gate

Expression: Y = (A+B)' Truth Table: A B | Y
0 0 | 1
0 1 | 0
1 0 | 0
1 1 | 0

XOR Gate (Exclusive OR)

Expression: Y = A⊕B Output is 1 when inputs are different. Truth Table: A B | Y
0 0 | 0
0 1 | 1
1 0 | 1
1 1 | 0

Applications: • Binary Addition
• Error Detection
• Comparators

XNOR Gate (Exclusive NOR)

Expression: Y = (A⊕B)' Output is 1 when inputs are equal. Truth Table: A B | Y
0 0 | 1
0 1 | 0
1 0 | 0
1 1 | 1

Applications: • Equality Checking
• Comparators

Boolean Laws

These laws help simplify logical expressions.

Identity Law

A + 0 = A
A . 1 = A

Null Law

A + 1 = 1
A . 0 = 0

Idempotent Law

A + A = A
A . A = A

Complement Law

A + A' = 1
A . A' = 0

Involution Law

(A')' = A

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) = AB + AC
A + BC = (A+B)(A+C)

Absorption Law

A + AB = A
A(A+B) = A

De Morgan's Theorems

Very important in Digital Electronics.

First Theorem: (A.B)' = A' + B'

Second Theorem: (A+B)' = A'.B'

Used extensively in NAND and NOR implementations.

Canonical Forms

Boolean expressions can be represented in standard forms.

Minterm

A Minterm contains all variables exactly once. Example: A'BC A minterm produces output 1 for exactly one combination. Notation: Σ (Sigma) Example: F(A,B,C)=Σ(1,3,5,7)

Maxterm

A Maxterm contains all variables exactly once. Example: (A+B'+C) A maxterm produces output 0 for exactly one combination. Notation: Π (Pi) Example: F(A,B,C)=Π(0,2,4,6)

SOP (Sum of Products)

Product terms are ORed together. Example: F = A'B + BC + AC'

Structure: AND terms → OR

Used widely in logic circuit design.

POS (Product of Sums)

Sum terms are ANDed together. Example: F = (A+B)(A'+C)(B+C)

Structure: OR terms → AND

Used in NOR-based implementations.

Karnaugh Map (K-Map)

A graphical method used to simplify Boolean expressions. Advantages: • Reduces logic gates
• Minimizes hardware cost
• Simplifies SOP and POS forms
Grouping Sizes: 1, 2, 4, 8, 16 ...

Important Exam Facts

• Boolean Algebra was developed by George Boole.
• Boolean variables have only two states: 0 and 1.
• NAND and NOR are Universal Gates.
• XOR outputs 1 when inputs differ.
• XNOR outputs 1 when inputs are equal.
• De Morgan's Theorems are frequently asked in exams.
• SOP uses Minterms and Sigma notation.
• POS uses Maxterms and Pi notation.
• K-Maps are used to simplify Boolean expressions.
• NAND implementation is common in digital IC design.

Applications of Boolean Algebra

• Digital Electronics
• Logic Circuit Design
• Microprocessors
• Computer Architecture
• PLC Systems
• Embedded Systems
• Robotics
• Artificial Intelligence
• Communication Systems
• Computer Programming

Boolean Algebra Theory