0% found this document useful (0 votes)
9 views10 pages

lab 2 with answers

Uploaded by

Frost BiteTV
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views10 pages

lab 2 with answers

Uploaded by

Frost BiteTV
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Republic of the Philippines

POLYTECHNIC UNIVERSITY OF THE PHILIPPINES


COLLEGE OF ENGINEERING
COMPUTER ENGINEERING DEPARTMENT

CMPE 304
Logic Circuits and Design

EXPERIMENT NO.

2
BOOLEAN THEOREMS
Submitted by:
____________________

Submitted to:
____________________

Date Submitted:
_____________________

EXPERIMENT 2: BOOLEAN EXPRESSION SIMPLIFICATION 1


LAB 2: Boolean Theorems
Duration: 3 Hours

OBJECTIVES

The student will be able to do the following:


a. Identify the different Boolean Algebra Theorems and its properties.
b. Plot circuits and prove De Morgan’s Theorem equivalence.
c. Construct circuits and prove Distributive Law equivalence.
d. Simplify circuit equation by manipulation using Boolean equations.

INTRODUCTION

Boolean algebra is used for two-valued logic that is present on any


digital system. Named after in the honor of English Mathematician George
Boole, Boolean algebra describes the interconnection of digital gates
and how simplification can be implemented through its use.

EXPERIMENT 2: BOOLEAN EXPRESSION SIMPLIFICATION 2


Table 1 present the properties of Boolean algebra theorems. The first three
theorems state the properties of Boolean operations AND, OR, and NOT.
Theorem 3a states ORing logic-1 with anything will always result a logic-1.

Idempotent law (fourth theorem) states that repetitions of variables in an


expression are redundant and may be deleted.

Involution law produces a cancellation effect when double


complementation occurs as stated on Theorem 6.
Interchanging the order of variables does not change the result of the
operation as stated in Commutative law. Theorems 8 and 9 show
simplification of Boolean expression. De Morgan’s law the effect of
complementation on variables when connected by the AND and OR
operations.

Any order in groupings can be applied using Associative law when


ANDing and ORing of variables. Distributive law shows how factoring is
done using the same principle in algebra.

Take note of the symmetrical property of Boolean algebra equations. This is


known as the principle of duality. AND and OR operation (and vice versa)
can be interchanged on each occurrence.

Equation Complementation

The complement of an equation is obtained by the interchange of 1’s to 0’s


and 0’s to 1’s. To achieve this, we can apply it algebraically by using
DeMorgan’s theorem. The generalized form of this law states that
the complement of an expression is obtained by interchanging AND and
OR operations and complementing each variable each variable and
constant. Let us apply complementation on the following:

EXPERIMENT 2: BOOLEAN EXPRESSION SIMPLIFICATION 3


MATERIALS

1 Logic Probe
1 Fixed Power Supply
1 Breadboard
1 Long Nose Pliers
1 Wire Stripper Pliers
Connecting Wires

Integrated Circuits (ICs)


1 74LS00
1 74LS02
1 74LS04
1 74LS08
1 74LS32
1 74LS86

PROCEDURES

De Morgan’s Law

1. Construct Circuit 1 on your prototyping board. Take note of the


number assigned inside the logic gate symbols. This denotes the IC
number package designation for each IC that you will use.

2. Write the equivalent logic equation of Circuit 1.

_________________________________________________________________________

3. Construct circuit 2.

EXPERIMENT 2: BOOLEAN EXPRESSION SIMPLIFICATION 4


4. Write the equivalent logic equation of Circuit 2.
___________________________________________________________________

5. Test the different input combinations of Circuit 1 and Circuit 2 and fill-up
the following truth tables.

EXPERIMENT 2: BOOLEAN EXPRESSION SIMPLIFICATION 5


6. Do the two circuits equal in terms of output D? ________________________

7. If you were to choose between Circuit 1 and Circuit 2, which design will
you implement and why?

_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________

8. Simplify Circuit 1 equation using De Morgan’s theorem. Show your step-


by-step solution.

_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_____________________________________________________________________

EXPERIMENT 2: BOOLEAN EXPRESSION SIMPLIFICATION 6


Distributive Law

9. Construct Circuit 3.

10. Write the equivalent equation of Circuit 3.


____________________________________________________________________

11. Construct Circuit 4.

12. Write the equivalent equation of Circuit 4.


________________________________________________________________

13. Test the input combinations of Circuit 3 and 4 and fill up he following
truth tables.

EXPERIMENT 2: BOOLEAN EXPRESSION SIMPLIFICATION 7


14. If you were to choose between Circuit 3 and Circuit 4, which design will
you implement and why?
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
____________________________________________________________________

EXPERIMENT 2: BOOLEAN EXPRESSION SIMPLIFICATION 8


15. Simplify Circuit 3 equation using Distributive law. Show your step-by-
step solution. Hint: Apply the theorem on the shaded portion of Circuit
3.
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
_____________________________________________________________________
____________________________________________________________

CIRCUIT DIAGRAMS / SCHEMATICS


14 13 12 11 10 9 8 14 13 12 11 10 9 8
Vcc Vcc

GND GND
1 2 3 4 5 6 7 1 2 3 4 5 6 7
74LS08 - Quad 2-Input AND Gate 74LS00 - Quad 2-Input NAND Gate

14 13 12 11 10 9 8 14 13 12 11 10 9 8
Vcc Vcc

GND GND
1 2 3 4 5 6 7 1 2 3 4 5 6 7
74LS32 - Quad 2-Input OR Gate 74LS86 - Quad 2-Input XOR Gate

14 13 12 11 10 9 8 14 13 12 11 10 9 8
Vcc Vcc

GND GND
1 2 3 4 5 6 7 1 2 3 4 5 6 7
74LS02 - Quad 2-Input NOR Gate 74LS04 - Hex Inverter

Ffigure 2-1 Basic Gates Pin Configuration

EXPERIMENT 2: BOOLEAN EXPRESSION SIMPLIFICATION 9


CONCLUSION

EXPERIMENT 2: BOOLEAN EXPRESSION SIMPLIFICATION 10

You might also like