Question

In: Computer Science

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

Solutions

Expert Solution

a.A+AB = A(1+B)

=A.1                (Since by identity law 1+B=1)

=A                   (By A * 1 = A )

b.AB+AB' =A(B+B’)

=A.1                   (By complement law, B+B’=1)

=A                      (By A * 1 = A )

c.A'BC+AC =C(A’B+A)

=C(A + A')(A + B) (By AND Distributive Law ,A + (B.C)=(A + B).(A + C))
=C(A+B)                                        (By complement law, A+A’=1)

d.A'B+ABC'+ABC =A’B+AB(C+C’)

=A’B+AB                     (By complement law, C+C’=1)

=B(A+A’)

=B                              (By complement law, A+A’=1)


Related Solutions

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
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’)
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.
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
Assume B is a Boolean Algebra. Prove the following statement using only the axioms for a...
Assume B is a Boolean Algebra. Prove the following statement using only the axioms for a Boolean Algebra properties of a Boolean Algebra. Uniqueness of 0: There is only one element of B that is an identity for + please include all the steps.
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
A triangle ABC has sides AB=50 and AC=10. D is mid-point of AB and E is...
A triangle ABC has sides AB=50 and AC=10. D is mid-point of AB and E is mid-point of AC. Angle bisector AG from vertex A meets side BC at G and divides it in 5:1 ratio. So BG=5 times GC. AG cuts ED at F. Find the ratio of the areas of the trapeziods FDBG to FGCE.
x is 5, what is the result of the following Boolean expressions: 1. x != 0  ...
x is 5, what is the result of the following Boolean expressions: 1. x != 0   2. x > 0   3. x != 0 4. x > 0 5. (x >= 0) || (x < 0) 6. (x != 1) == !(x == 1) 7. (true) && (3 > 4) True or False? Please explain how you got your answers. I've been struggling with Boolean expressions so I'd like a little bit more of an explanation as to why each...
(TCO 2) Which of the following operations is not an operation of Boolean algebra? $ |...
(TCO 2) Which of the following operations is not an operation of Boolean algebra? $ | & ~
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT