1. Draw a combinatorial circuit that implements this truth table. (You need not simplify.)

   A	B	C	D	Output
   0	0	0	0	false
   0	0	0	1	false
   0	0	1	0	true
   0	0	1	1	true
   0	1	0	0	false
   0	1	0	1	false
   0	1	1	0	false
   0	1	1	1	false
   1	0	0	0	false
   1	0	0	1	false
   1	0	1	0	false
   1	0	1	1	true
   1	1	0	0	true
   1	1	0	1	false
   1	1	1	0	false
   1	1	1	1	true

2. Write a Boolean expression in Sum-of-Products form that describes the truth table above.
3. Generate a truth table and a Boolean expression for this circuit:

4. Generate a truth table and a Boolean expression for this circuit:

5. Draw the circuit corresponding to this Boolean expression: A(B+C)⨁D
6. Draw the circuit corresponding to this Boolean expression:
7. Draw the circuit and the truth table corresponding to this Boolean expression: A̅B̅
8. Draw the circuit and the truth table corresponding to this Boolean expression: AB
9. Draw the circuit and the truth table corresponding to this Boolean expression:
10. Generate a truth table and a Boolean expression for this circuit:

11. How many 3-input truth tables are there?
12. How many 4-input truth tables are there?
13. In general, how many n-input truth tables are there?

Updated Wednesday, 12 January 2022, 4:03 PM