Professional Documents
Culture Documents
B
0
C
0
2.
Draw a simple NOT, AND, OR circuit in sum of products (SOP) form that
represents the equation in problem 1.
3.
The truth table for a Boolean expression is shown below. Write the Boolean
expression in SOP form
x
0
0
0
0
1
1
1
1
y
0
0
1
1
0
0
1
1
z
0
1
0
1
0
1
0
1
F
1
0
0
1
1
0
1
0
4.
5.
F=?
a
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
b
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
c
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
d
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1