BOOLEAN ALGEBRA, LOGIC GATES AND TRUTH TABLES

Project Writeup

Yashoda Hansraj (1051333), Triston Jonothan Evelyn (1040245),

Sharadial Sewdial (1052872) and Jasmin Jo-Lisa Osborne ()

Department of Computer Science, University of Guyana

CSE1200 – Introduction to Computing II

Mr. Renard Jacobis

May 7, 2025
PART A
Simplify the expression using Boolean Algebra Laws. Given Expressions:
1. F = AB + A’B + AB’
2. F = X’Y + XY’Z + XYZ
3. F = (P + Q)R + PR

1. F = AB + A’B + AB’

F=AB+A′B+AB′=(AB+A′B)+AB′
F = AB + A'B + AB' = (AB + A'B) + AB'
F=AB+A′B+AB′=(AB+A′B)+AB′
F=B(A+A′)+AB′
F = B(A + A') + AB'
F=B(A+A′)+AB′

A+A′=1A + A' = 1A+A′=1, so:

F=B(1)+AB′=B+AB′
F = B(1) + AB' = B + AB'
F=B(1)+AB′=B+AB′
F=B+AB′
F = B + AB'
F=B+AB′
B+AB′=B(1+A′)=B⋅1=BB + AB' = B(1 + A') = B .1 = BB+AB′=B(1+A′)=B⋅1=B
Answer: F=B
2. F = X’Y + XY’Z + XYZ

F=X′Y+XY′Z+XYZ
F = X'Y + XY'Z + XYZ
F=X′Y+XY′Z+XYZ
XY′Z+XYZXY'Z + XYZXY′Z+XYZ
F=X′Y+X(Y′Z+YZ)
F = X'Y + X(Y'Z + YZ)
F=X′Y+X(Y′Z+YZ)
Y′Z+YZ=Z(Y′+Y) =Z(1)=ZY'Z + YZ = Z(Y' + Y) = Z(1) = ZY′Z+YZ=Z(Y′+Y)=Z(1)=Z
F=X′Y+XZF = X'Y + XZ
F=X′Y+XZ
Answer: F=X′Y+XZ

3. F = (P + Q)R + PR

F=PR+QR+PR
F=PR+QRF = PR + QR
F=PR+QR
Answer: F=R(P+Q)
PART B
Draw the logic gate circuit diagram of the simplified expression from part (a) above. Given
expressions:
1. F = AB + A’B + AB’
2. F = X’Y + XY’Z + XYZ
3. F = (P + Q)R + PR

i) F=B

B F

ii) F = X′Y + XZ

Z
X

Y
iii) F = R (P + Q)

Q F

R
PART C
Construct the Truth Table for the original and simplified expressions. Verify the equivalence of
the original and simplified expression. Given expressions:
1. F = AB + A’B + AB’
2. F = X’Y + XY’Z + XYZ
3. F = (P + Q)R + PR

i) F=B

B F
0 1
1 0

ii) F = X′Y + XZ

X Y Z X′ X′Y XZ F = X′Y + XZ
0 0 0 1 0 0 0
0 0 1 1 0 0 0
0 1 0 1 1 0 1
0 1 1 1 1 0 1
1 0 0 0 0 0 0
1 0 1 0 0 1 1
1 1 0 0 0 0 0
1 1 1 0 0 1 1

iii) F = R (P + Q)

R P Q P+Q F = R(P + Q)
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 1 0
1 0 0 0 0
1 0 1 1 1
1 1 0 1 1
1 1 1 1 1
PART D
PART E
Explain the importance of simplification in digital design. Given expressions:
1. F = AB + A’B + AB’
2. F = X’Y + XY’Z + XYZ
3. F = (P + Q) R + PR

In digital design, simplification involves reducing Boolean expressions to the simplest form. It
allows for easier analysis and more efficient management of electrical systems, as well as lower
power consumption and cost savings in electrical and digital devices. One of the primary tools
used for circuit simplification is Boolean Algebra, which simplifies logic gates and digital
circuits.

Simplifying circuits using Boolean Algebra primarily involves reducing the size and complexity
of the circuit while maintaining its logical behaviour. The process typically involves the
following steps:
1. Write down the Boolean Expression: Start by converting the given logic circuit into its
corresponding Boolean expression. This expression represents the exact logical behaviour of
the circuit.
2. Simplify the Expression: Apply Boolean algebra rules and properties to simplify the
expression. The objective is to reduce the number of terms and variables in the expression as
much as possible.

This systematic approach to circuit simplification harnesses the power of Boolean algebra,
reducing the complexity of logic circuits while maintaining their original logical functionality.
Remember, simplifying a circuit doesn't mean that it will lose any of its existing features or
functions. On the contrary, it helps to enhance the overall efficiency and reliability of the system.
1. F = AB + A’B + AB’
F=AB+AB′+A′B Group the terms

AB+AB′=A(B+B′)=A(1)=A
Combine AB+AB′
So,
F=A+A′B

Simplify A+A′B:
A+A′B=(A+A′)(A+B)=1(A+B) =A+B Using distributive law

Simplified Expression: F = A + B

2. F = X’Y + XY’Z + XYZ

X′Y+XY′Z+XYZ Group and factor the terms

X(Y′Z+YZ)

Y′Z+YZ=Z(Y′+Y)=Z(1)=Z
Using distributive law
XY′Z+XYZ=XZ

F=X′Y+XZ
Simplified Expression: F = X'Y + XZ

3. F = (P + Q)R + PR

PR+QR
Using distributive law
F=PR+QR+PR

PR+PR=PR
Combine like terms
F=PR+QR
Simplified Expression: F = PR + QR
 REFERENCES

StudySmarter. (n.d.). Circuit algebra. StudySmarter.

https://www.studysmarter.co.uk/explanations/computer-science/computer-organisation-and-
architecture/circuit-algebra/#:~:text=Simplifying%20circuits%20allows%20for%20easier,logic
%20gates%20and%20digital%20circuits