Anention Hene se nsed frsom he stun st e helshe uses to solve the problem by wrt
ID: 3750665 • Letter: A
Question
Anention Hene se nsed frsom he stun st e helshe uses to solve the problem by wrting the simplification law or its name. Agreat weight will he given to the analysis but a sole answer without any proof for the solution worth nothing, Question.1 Reduce the following to minimum number of Boolean variables A. ABC+A C"AC B. (A'C(A+C(A +B+CD) to 3 literals to 4 literals Question.2 Simplify to minimum number of Boolean variables. B. (CD, + AB,)(A,D + BC.) Question.3 Get the compleent holowingoolean expressions B. E E(CD +AB)Explanation / Answer
Answer is as follows :
According to chegg guidelines we are allowed to solve only first two ques, so please repost third one.
Ques 1 :
A : ABC + A'C' + AC'
=> ABC + C'(A'+A)
=> ABC + C' (1)
=> ABC + C' (Three literals are there i..e A,B and C)
B : (A'+C') (A' + C) (A+ B+ C'D)
=> a'b'c'd + a'bc'd' + a'bc'd + a'bcd' + a'bcd (DNF form of given)
=> a'c'd + a'b ( Four literals a,b,c,d)
Ques 2 :
A : XZ + X'YZ
=> Z(X + X'Y)
=> Z (XY)
=> XYZ
B : (CD' + AB`) ( A'D + BC')
=> A'DCD' + A'DAB' + CD'BC' + AB'BC'
=> CD(DD`) + BD(AA`) + BD'(CC') + AC'(BB')
=> CD(0) + BD() + BD'(0) + AC'(0)
=> 0
if there is any query please ask in comments...