Chapter 2: Boolean Algebra & Logic Gates

Solutions of Problems: []

Problem: 2-1
Demonstrate by means of truth tables the validity of the following identities:
(a) DeMorgan’s theorem for three variables: (x+y+z)’ = x’y’z’ and
(xyz)’=x’+y’+z’
(b) The distributive law: x+yz = (x+y)(x+z)

Solution:

(a)
x y z x+y+z (x+y+z)’ x’ y’ z’ x’y’z’
0 0 0 0 1 1 1 1 1
0 0 1 1 0 1 1 0 0
0 1 0 1 0 1 0 1 0
0 1 1 1 0 1 0 0 0
1 0 0 1 0 0 1 1 0
1 0 1 1 0 0 1 0 0
1 1 0 1 0 0 0 1 0
1 1 1 1 0 0 0 0 0

x y z xyz (xyz)’ x’ y’ z’ x’+y’+z’

0 0 0 0 1 1 1 1 1
0 0 1 0 1 1 1 0 1
0 1 0 0 1 1 0 1 1
0 1 1 0 1 1 0 0 1
1 0 0 0 1 0 1 1 1
1 0 1 0 1 0 1 0 1
1 1 0 0 1 0 0 1 1
1 1 1 1 0 0 0 0 0

(b)

x y z yz x+yz x+y x+z (x+y)(x+z)

0 0 0 0 0 0 0 0
0 0 1 0 0 0 1 0
0 1 0 0 0 1 0 0
0 1 1 1 1 1 1 1
1 0 0 0 1 1 1 1
1 0 1 0 1 1 1 1
1 1 0 0 1 1 1 1
1 1 1 1 1 1 1 1

Page 1 of 7
Problem: 2-4
Reduce the following Boolean expressions to the indicated number of literals:
(a) A’C’ + ABC + AC’ to three literals
(b) (x’y’+z)’ + z + xy + wz to three literals
(c) A’B(D’+C’D) + B(A+A’CD) to one literal
(d) (A’+C)(A’+C’)(A+B+C’D) to four literals

Solution:

(a) A’C’ + ABC + AC’ = A’C’ + AC’ + ABC

= C’(A’+ A) + ABC
= C’∙1 + ABC
= C’ + ABC
= (C’+ AB)(C’+C) [distributive]
= AB + C’

(b) (x’y’+z)’ + z + xy + wz = (x’y’+z)’ + z + wz + xy

= (x’y’+z)’ + z(1+ w) + xy
= (x’y’+z)’ + z + xy
= (x + y)z’ + z + xy [DeMorgan]
= (z + (x + y)) ∙ (z + z’) + xy [distributive]
= (z + (x + y)) ∙ 1 + xy
= x + y + z + xy
= x+y+z [absorption]

(c) A’B(D’ + C’D) + B(A+A’CD) = A’BD’ + A’BC’D + AB+ A’BCD

= A’BD(C+C’)+ A’BD’+ AB
= A’BD+ A’BD’+ AB
= A’B(D+D’)+ AB
= A’B+ AB
= B(A’+ A)
= B

(d) (A’+C)(A’+C’)(A+B+C’D) = (A’+C)(A’+C’)(A+B+C’D)

= (A’ + CC’)(A + B + C’D)
= A’(A + B + C’D)
= A’A + A’B + A’C’D
= A’B + A’C’D
= A’(B + C’D)

Page 2 of 7
Problem 2-5:
Find the complement of F  x  yz ; then show that FF   0 and F  F   1

Solution:
F  x  yz
x  y  z
The dual of F is:

Complement each literal: x   y  z   F

   

FF   x  yz   x   y  z  xx  xyz    y  z  xyz   y  z  xyyz  xyzz  0

F  F   x  yz   x   y   z   x  yz  x  x  yz  y   z   1  yz   x  yz  y   z 

 1  x  yz  y   z   1

Problem 2-8:

List the truth table of the function:

F  xy  xy  yz

Solution:
The truth table is:

x y Z F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1

Page 3 of 7
Problem 2-10:
Draw the logical diagrams for the following Boolean expressions:
(a) Y=A’B’+B(A+C).

(b)Y=BC+AC’.

(c) Y=A+CD.

(d)Y=(A+B)(C’+D).

Page 4 of 7
Problem 2-15
Given the Boolean function F=xy’z+x’y’z+w’xy+wx’y+wxy.
(a) Obtain the truth table of the function.
(b)Draw the logical diagram using the original Boolean expression.
(c) Simplify the function to a minimum number of laterals using Boolean
algebra.
(d)Obtain the truth table of the function using the simplified expression.
(e) Draw the logical diagram from the simplified expression and compare the
total number of gates with the diagram of part (b).
Solutions:
(a) The truth table of the function:

X Y z w F F(simplified
0 0 0 0 0 0
0 0 0 1 0 0
0 0 1 0 1 1
0 0 1 1 1 1
0 1 0 0 0 0
0 1 0 1 1 1
0 1 1 0 0 0
0 1 1 1 1 1
1 0 0 0 0 0
1 0 0 1 0 0
1 0 1 0 1 1
1 0 1 1 1 1
1 1 0 0 1 1
1 1 0 1 1 1
1 1 1 0 1 1
1 1 1 1 1 1

(b) The logic diagram:

Page 5 of 7
(c) A simplified function:
F =XY’Z+XÝ’Z+W’XY+WXÝ+XYW
=Y’Z (X+X’) +XY (W+W’) +WXÝ= Y’Z+ XY+ WXÝ

(d) See the truth table

(e) Logic circuit for simplified function

For 1st design there is 5 And gates with 3 inputs and 1 OR Gate with 5 inputs.
For 2nd design there is 2 And gates with 2 inputs and 1 OR Gate with 3 inputs and 1
And gates with 3 inputs.

Problem 18:
Convert the following to the other canonical form:
(a) F (x, y , z) = ∑ (1,3,7) (b) F(A,B,C,D)= ∏ (0,1,2,3,4,6,12)

Solution:
(a) F (x, y, z) = ∑ (1,3,7) = ∏ (0,2,4,5,6)
F (x, y, z) = ( x  y  z)  ( x  y  z)  ( x  y  z)  ( x  y  z)  ( x  y  z)

(b) F (A,B,C,D) = ∏ (0,1,2,3,4,6,12) = ∑ (5,7,8,9,10,11,13,14,15)

F(A,B,C,D)=
( ABCD)  ( ABCD)  ( ABC D)  ( ABCD)  ( ABC D)  ( ABCD)  ( ABCD)  ( ABC D)  ( ABCD)

Page 6 of 7
Problem 21:
Show that the dual of the exclusive-OR is equal to its complement.

XOR
X  Y = XY’ + X’Y
= (X +Y’)  (X’+Y)
= XX’ +XY +X’Y’ +YY’
= XY + X’Y’
= (X  Y)’ = XNOR

Problem 23:
Show that a positive logic NAND gate is a negative logic NOR gate and vice versa.

Solution:

Positive Logic NAND L=0 H=1

x y Z
0 0 1
0 1 1
1 0 1
1 1 0

x y Z
L L H
L H H
H L H
H H L

To use the Negative Logic let L = 1, H = 0

x y Z
1 1 0
1 0 0
0 1 0
0 0 1

This Truth Table is that of the NOR gate using negative logic.

Page 7 of 7