Question

3. () Use only NAND gates to implement the Boolean function F AC +BC. (ii) Use only NOR gates to implement the Boolean function F AB+BC. Write the truth tables and draw the logic circuits for the following Boolean functions: (i) F A +BC'. (ii) F AB +C'+D. 4.

Answer 1

Please comment below, If you find any difficulty in understanding

Please Upvote, If you are impressed with my answer

3.

i) Implementing F = AC ' + BC using only NAND Gates
F = AC� + BC F = ((AC�)� middot (BC)�)� By Demorgan�s Law F = ((AC�)�)� + ((BC)�)� F = AC� + BC \r\n Using only NOR gates F = AB + BC F = ((AB + BC)�)� F = AB + BC \r\n F = A + BC� \r\n F = AB + C� + D
ii) Implementing F = AB + BC using only NOR Gates

4. Truth tables and Logic circuits for

i) F = A + BC '

ii) F = AB + C ' + D