Boolean Equations
- Construct the truth table for the Boolean equation: '+A'B
|
Inputs
|
Output
|
|
A
|
B
|
C
|
|
0
|
0
|
0
|
|
0
|
1
|
1
|
|
1
|
0
|
...
|
|
1
|
1
|
...
|
- Draw a simple NOT, AND, OR circuit in sum of products (SOP) form that represents the equation above.
- The truth table for a Boolean expression is shown below. Write the Boolean expression on SOP form
|
Inputs
|
Output
|
|
A
|
B
|
C
|
Sum
|
|
0
|
0
|
0
|
0
|
|
0
|
0
|
1
|
1
|
|
0
|
1
|
0
|
1
|
|
0
|
1
|
1
|
0
|
|
1
|
0
|
0
|
1
|
|
1
|
0
|
1
|
0
|
|
1
|
1
|
0
|
0
|
|
1
|
1
|
1
|
1
|
Sum=
Find the truth table that describes the following circuit:
Indication:
|
Inputs
|
Output
|
|
A
|
B
|
C
|
Carry
|
|
0
|
0
|
0
|
0
|
|
0
|
0
|
1
|
0
|
|
0
|
1
|
0
|
...
|
|
0
|
1
|
1
|
...
|
|
1
|
0
|
0
|
...
|
|
1
|
0
|
1
|
...
|
|
1
|
1
|
0
|
1
|
|
1
|
1
|
1
|
1
|
Boolean Equations
- Construct the truth table for the Boolean equation: '+A'B
|
Inputs
|
Output
|
|
A
|
B
|
C
|
|
0
|
0
|
0
|
|
0
|
1
|
1
|
|
1
|
0
|
...
|
|
1
|
1
|
...
|
- Draw a simple NOT, AND, OR circuit in sum of products (SOP) form that represents the equation above.
- The truth table for a Boolean expression is shown below. Write the Boolean expression on SOP form
|
Inputs
|
Output
|
|
A
|
B
|
C
|
Sum
|
|
0
|
0
|
0
|
0
|
|
0
|
0
|
1
|
1
|
|
0
|
1
|
0
|
1
|
|
0
|
1
|
1
|
0
|
|
1
|
0
|
0
|
1
|
|
1
|
0
|
1
|
0
|
|
1
|
1
|
0
|
0
|
|
1
|
1
|
1
|
1
|
Sum=
Find the truth table that describes the following circuit:
Indication:
|
Inputs
|
Output
|
|
A
|
B
|
C
|
Carry
|
|
0
|
0
|
0
|
0
|
|
0
|
0
|
1
|
0
|
|
0
|
1
|
0
|
...
|
|
0
|
1
|
1
|
...
|
|
1
|
0
|
0
|
...
|
|
1
|
0
|
1
|
...
|
|
1
|
1
|
0
|
1
|
|
1
|
1
|
1
|
1
|