NAME: CHUKWURAH RALUCHUKWU

COURSE: ELECTRICAL/ELECTRONICS ENGINEERING

COURSE TITLE: LABORATORY PRACTICALS II
COURSE CODE: EEE 316
REPORT TITLE: BOOLEAN ALGEBRA
DATE: THURSDAY 27TH APRIL, 2023

Introduction
Boolean algebra expressions may be used to construct digital truth tables for various
functions. Any logic gate or circuit's input and output data can be plotted into standard Boolean
Algebra truth tables in addition to a standard Boolean expression to provide a visual
representation of the switching function of the system. A truth table is the name given to the
table that is used to describe the boolean expression of a logic gate function. A truth table for a
logic gate displays every potential input combination for the gate or circuit along with the output
that will be produced based on the combination of these input(s).[1] The basic idea of boolean
algebra, which is concerned with binary variables and logical operations, is used in digital
electronics and computer science. It offers a methodical approach to manipulating logic
operations and putting them into the context of logic gates. The Boolean Operators are • + ‾ (A +
B means A OR B, A • B means A AND B, 𝐴̅ means NOT A. Compared to Boolean algebra,
Karnaugh maps reduce logic functions more rapidly and simply. It lessens the quantity of inputs
and gates.

Fig 1: Boolean Algebra Example

The basic Boolean reducing equations are given in Equations below:
A 1=A A+1=1 1 1=1 1+1=1

A 0=0 A+0=A 1 0=0 1+0=1

A A=A A+A=A 0 1=0 0+1=1

A 𝐴̅ = 0 A + 𝐴̅= 1 0 0=0 0 + 0= 0
 𝐴̿ = A

The aim of this experiment is to demonstrate the methods of simplifying logic equations.

Materials and Method

Materials
 DC power supply - (0 to 30V)
 Multi-meter
 IC 7400
 IC 7432
 IC 7404
 2 SPST Switch
 LED
 Jumper wires
 Bread Board.
Method
EXPERIMENT:
Procedure:
a. Construct a circuit as shown in figure 2.2. Make the voltage measurement at the required
points to complete Table 1

Fig 2.2
b. Construct a circuit as shown in figure 2.4. Make the voltage measurement at the required
points to complete Tables 2 and 3 using figure 2.4 for when input 1 is connected to
ground and when input 1 is connected to 5v
 Fig 2.4

c. Construct a circuit as shown in figure 2.6. Make the voltage measurement at the required
points to complete Table 4 using figure 2.6

Fig 2.6

d. Construct a circuit as shown in figure 2.8. Make the voltage measurement at the required
points to complete Table 5 using figure 2.8
 Fig 2.8
e. Construct a circuit as shown in figure 2.10. Make the voltage measurement at the
required points to complete Table 6 and 7 using figure 2.10 when input 1 is connected to
ground and 5v respectively

Fig 2.10
f. Construct a circuit as shown in figure 2.12. Make the voltage measurement at the
required points to complete Table 8 using figure 2.12

Fig 2.11

g. Construct a circuit as shown in figure 2.14. Make the voltage measurement at the
required points to Complete Table 9 using figure 2.14
 Fig 2.14

h. Construct circuits 2.16 and 2.17. Make the voltage measurement at the required points to
̅ B in figure
complete Tables 10 and 11 using figures 2.16 and 2.17 respectively. Locate 𝑨
2.16

Fig. 2.16

Fig. 2.17

Results
Experimental Data:

Fig 3.1: Fig 2.2 when the switch(input) is off

Fig 3.2: Fig 2.2 when the switch(input) is on

Fig 3.3: Fig 2.4 When the input 1 is connected to 5v
Fig 3.4: Fig 2.4 When the input 1 is connected to ground and the switch is off
Fig 3.5: Fig 2.4 When the input 1 is connected to ground and the switch is on
Fig 3.6: Fig 2.6 when the switch(input) is on

Fig 3.7: Fig 2.6 when the switch(input) is off

Fig 3.8: Fig 2.8 when the switch(input) is off
Fig 3.9: Fig 2.8 when the switch(input) is on
Fig 3.10: Fig 2.10 when input 1 is grounded and the switch(input 2) is on
Fig 3.11: Fig 2.10 when input 1 is connected to 5v and the switch(input 2) is on

Fig 3.12: Fig 2.12 when switch(input) is off

Fig 3.13: Fig 2.12 when switch(input) is on
Fig 3.14: Fig 2.14 when switch(input) is off
Fig 3.15: Fig 2.14 when switch(input) is on

Table 1: Table 2 from the Procedure

A Y(v)
0 0
+5 4.90
Table 2: Table 3 from the Procedure
A Y(v)
0 4.91
+5 4.91
Table 3: Table 4 from the Procedure
A Y(v)
0 0
+5 4.91
Table 4: Table 5 from the Procedure
A Y(v)
0 4.86
+5 4.86
Table 5: Table 6 from the Procedure
A X(v) Y(v)
0 5.05 0
+5 5.01 0
Table 6: Table 7 from the Procedure
A X(v) Y
0 5.28 0.01
+5 0.00 4.83
Table 7: Table 8 from the Procedure
A X(v) Y(v)
0 4.79 0.00
+5 0.00 4.75
Table 8: Table 9 from the Procedure
A X(v) Y(v)
0 5.00 0.13
+5 5.00 0.13
Table 9: Table 1 from the Procedure
A X(v) Y(v)
0 4.92 0.01
+5 0.01 4.86
Table 10: Table 10 from the Procedure
A B 𝑨 ̅ B(v) X(v) Y
0 0 0.00 0.00 0.00
0 +5 4.89 4.84 4.85
+5 0 0.00 4.86 4.86
+5 +5 0.00 4.88 4.88
Table 11: Table 11 from the Procedure
A B X(v) Y(v)
0 0 4.72 0.00
0 +5 1.93 4.76
+5 0 1.99 4.74
+5 +5 0.00 4.85

Boolean Representation of X, Y and inputs for each circuit

Fig 2.2:

X= 𝐴
Y=𝐴=A
Fig 2.4:
Y = 0+A (when input 1 is grounded)
Y = 1 + A (when 5v is applied to input 1)
Fig 2.6:
Y= A + A
Fig 2.8:

Y=A+𝐴
Fig 2.10:
When input 1 is grounded

X = 0 .𝐴

Y = 0. 𝐴
When 5v is applied to input 1

X = 1 .𝐴

Y = 1. 𝐴
Fig 2.12:

X= 𝐴. 𝐴

Y= 𝐴. 𝐴 =A
Fig 2.14:

X=𝐴+𝐴

Y= 𝐴 + 𝐴
Fig 2.16:

X= A + B.𝐴
Y=𝐴+𝐵
Fig 2.17:

X= 𝐴 + 𝐵
Theoretical Data

Table 12: Verification for Tables 2 and 3

Input 1 Input 2 Output
Ground 0 0 0
0 1 1
5v 1 0 1
1 1 1
Table 13: Verification for fig 2.10
Input 1 Input 2 Output
Ground 0 0 0
0 1 0
5v 1 0 0
1 1 1

Table 14: Karnaugh Map for Table 10

AB 𝐴B A𝐵 𝐴𝐵
01 11 00 10
A 1 1 1 1
1
𝐴 1
0
X= A + 𝑨B
Karnaugh Map for Y
A 𝐴
1 0
B 1 1 1
𝐵 0 1 0
Y= A+B
Discussion
The digital (logic) circuits are analyzed and made simpler using Boolean algebra. It
solely employs the binary numerals 0 and 1, or bits. It can also be referred to as logical algebra
or binary algebra. The most crucial thing to keep in mind about Boolean algebra is that its
techniques and approach are considerably different from those of normal mathematical algebra.
Let's first study about the history of Boolean algebra, including how it was created and
developed, before learning about it. Mathematical operators like +, -, *, and / are used to express
mathematical operations between algebraic variables in general mathematics. Similar to this,
logical operators like AND, OR, and NOT operations are used to express Boolean operations in
Boolean algebra. There are three different sorts of fundamental Boolean operations. And, or, and
not operations are what they are called. The Laws of Boolean Algebra are a collection of
functions or theorems that were developed as a set of guidelines to assist minimize the number of
logic gates required to carry out a given logic operation. The fundamental rules of Boolean
algebra are identical to those of regular algebra. These rules include the commutative law, which
permits changes in position for addition and multiplication, the associative law, which permits
the removal of brackets for addition and multiplication, and the distributive law, which permits
factoring of an expression. Compared to Boolean algebra, Karnaugh maps reduce logic functions
more rapidly and simply. Karnaugh maps can take two forms: Sum of Product(SOP) and Product
of Sum(POS) according to the problem. Karnaugh map is a representation but it gives more
explanation compared to the truth table.
In this experiment, we designed a circuit to verify the laws of Boolean algebra. Logic
circuits were provided and we generated the Boolean expressions for them. In a logic circuit, an
inverter is a crucial building block of digital electronics. It has a single input and an output which
is the complement of its input. Several tasks are carried out by inverters, such as signal inversion,
buffering, and signal level conversion. Additionally, they are employed in the creation of digital
logic gates, such as NOR and NAND gates, which serve as the fundamental components of more
intricate digital circuits. In Fig 2.10, the inverter inverts the input of A to give an output of 1
always. In Fig 2.12, the inverter inverts to give an output of A. In Fig 2.14, the inverter inverts A.
These all help in proofing the laws of Boolean algebra. Here, logic gates are used to construct
and test digital circuits. Multi-sim was used as a verification tool to ensure all our results
correlated. The truth tables above were also used to prove Boolean algebra. Truth tables are an
effective tool for evaluating the reliability of logical circuits and expressions. For a certain
logical process or circuit, they display every conceivable combination of inputs together with the
consequent output.

Conclusion
In conclusion, the objectives of this experiment may be said to have been met as we were
able to verify the laws of Boolean algebra and study the methods of representing and simplifying
logic equations by Boolean algebra. Boolean algebra is a potent instrument that is crucial in
contemporary technology. It gives programmers a strong basis for designing and constructing
digital circuits and software algorithms and aids in the creation of intricate systems that function
effectively and consistently. This experiment provided us with hands-on experience in applying
the principles of Boolean algebra. By learning how to simplify Boolean expressions, prove
Boolean identities and design and test digital circuits, we were able to develop our logical
reasoning skills, critical thinking skills and problem-solving skills. The design of Karnaugh maps
also provided us a valuable learning experience. Boolean expressions can be streamlined and
optimized using Karnaugh maps. They give engineers and programmers a visual depiction of
logical operations, enabling them to streamline complicated Boolean statements and create more
effective digital circuits. Karnaugh maps are used in digital circuit design to lessen the quantity
of logic gates needed to construct a circuit, which in turn lowers cost, power usage, and the
possibility of mistakes. As a result, designing and maintaining digital circuits becomes simpler
and more dependable.
References
[1] ElectronicsTutorials. (2023, April 30). Boolean Algebra Truth Tables. [online]. Available:
https://www.electronics-tutorials.ws/boolean/bool_7.html

[2] Allaboutcircuits. (2023, April 30). Karnaugh Maps, Truth Tables, and Boolean
Expressions | Karnaugh Mapping | Electronics Textbook.[online]. Available:
https://www.allaboutcircuits.com/textbook/digital/chpt-8/karnaugh-maps-truth-tables-
boolean-expressions/
[3] Tutorialspoint. (2023, May 01). Boolean Algebra.[online].Available:
https://www.tutorialspoint.com/computer_logical_organization/boolean_algebra.html

Appendices
Rules in Boolean Algebra
Following are the important rules used in Boolean algebra.

Variable used can have only two values. Binary 1 for HIGH and Binary 0 for LOW.

Complement of a variable is represented by an overbar (-). Thus, complement of variable B is

represented as B Bar. Thus if B = 0 then B Bar = 1 and B = 1 then B Bar = 0.

ORing of the variables is represented by a plus (+) sign between them. For example ORing of A,
B, C is represented as A + B + C.
Logical ANDing of the two or more variable is represented by writing a dot between them such
as A.B.C. Sometime the dot may be omitted like ABC.