Question

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

Homework Answers

Answer #1
a. ABC + A’BC + (AB’C)’
  = (A+A')BC + (AB’C)’
  = (1)BC + (AB’C)’
  = BC + (AB’C)’
  = BC + (A'+B+C')
  = B(C+1) + A'+C'
  = B(1) + A'+C'
  = B + A' + C'

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

c. A’(A+B) + (B+A)(A+B’)
  = A’A+A'B + (B+A)(A+B’)
  = 0+A'B + (B+A)(A+B’)
  = A'B + (B+A)(A+B’)
  = A'B + (BA+BB'+AA+AB’)
  = A'B + (BA+0+AA+AB’)
  = A'B + BA+AA+AB’
  = A'B + BA+A+AB’
  = A'B + BA + A(1+B’)
  = A'B + BA + A(1)
  = A'B + BA + A
  = A'B + (B+1)A
  = A'B + (1)A
  = A'B + A

a. A’B + B
A B A’B + B
F F F
F T T
T F F
T T T

So, From the truth table we can say that A’B + B = B

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
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 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...
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
Find a circuit of AND and OR gates to realize f (a, b, c, d) =...
Find a circuit of AND and OR gates to realize f (a, b, c, d) = Ʃ m(1, 5, 6, 10, 13, 14) a- Build the truth table b- Find the Boolean expression c- Draw the circuit d- simplify f by using a Karnaugh map e- Build the simplified truth table f- Re-draw the simplify circuit
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
Given the function f = x(y + w'z) + wxz. - Show a truth table for...
Given the function f = x(y + w'z) + wxz. - Show a truth table for the functions. - Draw a block diagram of a circuit. - Simplify the circuit using Boolean Algebra or K-Map. - Re-draw the simplified circuit diagram next to the original circuit. I NEED HELP WITH THIS ONE. THE IMPORTANT PART IS TRUTH TABLE. IF YOU DON'T KNOW OR DON'T WANT TO DRAW A BLOCK DIAGRAM, IT'S FINE. I NEED TRUTH TABLES FOR THE FUNCTION AND...
Use the properties and theorems of Boolean algebra to reduce the following expressions to AND-OR expressions...
Use the properties and theorems of Boolean algebra to reduce the following expressions to AND-OR expressions without parentheses. The expressions may not be unique. Construct the truth table, which will be unique, by inspection of your final expression. g) (a ⊕ b) ⊕ c i ) (a + b)(a′ + c)(b′ + c′)
Using K-map to simplify the following Boolean function: F(A,B,C,D) = m(1,3,5,6,7,9,11,12,13,15)
Using K-map to simplify the following Boolean function: F(A,B,C,D) = m(1,3,5,6,7,9,11,12,13,15)
Use Boolean algebra to simplify the following expression to obtain the minimum cost implementation: ( !x...
Use Boolean algebra to simplify the following expression to obtain the minimum cost implementation: ( !x * !y * !w) + ( !x * !y * z) + ( !x * z * !w) + ( y * !z * w) + ( x * !y * !z)
The simplification of the Boolean expression (ABC)+(ABC) (CR 8marks) ( The function is (A'BC') '+(AB' C)...
The simplification of the Boolean expression (ABC)+(ABC) (CR 8marks) ( The function is (A'BC') '+(AB' C) '
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT