# 18 construct logic circuit diagram for a half adder

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: + AB • C (c) A + B (g) (A + B) • (A + C) • (B (d) A + B + C (h) A • C + A •C 5. State and prove the two basic De Morgan's theorems. 6. Prove the following rules by the method of perfect induction: 7. Simplify the following Boolean expressions and draw logic circuit diagrams for your simplified expressions using AND, OR and NOT gates: 13. &quot;AND, OR and NOT gates are logically complete&quot;. Discuss. 14. Why are NAND and NOR gates called universal122 I Foundations of Computing 15. Show the implementation of the logical operations AND, OR and NOT with only NAND gates and with only NOR gates. 16. Construct logic circuit diagrams for the Boolean expressions of Question 12 using only NAND gates. 17. Construct logic circuit diagrams for the Boolean expressions of Question 12 using only NOR gates. 18. Construct logic circuit diagram for a half-adder using only NAND gates. 19. Construct logic citcuit diagram for a half-adder using only NOR gates. 20. Why are combinational circuits more frequently constructed with NAND or NOR gates than with AND, OR and NOT gates? 22. Construct a logic circuit diagram for the exclusive-OR function using only NOR gates. 23. Construct a logic circuit diagram for the equivalence function using only NAND gates. 24. A logic circuit has three inputs, A, B and C. It generates an output of 1 only when A = 0, B = 1, C = 0 or when A = 1, B = 1, C = 0. Design a combinational circuit for this system. 25. A logic circuit has three inputs, A, B and C. It generates an output of 1 only under the following conditions: A = 0, B = 0, C = 0 A = 0,B=l,C=l A=l,B = 0,C=l A=1,B=1,C=1 Design a combinational circuit for this system. 26. Design a gating network which will have outputs 0 only when A = 0, B = 0, C = 0; A = 1, B = 0, C = 0;A = 1, B = 1, C = 0. The outputs are to be 1 for all other cases. 27. A three bit message is to be transmitted with an odd parity. An odd parity generator generates a parity bit (say P) so as to make the total number of Is odd (including P). That is, P = 1 only w...
View Full Document

## This document was uploaded on 04/07/2014.

Ask a homework question - tutors are online