TONO, John Jerry Nathaniel P.

BSCpE-3

Experiment # 2

Boolean Equation

Objectives

At the end of the experiment, the students are expected to:

● understand and implement Boolean Algebra rules in logic circuits.

● interpret Boolean equation in the construction of logic circuits.

Preparation

The fundamental laws of Boolean algebra are important since they

provide a means for evaluating and simplifying Boolean expressions, and they

form the basis from which numerous Boolean theorems can be derived.

Formally a Boolean algebra is a mathematical system consisting of a set of

elements, which may be called B, together with two binary operations, which

may be denoted by the symbols Å and Ä. These operations are defined on the

set B and satisfy the following axioms:

1. Å and Ä are both commutative operations. That is, for any elements x, y of

the set B, it is true that xÅy = yÅx, and xÄy = yÄx.

2. Each of the operations Å and Ädistributes over the other. That is, for any

elements x, y, and z of the set B, it is true that xÅ (yÄz) = (xÅy) Ä(xÅz), and

xÄ (yÅz) = (xÄy) Å (xÄz).

3. There exists in the set B a distinct identity element for each of the

operations Å and Ä. These elements are usually denoted by the symbols 0

and 1 such that 0 ? 1, and have the property that 0 Åx = x, and 1 Äx = x for

any element x in the set B.

4. For each element x in the set B there exists a distinct corresponding

element called the complement of x, usually denoted by the symbol x'. With

respect to the operations Å and Ä, the element x' has the property that xÅx' =

0 and xÄx' = 1.

Boolean algebra has many practical applications in the physical sciences,

particularly in the field of computers and electronics. As an example of an

application of Boolean algebra in electrical-circuit theory, let p and q denote

two propositions, that is, declarative sentences that are either true or false but

not both. If each of the propositions p and q is associated with a switch that

will be closed if the proposition is true, and open if the proposition is false,

then the statement p ^ q may be represented by connecting the switches in

series. The current will flow in this circuit if and only if both switches are

closed, that is, if both p and q are true. Similarly, the circuit can be used to

represent the statement pÚq. In this case the current will flow if either p or q

or both are true and the respective switches are closed. More complicated

statements give rise to more complex switching circuits.

Materials

Digital Logic Trainer Connectors

Procedure

1. Derive the truth table (manually) of the given Boolean

equation.

a. F = ( x + y’ ) ( x’ + y’ ) ( x + y )

x y x’ y’ (x+y’) (x’+y’) (x+y) F

0 0 1 1 1 1 0 0

0 1 1 0 0 1 1 0

1 0 0 1 1 1 1 1

1 1 0 0 1 0 1 0

b. F = ( a’ + b ) ‘ ( c’ ) + ( a ’b’ + c )’

a b c a’ b’ c’ (a’+b) (a’+b)’ (a’ + b)’(c’) (a’ b’ + c)’ F

0 0 0 1 1 1 1 0 0 0 0

0 0 1 1 1 0 1 0 0 0 0

0 1 0 1 0 1 1 0 0 1 1

0 1 1 1 0 0 1 0 0 0 0

1 0 0 0 1 1 0 1 1 1 1

1 0 1 0 1 0 0 1 0 0 0

1 1 0 0 0 1 1 0 0 1 1

1 1 1 0 0 0 1 0 0 0 0
 c. F = [( a + b ) + ( ab’c )]’

a b c b’ (a+b) ab’ (ab’c) F

0 0 0 1 0 0 0 1

0 0 1 1 0 0 0 1

0 1 0 0 1 0 0 0

0 1 1 0 1 0 0 0

1 0 0 1 1 0 0 0

1 0 1 1 1 0 1 0

1 1 0 0 1 1 0 0

1 1 1 0 1 1 0 0

d. F = ( x + y + z)( x + y + z’ )( x’ + y + z )

x y z x’ z’ (x+ y+ z) ( x + y + z’ ) ( x’ + y + z ) F

0 0 0 1 1 0 1 1 0

0 0 1 1 0 1 0 1 0

0 1 0 1 1 1 1 1 1

0 1 1 1 0 1 1 1 1

1 0 0 0 1 1 1 0 0

1 0 1 0 0 1 1 1 1

1 1 0 0 1 1 1 1 1

1 1 1 0 0 1 1 1 1
2. Draw the circuit of procedure 1 and label them as Circuit-A,

Circuit-B, Circuit-C and Circuit-D correspondingly.

3. Connect the circuit using the logic trainer and derive the truth

table of each circuit. Label the truth table as Table-A, Table-B,

Table-C and Table-D correspondingly.

 4. Are the truth tables of procedures 1 and 3 the same?

The truth tables on procedures 1 and 3 are the same. Verified through

the simulation.

5. Derive the truth table of the circuit of Figure 10. Label the truth

table as Table-E.

6. Using Boolean algebra rules and postulates derive the Boolean

equation of the circuit of figure 10.

= [ (a + b) + (b + c) ’ ] ’ ⊕(b+c)’(c)
 7. Derive the truth table of the given circuit in figure 10 basing from

the truth table. Label table as Table-F.

F = [ (a + b) + (b + c) ’ ] ’ ⊕(b+c)’(c)

a b c c’ a+b b+c (b+c)’ (a + b) + (b + c) (a + b) + (b + c) ‘ [ (a + b) + (b + c) ’ ] ’ (b + c)’(c) F

0 0 0 1 0 0 1 0 1 0 0 0

0 0 1 0 0 1 0 1 0 1 0 1

0 1 0 1 1 1 0 1 1 0 0 0

0 1 1 0 1 1 0 1 1 0 0 0

1 0 0 1 1 0 1 1 1 0 0 0

1 0 1 0 1 1 0 1 1 0 0 0

1 1 0 1 1 1 0 1 1 0 0 0

1 1 1 0 1 1 0 1 1 0 0 0

8. Are Table-E and Table-F the same?

Tables E and F are the same

Observation:

I have observed that in deriving both logic circuits and boolean

expressions, we have to get the truth table in order to accurately select

what logic gate should we use.

Conclusion:

In conclusion, we can use Boolean Equation in creating a circuit.

Also, we can formulate an equation with the use of logical circuits. By

so, we can use either the equation or circuit to derive one another.

Questions

1. What is the equivalent Boolean expression for an OR gate?

X=A+B

2. What is the equivalent Boolean expression for an AND gate?

X = A.B

3. What is the equivalent Boolean expression for an NOR gate?

X  (A  B)

4. What is the equivalent Boolean expression for an NAND gate?

X  A.B

5. What is the equivalent Boolean expression for an Exclusive-OR gate?

X  (A  B)