Question

YOU MUST SHOW YOUR WORK TO RECEIVE CREDIT!!! 1) Find the SOP form of X in all cases and simplify if possible using Boolean theorems. D- BT AL Doo Do was Da D D D

Answer 1

form and simplify the obtained We have to find the sop expressions съ - CD+AIB A+B A+B+C = Ã 3 x = CD+ A+B x = (co) (Ā(B) x =(E +) (AB) is x = AB (T+o) = ĀBT+ AZÕ nothing but a buffer so output is same as inpet. AD D BLAB) A+B Here output of second and gate is B(AB) = 0 Now inputs to NAND gate will be AB and o CS Scanned Soch outpeet of NAND gate is AB:0 = 1 CamScanner in x

© to Do OR gode output is C D Nous NAND gato output is, x = (C+D) E 2X = TEADE => x=(TE)(DE) By Boolean theoium A1B = AB AB=+B 1+x ) 1+71 +1=1 => x = (C+e)(3+) >> X = C5 CE 5E + E => x = c5+ € (1+c) + 7 € 3) * = CD + E +DE => x = cote(1+0) => x = co+E .: X=CO+E 3 @ (4+5). A+B) + BC = PDA t ě + BC - (FDAX) +BC = (x+öt) (8) + BC = XB+B ] +Ã B+BC = BC x+3++0) © xy + yž = (x + y) (7 +yx) = (R+)(x+x) (x+y)(8+7) = (x+4) (1) (1(8+7) = (X+Y)(+7) Scanned with CamScanner

1+2 = 1 1 : minimal pos form of xy + xy is (x+y)(+7) Ay), 8 + xỹ + 3 3 By boolean theorem = (Ā+y) B+ x+ BX CAB = A + B) • 6 8 6 7 8 + xỸ + 8X AB+C = (A+c) (B+C) - (a + 7+) + xỹ - (@+xv) (+7+8 + x) = (B+xv) (Ā++3+xV) - 6+x)(Ā + (1+x)+ =) = (B+xv) (A +7+7) a minimal Pos form of CAY) .B + xy + BX is (6+xv) (A+7+x) Scanned with CamScanner