CIS 351

Combinatorial Circuits

Fall 2021

  1. How many 3-input truth tables are there?
  2. How many 4-input truth tables are there?
  3. In general, how many n-input truth tables are there?
  4. Draw a combinatorial circuit that implements this truth table. (You need not simplify.)
    ABCDOutput
    0000false
    0001false
    0010true
    0011true
    0100false
    0101false
    0110false
    0111false
    1000false
    1001false
    1010false
    1011true
    1100true
    1101false
    1110false
    1111true
  5. Write a Boolean expression in Sum-of-Products form that describes the truth table above.
  6. Generate a truth table and a Boolean expression for this circuit:
  7. Generate a truth table and a Boolean expression for this circuit:
  8. Draw the circuit corresponding to this Boolean expression: A(B+C)⨁D
  9. Draw the circuit corresponding to this Boolean expression:
  10. Draw the circuit and the truth table corresponding to this Boolean expression:
  11. Draw the circuit and the truth table corresponding to this Boolean expression: AB
  12. Draw the circuit and the truth table corresponding to this Boolean expression:
  13. Generate a truth table and a Boolean expression for this circuit:

Updated Wednesday, 22 September 2021, 3:25 PM

W3c Validation