Indian Institue of Technology Roorkee Department of Electrical Engineering
Tutorial 3 : Boolean Algebra and Boolean Function Simplification Autumn 2016
1) Verify the following Boolean expressions using truth table.
(a) A + B.C = (A + B).(A + C) 0 0 0 0 (b) (A.B.C) = A + B + C 0 0 (c) A.B + A .C = (A + C).(A + B) 2) Prove the following Boolean expressions using Postulates and Theorems. 0 (a) A + A .B = A + B 0 (b) A.(A + B) = A.B 0 0 0 0 0 (c) A .B + A.B = (A .B + A.B) 3) Realize the following using only two-input NAND gates and only with two-input NOR gates. (a) AND gate (b) OR gate (c) NOT gate (d) XOR gate (e) XNOR gate 4) Implement the following using AND, OR and INVERTER gates; also implement using only NAND gates and only NOR Gates. 0 (a) Y = (A + C).(A + B) 0 0 0 0 0 0 0 0 (b) Y = A .B .C + A .B .C + A.B .C + A.B .C 5) Simplify the following Boolean expression by eliminating the redundant literals. 0 0 (a) F (X, Y, Z) = X .Y .Z + X.Z + Y.Z 0 0 0 0 0 0 0 0 (b) F (X, Y, Z) = (X + Y )[X (Y + Z )] + X .Z + X .Y 0 0 0 0 0 0 (c) F (A, B, C, D) = A .C + A.B.D + B.C .D + A.B .D + A.B.C.D 6) Given a 4-variable digital system namely A, B, C and D, what are the expressions for (a) m2 , m8 , m11 , m12 , m15 (b) M3 , M5 , M9 , M11 , M14 7) A digital circuit demands four inputs and produces one output F. The output is 1 if and only if three or more of the inputs are 1. (a) Obtain the truth table for F (b) Find the canonical SOP form of F (c) Find the canonical POS form of F 8) Write thePcanonical sum and and canonical product for the following logic functions. (a) F = Q X,Y (1, 2) (b) F = PA,B (0, 1, 2) (c) F = Q A,B,C (1, 2, 4, 6) (d) F = X,Y,Z (0, 2, 3, 6, 7) 0 (e) F = X + Y.Z 0 (f) F = V + (W.X 0 ) 0 0 (g) F = X Y + Z + X.Y.Z 0 0 (h) F = X (Y + Z)