Question

1. Use K-maps to reduce each of the following to a minimized SOP form: (a) A + BC + CD (b) ABCD + ABCD + ABCD + ABCD (c) ABCD + CD) + ABCD + CD) + ABCD (d) (AB + ABXCD + CD) (e) AB + AB + CD + CD 2. Use K-maps to find the minimum SOP expression for the logic function shown in the table to the right. Implement the circuit using NAND gates only. Inputs Output ABCD 00000 00011 00101 001 01000 0101 01101 01111 3. Repeat problem 2 but assume the last 6 input combinations are invalid. 4. Use K-maps to find the minimum POS form for each of the following: (a) (A + B + CA + B + CXA+B+C) (b) (X + Y(X + ZX(X + Y + ZX(X + Y + 2) (c) AB + CA + CXA + B + A + B + ) 10010 10101 10110 11001 11011 1 1 1 0 0 5. Consider the following function: F(A,B,C,D) = 2(0,1,5,7, 10, 11, 15) with d(A,B,C,D) = (2,3, 13) Answer the following: A) Find the minimized SOP and minimized POS without using the don't cares in your simplification. B) Find the minimized SOP and the minimized POS using the don't cares in your simplification C) Show by means of a truth table that the expressions in part (A) are equivalent, while the expressions in part (B) are not.

Answer 1

2a At BetCD e Alberto eda o CD + B CD & B ED+BED +8c5 + B C D & Cath B ł + A BA ĀB, CAD FADEADIAD) & AB HAB). A S (8, 9, 10, 11, 12, 13, 14, 15,4,5,6,7,10) CORPORATION OF INDIA yo At CD&B E 5 апет АСЕD+ +0 4+AQ с Б Ecol, 15, 19) ool TOTO a A i E HABC ne 9221020 AS ONS

OCEDED) +ABCED+TD) +A8CD. ABESTABED & AB EDTABEDZABED MOBE+AED. = Ā B CD + Ã C CORAB CD & Aber 23 (3, 2, M, 10) e 20 + A +ET +co 660,2,1,3,6,9,10,11,4,12,14).6)

Y=B +D YEABED&A E54AB DAÃ BC theo implement when things a Not rate.

AR усаар 1 в със SURANCE