TASK 1

Boolean Expression from figure

Z=1[(A+B)(C+D)+0

2. Truth table from Boolean Expression

Input Output
A B C D
0 0 0 0 0 1
0 0 0 1 0 1
0 0 1 0 0 1
0 0 1 1 0 1
0 1 0 0 0 1
0 1 0 1 0 1
0 1 1 1 0 1
1 0 0 0 0 1
1 0 0 1 0 1
1 0 1 0 0 1
1 0 1 1 0 1
1 1 0 0 0 1
1 1 0 1 1 0
1 1 1 0 1 0
1 1 1 1 1 0
3. Evaluate output Z from input (A,B,C,D)

Input Output
A B C D 1.(AB)(C+D) 1.[(AB)(C+D).0̅]’
0 0 0 0 0 1
0 0 0 1 0 1
0 0 1 0 0 1
0 0 1 1 0 1
0 1 0 0 0 1
0 1 0 1 0 1
0 1 1 1 0 1
1 0 0 0 0 1
1 0 0 1 0 1
1 0 1 0 0 1
1 0 1 1 0 1
1 1 0 0 0 1
1 1 0 1 1 0
1 1 1 0 1 0
1 1 1 1 1 0

Example:

A=1

B=1

C=0

D=1

1.[(AB)(C+D).0̅]’ = 1.[(1)(1)]. 0̅ ]’

=1x1 through inverter becomes 0

TASK 2

a) X = ̅̅̅̅̅̅
𝐴𝐵𝐶 + 𝐷̅

INPUT OUTPUT
A B C D
0 0 0 0 1
0 0 0 1 1
0 0 1 0 0
0 0 1 1 1
0 1 0 0 1
0 1 0 1 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 0
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1
 ̅̅̅̅̅̅ + 𝐶̅ + 𝐴𝐵̅𝐷
b) Y= 𝐴𝐵𝐷

INPUT OUTPUT
A B C D
0 0 0 0 1
0 0 0 1 0
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 0
1 1 1 0 1
1 1 1 1 1
TASK 3

The boolean expression based on the figure is Z=𝐴̅B+AB𝐶̅

2) Truth table

INPUT OUTPUT
A B C 𝐴̅B+AB𝐶̅
O O O 0
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 0

3) Simplify the Boolean expression

=𝐴̅B+AB𝐶̅ – apply distributive law

=B(𝐴̅+A𝐶̅ ) – apply absorption law

=B(𝐴̅+𝐶̅ ) – apply demorgan theorem

=B(𝐴̅𝐶̅ )

=B𝐴̅𝐶̅
4) construct logic circuit using with two input gates only

5) Construct logic circuit using one NAND gate and one AND gate only
Discussion and Conclusion

The experiment enables us to verify De Morgan's theorem, to used AND gate ,OR gate, and to use
Exclusive NOR gate circuit to operate as an NAND gate.

The first part is focus in verifying De Morgan's Theorem. It states that negation of a Boolean
expression maybe accomplished by negating each variable and changing each AND to OR and vice
versa. For verifying the OR expression and building the required circuit, the LED is turned off when
both the input is grounded or have a logic of 0 otherwise it is turned on which represent logic 0 for
the output. For verifying the AND expression and building the required circuit, the LED is turned on
when both the input voltage is 5V so the logic is 1 otherwise the LED is turned off wherein the logic
is 0. Based on the data in the truth table, the output

The experiment allows us to test De Morgan's theorem, as well as use a AND circuit as an OR gate
and a NOR circuit as an AND gate.

The first section is dedicated to proving De Morgan's Theorem. It says that you can negate a Boolean
statement by negating each variable and turning each AND to OR and vice versa. When both inputs
are grounded or have a logic of 0, the LED is turned off to check the OR expression and build the
appropriate circuit; otherwise, it is turned on to signify logic 0 for the output. The LED is turned on to
test the AND expression and build the appropriate circuit when both the input voltages are 5V,
indicating that the logic is 1, otherwise the LED is turned off, indicating that the logic is 0. The output
is based on the data in the truth table.