3. a) Simplify the expression (ab + a’b’)(cd + c’d’) + (ab)’
b). Prove that the expression x’y XOR xy’ = x XOR y is true.
c). Simplify the function f(x, y, z) = xyz’ + xy’z’ + x’y as much as possible and give the CPOS and CSOP of f
(ab + a’b’)(cd + c’d’) + (ab)’
(ab + a’b’)(cd + c’d’) + (a'+b')
[ab(cd + c’d’) + a’b’(cd + c’d’)] + (a'+b')
[(abcd + abc’d’) + (a’b’cd + a’b’c’d’)] + (a'+b')
abcd + abc’d’ + a’b’cd + a’b’c’d’ + a'+b'


The Simplified Expression is F = a’+b'+cd+c'd'
b) Given
x’y XOR xy’ = x XOR y
Take L.H.S
x’y XOR xy’
(x’y)'xy’+x’y(xy’)'
[(x’)'+y']xy’+x’y[x'+(y’)']
[x+y']xy’+x’y[x'+y]
[xxy’+xy’y']+[x'x’y+x’yy]
[xy’+xy']+[x'y+x'y]
[xy']+[x'y]
[xy']+[x'y]
x XOR y
= R.H.S
x’y XOR xy’ = x XOR y
c) f(x, y, z) = xyz’ + xy’z’ + x’y
= xz’(y + y') + x’y
= xz’(1) + x’y
= xz’ + x’y
The Simplified SOP is f(x, y, z) = xz’ + x’y


The Simplified POS is f(x, y, z) = (x’+z’)(x+y)
3. a) Simplify the expression (ab + a’b’)(cd + c’d’) + (ab)’ b). Prove that the...
Using Boolean Logic 2.9 Simplify: x + xy 2.10 (a) Simplify: xy + x’ 2.10 (b) Simplify: x’y’(1 x) 2.10 (c) Simplify: x + y + (x+y) 2.11(a) Simplify the expression, the AND operator is implicit: xyz + x’yz + xy’z + xyz’ + x’ 2.11(b) Simplify the expression, the AND operator is implicit: xyz + x’yz +y’ 2.12(a) Simplify the expression, by first forming the complements, secondly simplify the complemented expression, and third complementing the simplified expressions: (x +...
1) Implement each side with gates, that is a block diagram/schematic a+(b+c) = (a+b)+c a(b+c) = ab + ac 2) Make a truth table for each of the functions below and identify where each term comes from in the truth table a. F=X’Y+Y’Z’+XYZ b. G=XY+(X’+Z)(Y+Z’) c. H=WX+XY’+WX’Z+XYZ’+W’XY’ 3) For the expression F = A’B’C + ABC + ABC’ How many literals are there ___________ How many terms are there ___________ 4) F(a,b,c,d) = m(0,1,4,7,12) Find the canonical sum (which is...
Simplify the following boolean expressions. Step by step please I would like to really understand it. F(x, y, z) = xy + x’y’z’ + x’yz’ F(x, y, z) = x’yz + xy’z + xy’z + x’yz’ F(x, y, z) = xy’z’ + xz + x’y’z F(w, x, y, z) =x’z + w’xy’ + w(x’y + xy’) F(w, x, y, z) =w’x’y’x’ + wy’z’ + x’yz’ + w’xyz + xy’z
1) Draw the diagram of XOR gate using AND, OR and NOT gates only 2) Draw the diagram of this function (x,y) = (x’y + xy’ + x’y’) using NOT, AND gates only 3) Draw the diagram of this function (x,y,z,w) = (x’ + y’).(z + w) using 2 input NAND gates only Draw the diagram of this function (x,y,z) = xy’z using 2 input NAND gates only.
Find the complement of Y(a,b)=ab’+a’b, and prove that Y+Y'=1. Give a reason for each step.
1. (a) Prove by algebraic method that ¯a + ab + ac¯+ a ¯bc¯ = ¯a + ¯b + ¯c. (b) Find the CPOS of f(x, y, z) = (x + ¯y)y + ¯xz + x + y + ¯y(x + z).
Simplify the following Boolean expression as much as possible using Boolean algebra. (a) A ‘C ‘ + ABC + AC ‘ (b) (x ‘y ‘ + z) ‘ + z + xy + wz (c) A ‘B (D ‘ + C ‘D) + B(A + A ‘CD) (d) (A ‘ + C) (A ‘ + C ‘) (A + B + C ‘D) (e) ABC'D + A'BD + ABC
1. Simplify the following Boolean expression: (solution should be one term) XY+XY 2. Simplify the following Boolean expression: (solution should be one term) (X+Y)(X+Y)(X'+Z”) 3. Simplify the following Boolean expression ABC+ABC'+AB'C+AB'C' 4. Simplify the following Boolean expression AB +A'C +BC 5. Simplify the following Boolean expression. (A+B)(AB)
Simplify Y = AB’ + (A’ + B)C. a) AB’ + C b) AB + AC c) A’B + AC’ d) AB + A
Please simplify the following Boolean expression to its simplest form: F(x, y, z) = y'z + x'yz + xyz? Please simplify the following Boolean expression to its simplest form: F(x, y) = (x + y)(xy)’ + ((x + y)(xy)’)’?