Given: F(A,B,C) = A’B + AB’
and G(A,B,C) = A’BC’ + AB’C’ + A’BC + AB’C
Prove that F(A,B,C) = G(A,B,C)
F(A,B,C) = A’B + AB’ Applying identity law = A’B + AB’(1) Applying inverse law = A’B + AB’(C’+C) Applying distributive law = A’B + AB’C’ + AB’C Applying identity law = A’B(1) + AB’C’ + AB’C Applying inverse law = A’B(C’+C) + AB’C’ + AB’C Applying distributive law = A’BC’ + AB’C’ + A’BC + AB’C = G(A,B,C)
Simplify the Boolean expressions: a) AB + AB’C’ + A’BC b) (A’ + C)(A’ + B) (A + B’ + C’D)
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
Find the complement of Y(a,b)=ab’+a’b, and prove that Y+Y'=1. Give a reason for each step.
Simplify Y = AB’ + (A’ + B)C. a) AB’ + C b) AB + AC c) A’B + AC’ d) AB + A
Factor the expression A’B’ + (CD’ + E) to obtain a product of sums Given: F(a, b, c, d) = (a + b + d)(a’ + c)(a’ + b’ + c’)(a + b + c’ + d’) Express F as a minterm expansion (Use m-notation): F = ∑ Express F as a maxterm expansion (Use M-notation): F = ∏ Express F’ as a minterm expansion (Use m-notation): F’ = ∑ Express F’ as a maxterm expansion (Use M-notation): F’ =...
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...
Which of the following describes an Exclusive OR gate? A. (AB)’ + AB’ B. (AB)’ + AB C. (A’ + B’)(A + B) D. A’B + AB’
Given the schema S= < { A,B,C,D,E,G,H }, F>, where F represents the following dependencies: AB→D A→D E→B E→C G→C E→A EB→GH H → A Find a minimal cover for this schema. Find a key for this schema. Find a third normal form decomposition for this schema. Find a BCN form decomposition for this schema.
DeMorgan’s theorem states that _________ a) (AB)’ = A’ + B’ b) (A + B)’ = A’ * B c) A’ + B’ = A’B’ d) (AB)’ = A’ + B
answer C1 and C2
then Prove Proposition 3.11 (Segment Subtraction): If A * B * C, D * E * F, AB s. DE, and em C2. Prove Proposition 3.12: Given AC DE. Then for any point B between A and C there is Group C (choose two) Problem Ci Propositi a unique point E between D and F such that AB Problem C3. Prove the first case of Propositi exists a line through P perpendicular to e. DE. on...