computer organazation , Boolean algebra1. Show the Boolean algebra reduction to minimal form for each....

computer organazation , Boolean algebra

1. Show the Boolean algebra reduction to minimal form for each. Show each step, and cite the rule number which allows it.

a . (AB)’ (A’ + B) (B’ + B)

b . A’(A+B) + (B + A)(A + B’)

Solutions

Expert Solution

a. 
(AB)’ (A’ + B) (B’ + B)
= (AB)’ (A’ + B) (1)
= (AB)’ (A’ + B)
= (A' + B') (A’ + B)
= A'A' + B'A' + A'B + B'B
= A' + B'A' + A'B + 0
= A' + B'A' + A'B
= A' (1 + B' + B)
= A' (1 + 1)
= A'


b.
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 + AA + BA + BB')
= A'B + (BA + A + BA + BB')
= A'B + (BA + A + BA + 0)
= A'B + (BA + A + BA)
= A'B + (BA + A)
= A'B + A(B + 1)
= A'B + A(1)
= A'B + A

venereology answered 1 year ago

Next > < Previous

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...

(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? $ | & ~

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.

Simplify the equation using Boolean algebra properties. F = xy + xy’z + x’yz

Use boolean algebra to prove that: (A^- BC^-) + (A^- BC) + (A* B^- *C) +...

Use boolean algebra to prove that: (A^- *B*C^-) + (A^- *B*C) + (A* B^- *C) + (A*B* C^-) + (A*B*C)= (A+B)*(B+C) A^- is same as "not A" please show steps to getting the left side to equal the right side, use boolean algebra properties such as distributive, absorption,etc

Abstract Algebra Let n ≥ 2. Show that Sn is generated by each of the following...

Abstract Algebra Let n ≥ 2. Show that Sn is generated by each of the following sets. (a) S1 = {(1, 2), (1, 2, 3), (1, 2, 3, 4), ..., (1, 2, 3,..., n)} (b) S2 = {(1, 2, 3, ..., n-1), (1, 2, 3, ..., n)}

Let ? be a ?−algebra in ? and ?:? ⟶[0,∞] a measure on ?. Show that...

Let ? be a ?−algebra in ? and ?:? ⟶[0,∞] a measure on ?. Show that ?(?∪?) = ?(?)+?(?)−?(?∩?) where ?,? ∈?.

How do you start an analysis and simplification using Boolean Algebra? Give a strategy for beginning...

How do you start an analysis and simplification using Boolean Algebra? Give a strategy for beginning such a problem.

discuss which is better: Boolean algebra or K-map? What are the limitations of Karnaugh Maps? Explain...

discuss which is better: Boolean algebra or K-map? What are the limitations of Karnaugh Maps? Explain with an example.

Digital Logic Design Lab Prove the following Boolean Algebra theorems and properties by constructing Logic Circuits...

Digital Logic Design Lab Prove the following Boolean Algebra theorems and properties by constructing Logic Circuits for each theorem/properties using our educational simulation software: Q1-a) The Distributive Property: a + ( b . c ) = ( a + b ) . ( a + c ) Q1-b) The Distributive Property: a . ( b + c ) = ( a . b ) + ( a . c )

Subjects