Question

1. Simplify the equations using boolean algebra and show work: a. AB + (AC)’+ AB’C(AB+C) b....

1. Simplify the equations using boolean algebra and show work:

a. AB + (AC)’+ AB’C(AB+C)

b. W + W’X’ + W’XY +W’X’Y’Z

c. ABC’ + ABC + A’B’C + AB’C+ A’BC

Homework Answers

Answer #1
a. 
AB + (AC)’+ AB’C(AB+C)
= AB + (A' + C')+ AB’C(AB+C)
= AB + (A' + C')+ AB’CAB+AB’CC
= AB + (A' + C')+ 0 + AB’CC
= AB + (A' + C')+ AB’CC
= AB + (A' + C')+ AB’C
= A(B+B'C) + A' + C'


b. 
W + W’X’ + W’XY +W’X’Y’Z
= W + W’X’(1+Y’Z) + W’XY
= W + W’X’(1) + W’XY
= W + W’X’ + W’XY
= W + W’(X’ + XY)

c. 
ABC’ + ABC + A’B’C + AB’C+ A’BC
= AB(C’ + C) + A’B’C + AB’C+ A’BC
= AB(1) + A’B’C + AB’C+ A’BC
= AB + A’B’C + AB’C+ A’BC
= AB + A’(B’+B)C + AB’C
= AB + A’(1)C + AB’C
= AB + A’C + AB’C
= A(B+B'C) + A’C
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Using Boolean algebra, simplify the following Boolean functions. a. ABC + A’BC + (AB’C)’ b. AB’...
Using Boolean algebra, simplify the following Boolean functions. a. ABC + A’BC + (AB’C)’ b. AB’ + A’B + AB + A’B’ c. A’(A+B) + (B+A)(A+B’) Create a truth table, Karnaugh map and show the simplified the expression. a. A’B + B
Using Boolean algebra, derive the minimum SOP expression for the expression A’B’C+A’BC+ABC. please show the step...
Using Boolean algebra, derive the minimum SOP expression for the expression A’B’C+A’BC+ABC. please show the step by step derivation of the expression
Draw the logic circuit using NMOS and PMOS for the boolean expression     Y = A’B’C...
Draw the logic circuit using NMOS and PMOS for the boolean expression     Y = A’B’C + A’BC’ + AB’C’ + ABC
Build a truth table for the expression: a. AB’ + A’B + AB + A’B’ b....
Build a truth table for the expression: a. AB’ + A’B + AB + A’B’ b. A’B’C’ + ABC + C’B’A Create a truth table if needed. Create a Karnaugh map and simplify the expressions. b. AB’C’ + B’C c. ABC’D + A’CD + AC’D
1. Simplify the following functions using only Boolean algebra Laws. For each resulting function, sketch the...
1. Simplify the following functions using only Boolean algebra Laws. For each resulting function, sketch the logic circuit using logic gates. a. Simplify F = (A + C' +D')(B' + C' + D)(A + B' + C') (Hint, use theorem 8, Theorem 7 and distributive) b. Show that (Z + X)(Z' + Y')(Y' + X) = ZY' + Z'X c. Show that (X+Y)Z + X'Y'Z' = X'.Y' ((X+Y) HAVE 1 prime over the inside parenthesis. making it (x' +' y'))
1.Simplify the following functions using ONLY Boolean Algebra Laws and Theorems. For each resulting simplified function,...
1.Simplify the following functions using ONLY Boolean Algebra Laws and Theorems. For each resulting simplified function, sketch the logic circuit using logic gates. (30points) a.SimplifyF= (A+C+D)(B+C+D)(A+B+C) Hint:UseTheorem8 ,theorem 7 and distributive ̅̅b. Show that (Z + X)(Z +Y)(Y + X) = ? ? + ? ? ̅̅c. Show that (X +Y)Z + XYZ = ?.? (15 points for simplification and 15 points for Logisim diagrams) 2. Prove the below equation using Boolean Algebra Theorems and laws Write the name of...
Simplify the boolean equation: C(A'B' + AB'(C + BD)) then draw the logic schematic
Simplify the boolean equation: C(A'B' + AB'(C + BD)) then draw the logic schematic
f(a,b,c) = Xm(0,1,5) Use boolean algebra to simplify both of the above expressions to determine the...
f(a,b,c) = Xm(0,1,5) Use boolean algebra to simplify both of the above expressions to determine the minimal sum-of-products and the minimal product-of-sums representation for the above function.
Are the following two Boolean expressions/functions f and g equivalent? Show how you arrived at the...
Are the following two Boolean expressions/functions f and g equivalent? Show how you arrived at the answer: F = ABC + A’BC’ G = (AC’ + A’C)B
Reduce using Axioms and theorems of Boolean algebra. Show step-by-step: (A'B'C)+(A'BC')+(A'BC)+(AB'C)+(ABC)
Reduce using Axioms and theorems of Boolean algebra. Show step-by-step: (A'B'C)+(A'BC')+(A'BC)+(AB'C)+(ABC)