Information and Engineering Technology Faculty

Dr. Tallal Elshabrawy & Dr. Wassim Alexan

ELCT201 Digital Logic Design – spring 2022 Sheet 1 Solution Boolean algebra and Logic Gates

Problem I: Convert the following decimal numbers to binary 8 bits

a) 2710 = 000110112
b) 4310 = 001010112
c) 6510 = 010000012
d) 3710 = 001001012

Problem II: Convert the following 2’s complement 8-bit binary numbers to decimal

a) 111111102 => 000102 = -210

b) 111101102 => 00010102 = -1010
c) 001010012 = +4110
d) 100110012=> 011001112 = -10310

Problem III: Simplify the following Boolean expressions to a minimum number of literals

a) A’BC + ABC’ + ABC + A’BC’ = AB (C+C’) + A’B (C+C’) = AB+A’B = B (A+A’) = B

b) XZ + X’Y + YZ = XZ + X’Y + YZ (X+X’) = XZ + X’Y + XYZ + X’YZ = XZ (1+Y) +X’Y (1+Z) = XZ+X’Y

c) (X’Y’ + Z’)’ +Z + XY + WZ = (X’Y’)’.Z + Z + XY + WZ = (X + Y) Z + Z + XY +WZ = Z ((X+Y) + 1 +W) +XY

= Z + XY

d) A’B (D’ + C’D) + B (A + A’CD) = A’B [(D’+C’) (D’+D)] + B [(A+A’) (A+CD)] = A’BD’ +A’BC’ +AB + BCD
####+A+CD] = B [(A+A’) (A+𝑪𝑫
= B [A’D’ + A’C’ +A +CD] = B [A’ (D’+C’) +A +CD] = B [A’ 𝑪𝑫 ####) + CD] = B
####
[A+𝑪𝑫+CD] = B[A+1] = B

Problem IV: Find the complement of F = wx + yz; then show that FF’ = 0 and F + F’ = 1.

• F’ = (WX + YZ)’ = (WX)’. (YZ)’

• F.F’ = (WX + YZ). [(WX)’. (YZ)’] = (WX). [(WX)’. (YZ)’] + (YZ). [(WX)’. (YZ)’] = 0
• F+F’ = (WX + YZ) + [(WX)’. (YZ)’] = [WX + (WX)’][WX + (YZ)’] + YZ = WX + (YZ)’ + YZ = WX + 1 = 1

Problem V: Find the complement of the following expressions

a) F1 = XY’ + X’Y
F1’= (XY’+X’Y)’ = (X’+Y). (X+Y’) = X’Y’ + XY => XOR’ = XNOR
b) F2 = (a + c) (a + b’) (a’ + b + c’)
F2’= a’c’+a’b+ab’c
 Information and Engineering Technology Faculty
Dr. Tallal Elshabrawy & Dr. Wassim Alexan

ELCT201 Digital Logic Design – spring 2022 Sheet 1 Solution Boolean algebra and Logic Gates

Problem VI: List the truth table of the function:

1. F1 = XY + XY’ + Y’Z (Sum of Products)
2. F2 = (B + C).( A’ + C’) (Product Of Sums)

X Y Z F1 A B C F2
0 0 0 0 0 0 0 0
0 0 1 1 0 0 1 1
0 1 0 0 0 1 0 1
0 1 1 0 0 1 1 1
1 0 0 1 1 0 0 0
1 0 1 1 1 0 1 0
1 1 0 1 1 1 0 1
1 1 1 1 1 1 1 0

Problem VII: For the Boolean function

F = XY’Z + X’Y’Z + W’XY + WX’Y + WXY

(a) Obtain the truth table of F.

W X Y Z F
0 0 0 0 0
0 0 0 1 1
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
 Information and Engineering Technology Faculty
Dr. Tallal Elshabrawy & Dr. Wassim Alexan

ELCT201 Digital Logic Design – spring 2022 Sheet 1 Solution Boolean algebra and Logic Gates

(b) Draw the logic diagram, using the original Boolean expression.

5 Three-input AND Gates

1 Five-input OR Gate

(c) Use Boolean algebra to simplify the function to a minimum number of literals.

F = XY’Z + X’Y’Z + W’XY + WX’Y + WXY = Y’Z (X+X’) + W’XY + WY (X+X’) = Y’Z + Y (W’X + W) =

Y’Z + Y [(W’+W) (W+X)] = Y’Z + YW + YX

 Information and Engineering Technology Faculty
Dr. Tallal Elshabrawy & Dr. Wassim Alexan

ELCT201 Digital Logic Design – spring 2022 Sheet 1 Solution Boolean algebra and Logic Gates

(c) Obtain the truth table of the function from the simplified expression and show that it is the same
as the one in part (a).
W X Y Z F
0 0 0 0 0
0 0 0 1 1
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0 Same Truth Table
0 1 0 1 1
as in part a
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

(e) Draw the logic diagram from the simplified expression, and compare the total number of gates with
the diagram of part (b)

3 Two-Input AND Gates

1 Three-Input OR Gate
 Information and Engineering Technology Faculty
Dr. Tallal Elshabrawy & Dr. Wassim Alexan

ELCT201 Digital Logic Design – spring 2022 Sheet 1 Solution Boolean algebra and Logic Gates

Problem VIII: Write Boolean expressions describing the outputs of the circuits described by the logic
diagrams in Fig. 1.

Figure 1

• Y1 = a ⊕ (c + d + e) = [a.(c + d + e)’+a’.(c + d + e)]

• Y2 = b’. f. (c + d + e)