Scribd
Upload
2 views

LAB 2

The document is a lab report by Jawad Ahmed on Boolean Algebra and its application in logic circuit design. It outlines fundamental laws of Boolean Algebra, including Commutative, Associative, Distributive, AND, OR, Inversion, and Absorption Laws, and explains their significance in circuit simplification. Additionally, it discusses the use of truth tables to analyze logic circuits and emphasizes the importance of Boolean algebra in digital system optimization.

Uploaded by

Jawad Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

LAB 2

The document is a lab report by Jawad Ahmed on Boolean Algebra and its application in logic circuit design. It outlines fundamental laws of Boolean Algebra, including Commutative, Associative, Distributive, AND, OR, Inversion, and Absorption Laws, and explains their significance in circuit simplification. Additionally, it discusses the use of truth tables to analyze logic circuits and emphasizes the importance of Boolean algebra in digital system optimization.

Uploaded by

Jawad Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Lab Report 3

Jawad Ahmed

Sir Usama Shaukat


—
Logic & Sequential
Circuit Design
—
10th February, 2025
—

Syndicate A

—
533047
BOOLEAN ALGEBRA RULES AND LOGIC CIRCUITS

Boolean Algebra and Laws

Introduction to Boolean Algebra


Boolean Algebra is a mathematical approach used to analyze and simplify logic circuits. It operates solely on
binary values, which are 0 and 1. This algebraic system is also known as Binary Algebra or Logical Algebra.
The concept was introduced by George Boole in 1854.

Boolean Laws
Boolean Algebra follows specific fundamental laws that help in circuit simplification and logic design. These
laws are as follows:

1. Commutative Law

The Commutative Law states that the order of operands does not affect the result of an operation.

 For Addition (OR Operation):

A+B=B+A

 For Multiplication (AND Operation):

A.B=B.A

2. Associative Law

This law states that changing the grouping of operands does not affect the result.

 For OR Operation:

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

 For AND Operation:

A ⋅ (B⋅C) = (A⋅B) ⋅ C

3. Distributive Law

This law combines both AND and OR operations:

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


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

JAWAD AHMED
4. AND Law

A⋅1=A
 Identity Law:

A⋅0=0

5. OR Law

 Identity Law:
A+0=A
A+ 1=1

6. Inversion Law

 Double Negation:
(A`)` = A

7. Absorption Law

A ⋅ (A+B) = A
 A + A⋅B = A

Truth Table and Circuit Diagram Explanation


A truth table is a tabular representation that lists all possible input values and their corresponding output
values in a logic circuit. It helps in understanding how a circuit functions by systematically analyzing different
input conditions.

Each Boolean law has a corresponding circuit that visually represents its working using logic gates such as
AND, OR, and NOT.

Tasks
1. Absorption Law:

Formula: A + A.B = A(A + B) = A

A | B | A.B | A + A.B
----------------------
0|0| 0 | 0
0|1 | 0 | 0
1 |0| 0 | 1
1 |1 | 1 | 1

JAWAD AHMED
Conclusion
Boolean algebra plays a crucial role in digital circuit design and logic simplification. Understanding
these laws helps in constructing optimized and efficient digital systems. The truth tables and formulas discussed
above provide a foundational understanding of Boolean logic operations.

JAWAD AHMED

You might also like