UNIVERSIDAD POLITECNICA SALESIANA

Ingeniería Mecatrónica, Electrónica Digital, Docente: Edy Ayala

Names:

Simplify the following Boolean expression into these expressions, then compare the logic circuit
using logic gates of the original expression with the final one:
0, 1, A, B, AB, A+B, A B , A + B , A B , A B
Each answer may be used as many times as necessary

1. A(A+ A )+B =

2. (A+B)( A +B) B =

   
3. A B  B 0 B  A B 

4. A  B 

Problems 5-8: Write the Boolean expression for the output Q as a function of the inputs.

5. Q =

6. Q =

7. Q =

8. Q =
9. Q =

10. Q=

A B Q
0 0 _____
0 1 _____
1 0 _____
1 1 _____

11. Show how to make a 2-input NAND out of 2-input NORs.

12. Show how to make a 2-input NAND out of a 3-input NAND.

13. Show how to make a 4-input NAND out of any combination of any 2-input gates.

Problems 14-16 are based on the following truth table:

A B Q
0 0 1
0 1 0
1 0 1
1 1 1

14. Write a Boolean expression for Q as a function of A and B.

15. Design a circuit that implements the truth table.

16. Using only NORs, design a circuit that implements the truth table.