Bulacan Agricultural State College Pinaod, San Ildefonso, Bulacan Institute of Engineering and Applied Technology Department of Information

Technology

Experiment No. 6 Theorems of Boolean Algebra

Score:

Submitted by: Jhendy Ramirez Joeylyn Marasigan Rosette Idion Submitted to: Engr. Myrtel Bernardo Instructor

Date

I. OBJECTIVES: 1. To familiarize with the different theorems of Boolean Algebra. 2. To know why Boolean algebra is considered as the backbone of computer circuit and analysis and design. II. DISCUSSION: Boolean algebra derives its name from the mathematician George Boole. Symbolic Logic uses values, variables and operations:

True is represented by the value 1. False is represented by the value 0. Variables are represented by letters and can have one of two values, either 0 or 1. Operations are functions of one or more variables.

AND is represented by X.Y OR is represented by X + Y NOT is represented by X' . Throughout this tutorial the X' form will be used and sometime! X will be used. Theorems AA=A A0=0 A ( A + B) = A A (NOT[A] + B) = A B A (B + C) = (A B) + (A C) NOT [A B] = NOT[A] de Morgan's + NOT[B] theorem

(6) (7) (8) (9) (10) (11)

A+A=A A+1=1 A + (A B) = A A + (NOT[A] B) = A + B (A B) + (NOT[A] C) + (B C) = (A B) + (NOT[A] C)

NOT

[A + B] = NOT[A] NOT[B]

III. MATERIALS: Logic Probe Bread board Connecting wire 5 V Power supply IV. PROCEDURES A. THE OR OPERATION a.1 Connect the circuit shown in figure 6.1.a. Trace the output of x using the given in out combination in table 6.1.a respectively then derive The Boolean relation. a.2 Disconnect the circuit. Now try to connect the next circuit in figure 6.2b with the use of table 6.1b, supply the given inputs and trace the output with its corresponding Boolean relation. a.3 Now connect figure 6.1c.derive the Boolean relation after supplying the inputs in table 6.1c. Record the output. 1 7404 Hex Inverter 1 7408 AND Gate 1 7432 OR Gate

B. THE AND OPERATION b.1 Repeat the procedure a.1 to a.3 but this time using table 6.2a and 6.2aa for the given circuit in figure 6.2a and table 6.2b for 6.2b and table 6.2c for figure 6.2c. C. THE MORGANS THEOREM c.1 Connect the circuit in figure 6.3a. Supply the given input combination in table 6.3a to get the output and derive the Boolean relation. c.2 Repeat step c.1 but this time using circuit in figure 6.3b,6.3c and 6.3d with their corresponding tables of results.
D. WALPOLE INVERSION /DOUBLE INVERSION

d.1 Using table 6.4, supply the given input to circuit 6.4. Find the output and Boolean Relation. E. ABSORPTION THEOREM e.1 Using table 6.5a and 6.5b, connect the circuit in figures 6.5a and 6.5b. Derive the Boolean relation after finding the output.

F. DISTRIBUTIVE LAW f.1 Consider the two circuits in figure 6.6a. Trace the output x1 and x2 using the given input combination in table 6.6a upon completion derive the Boolean relation. f.2 Write the logic diagram of figure 6.6b. Complete the table 6.6b and then derive the Boolean relation. V. DATA AND RESULTS:

VI. QUESTIONS AND PROBLEMS: 1. Consider the given logic equation below. Draw the logic diagram then simplify using Boolean algebra. Draw the diagram based on the simplified logic equation. X=A'BC' + A'B'C' + AB'C + AB'C' + A'B'C 2. From the given diagram trace the output using all the possible input combination. A 0 0 0 0 1 1 1 B 0 0 1 1 0 0 1 C 0 1 0 1 0 1 0 X

1 VII.

OBSERVATION AND DISCUSSION:

VIII. CONCLUSION: