Question

In: Computer Science

Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean...

Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean algebra (show your work and write the property you are applying). State if they cannot be simplified.

A. A’B + AB

B. XY + X(WZ + WZ’)

C. X’Y’(X’+Y)(Y’+Y)

D. ABC + A’B + A’BC’

E. (A+B)(AC+AC’)+AB+B

Draw the circuit logic diagrams for both the original and simplified expressions.

Solutions

Expert Solution

A.

A'B+AB

=(A'+A)B {Distributive law}

=1*B {Anything ORed with its own complement equals 1}

=B {Anything ANDed with a 1 is equal to itself}

circuit diagram of original expression:

Circuit diagram of simplified expression is just B .

B. XY + X(WZ + WZ')

= XY + X*W*(Z+Z') {Distributive law}

= XY + X*W*1 {Anything ORed with its own complement equals 1}

=XY + XW

= X*(Y+W)

Circuit diagram of original expression:

Circuit diagram of simplified expression:

3. X'Y'(X'+Y)(Y'+Y)

=X'Y'(X'+Y)(1)        {Y'+Y = 1}

=X'Y'X' + X'Y'Y

=X'Y' + X'Y'Y

=X'Y' {Y'Y = 0, X'*0 = 0}

Circuit diagram of original expression:

Circuit diagram of simplified expression:

D. ABC + A'B + A'BC'

= ABC + A'BC' + A'B {ASSOCIATIVE LAW}

= B(AC + A'C') + A'B {DISTRIBUTIVE LAW}

= B(AC + (AC)') + A'B {(AC)' = A'C'}

= B + A'B {A+A'=1. HERE (AC)' IS COMPLEMENT OF AC}

=(1 + A')B {DISTRIBUTIVE LAW}

= B          {Anything ORed with a 1 is equal to 1. A' + 1 = 1}

Circuit diagram of original expression:

Circuit diagram of simplified expression is just B.

E. (A+B)(AC+AC')+AB+B

= (A+B)(A(C+C'))+AB+B {DISTRIBUTIVE LAW}

= (A+B)A + (A+1)B       {C+C' = 1. DISTRIBUTIVE LAW}

=AA + AB + B                 {A+1 = 1, DISTRIBUTIVE LAW}

= A + AB + B                 {AA=A}

= A + B                 {A+AB = A(1+B) = A}

Circuit diagram of original expression:

Circuit diagram of simplified expression:


Related Solutions

Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean...
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean algebra (show your work and write the property you are applying). State if they cannot be simplified A. X’Y + XY B. (X + Y)(X + Y’) C. (A’ + B’) (A + B)’ D. ABC + A’B + A’BC’ E. XY + X(WZ + WZ’)
1. Use Boolean algebra to simplify the following Boolean expressions to expressions containing a minimum number...
1. Use Boolean algebra to simplify the following Boolean expressions to expressions containing a minimum number of literals: (a) A’C’ + A’BC + B’C (b) (A + B + C)’(ABC)’ (c) ABC’ + AC (d) A’B’D + A’C’D + BD (e) (A’ + B)’(A’ + C’)’(AB’C)’ (f) (AE + A’B’)(C’D’ + CD) + (AC)’ 2. Obtain the truth table of the function F = (AB + C)(B + AC), express the function F in sum-of-minterms and product-of-maxterms forms, and express...
3. Simplify the following expressions using the properties of boolean algebra : 3A)    S(A,B,C) = A'B'C...
3. Simplify the following expressions using the properties of boolean algebra : 3A)    S(A,B,C) = A'B'C + A'BC + AB'C + ABC 3B) F(A,B,C) = A'B'C' + A'B'C + AB'C' + AB'C + ABC' + ABC
1.) Simplify the following Boolean Expression to a minimum number of literals. (a'b' + c)(a +...
1.) Simplify the following Boolean Expression to a minimum number of literals. (a'b' + c)(a + b + c') a.)ab + a'b'c' + ac b.)ac + abc + bc c.)ac + a'b'c' + bc d.)a'c + abc + b'c e.)None of the above 2.) Reduce to two literals. wxy'z + w'xz + wxyz a.) xz b.) x'z c.) xz' d.) yz e.) None of the above
Simplify the equation using Boolean algebra properties. F = xy + xy’z + x’yz
Simplify the equation using Boolean algebra properties. F = xy + xy’z + x’yz
1. Simplify the following expressions using Boolean algebra. a.A+AB b.AB+AB' c.A'BC+AC d.A'B+ABC'+ABC
1. Simplify the following expressions using Boolean algebra. a.A+AB b.AB+AB' c.A'BC+AC d.A'B+ABC'+ABC
How do you simplify the following boolean expressions: Y3= X3' X2 X1 X0' + X3' X2...
How do you simplify the following boolean expressions: Y3= X3' X2 X1 X0' + X3' X2 X1 X0 + X3 X2 X1 X0' +X3X2X1X0 Y2 = X3' X2 X1' X0' + X3' X2 X1' X0 + X3 X2 X1' X0' + X3 X2 X1' X0 +  X3 X2' X1' X0' + X3 X2' X1' X0 + X3 X2' X1 X0' + X3 X2' X1 X0 Y1 = X3' X2' X1 X0' + X3' X2' X1 X0 + X3' X2 X1 X0'...
1.) Simplify the following expression to a minimum number of literals. This problem must be solved...
1.) Simplify the following expression to a minimum number of literals. This problem must be solved through Algebraic Manipulation. All work must be shown on the submitted work. Things to remember. If you can't see anything to work with from the beginning, expand. Formula Sheet has been provided. a.) Simplify (you MUST submit your work to get credit for this problem) F(a, b, c) = bc + a’b + ab’ + ac’ 2.) Express the given function in terms of...
Simplify fully the following expressions by combining the like terms. 9(2x − t) + 23xt + x(−4 + 5t)
Simplify fully the following expressions by combining the like terms. 9(2x − t) + 23xt + x(−4 + 5t)
Lab 7. Boolean Expressions a) Write a program that evaluates the following expressions. Assign reasonable values...
Lab 7. Boolean Expressions a) Write a program that evaluates the following expressions. Assign reasonable values to the variables. Print the results. a<b≥c , √a−7 b2 ≠c , d∨e∧f , a<b∨¬d ∧means and, ∨means inclusive or, ¬ means not. b) Write a program that asks a user whether he or she wants to become a Java programmer and determines if the user typed “yes” (Print true if yes and false otherwise.) Don't use the if statement here
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT