The National Higher School of Artificial Intelligence 2023/2024

Digital Systems First Year

Assignment 02
Exercise 01
Simplify the following Boolean expression using only Boolean algebra and axioms

a) 𝐹 = 𝑋𝑍 + 𝑌(𝑋̅𝑍 + 𝑌̅ )

X Z + Y( X’ Z + Y’) = XZ + YX’Z + YY’ = XZ + X’YZ =

(XZ+X’)(XZ+Y)(XZ+Z) = (X+Y)Z

b) 𝐹 = 𝑊𝑋𝑌𝑍 + 𝑊𝑋𝑌𝑍̅ + 𝑊𝑋𝑌̅𝑍 + 𝑊𝑋𝑌̅𝑍̅ + 𝑊

̅ 𝑋𝑌𝑍̅ + 𝑊𝑋̅𝑌𝑍̅ + 𝑊
̅ 𝑋̅𝑌𝑍̅ + 𝑊
̅ 𝑋𝑌̅𝑍
F(W,X,Y,Z) = WXYZ + WXYZ’ + WXY’Z + WXY’Z’ + W’XYZ’ + WX’YZ’ +
W’X’YZ’ + W’XY’Z
F = WXYZ + WXYZ’+ WXYZ’+ WXY’Z + WXY’Z + WXY’Z’ + W’XYZ’ + WX’YZ’
+ W’X’YZ’ + W’XY’Z
F = WX(YZ+YZ’+Y’Z+Y’Z’)+ (WX+W’X+WX’+W’X’)YZ’+ (W+W’) XY’Z
F = WX (Y(Z+Z’)+Y’(Z+Z’)) + (W(X+X’)+W’(X+X’))YZ’ + (W+W’)XY’Z
F = WX (Y+Y’) + (W+W’)YZ’ + XY’Z
F = WX + YZ’+ XY’Z

c) 𝐹 = 𝑊𝑋𝑍̅ + 𝑊𝑋̅𝑍̅ + 𝑊𝑋̅𝑍 + 𝑋̅𝑌𝑍 + 𝑋̅𝑌𝑍̅ + 𝑋𝑌𝑌̅ 𝑍 + 𝑊𝑌̅𝑍̅ + 𝑊𝑌𝑍̅ + 𝑊

̅ 𝑌̅𝑍̅ + 𝑊𝑋𝑍 + 𝑊
̅ 𝑌𝑍̅ +
̅
𝑊𝑋𝑋𝑌𝑍

F = WXZ’ + WX’Z’ + WX’Z + X’YZ + X’Y Z’+ XYY’Z + WY’Z’ + WYZ’ +

W’Y’Z’+ WXZ + W’YZ’ + WXX’YZ
Simplify:
First rearrange terms and eliminate terms that are 0.
F = WXZ + WX’Z + WY’Z’ + WXZ’ + WX’Z’ + X’Y Z’ + XYY’Z + X’YZ +
WYZ’ + W’YZ’ + WXX’YZ + W’Y’Z’
= WXZ + WX’Z + WY’Z’ + WXZ’ + WX’Z’ + X’Y Z’ + X’YZ + WYZ’ +
W’YZ’ + W’Y’Z’
Then, gather similar terms and apply distribution postulate.
= (WXZ + WX’Z) + (WY’Z’+ WYZ’) + (WXZ’+ WX’Z’) + (X’YZ’+ X’YZ) +
(W’YZ’+ W’Y’Z’)
= W(X + X’)Z + W(Y’+ Y)Z’+ W(X + X’)Z’+ X’Y(Z’+ Z) + W’(Y + Y’)Z’
Now apply complementation postulate and idempotency theorem
(A.A=A) to reduce A+A’=1 and A.A’=0 terms.
= WZ + WZ’ + WZ’ + X’Y + W’Z’
= W(Z + Z’) + X’Y + W’Z’
= W + X’Y + W’Z’
= W + W’Z’ + X’Y
= (W + W’)(W + Z’) + X’Y
= W + Z’ + X’Y

̅̅̅̅ + 𝐶)
d) 𝐹 = 𝐵(𝐴𝐵 + 𝐴𝐵̅ )(𝐴𝐶

Y = B(AB + AB’)((AC)’ + C)
Y = (ABB + AB’B)(A’ + C’ + C)
Because XX = X , X’X = 0 , and X + X’ = 1
 The National Higher School of Artificial Intelligence 2023/2024
Digital Systems First Year

Y = (AB + 0)(A’ + 1)
Because X + 0 = X, X + 1 = 1
Y = AB(1)
Y= AB

e) (𝐴 + 𝐵̅ 𝐵) + ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
𝑜𝑢𝑡 = ̅̅̅̅̅̅̅̅̅̅̅̅ (𝐵 + 𝐴̅)(𝐴 + 𝐵𝐶)

f) 𝑜𝑢𝑡 = ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
(𝐶 + 𝐴𝐵𝐶̅ + B ̅ D) + ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅C (𝐶 + ̅̅̅̅̅̅̅̅
𝐵 + 𝐷)
 The National Higher School of Artificial Intelligence 2023/2024
Digital Systems First Year

Exercise 02
Express the following functions in a sum of minterms (SOP) and a product of maxterms (POS):
a) 𝐹 = (XY + Z)(Y + XZ)
b) 𝐹 = 𝐷(𝐴̅ + 𝐵) + 𝐵̅ 𝐷
 The National Higher School of Artificial Intelligence 2023/2024
Digital Systems First Year

Exercise 03
Simplify the following Boolean SOP expression using the Karnaugh map technique.
a) F(W,X,Y,Z) = ∑ m(0,2,4,5,7,8,10,13,14,15)

Karnaugh Map
00 01 11 10
00 1 1
01 1 1 1
11 1 1 1
10 1 1
Which yields the expression:

F = X’Z’ + XZ + W’Y’Z’ + WYZ’

There may be other expressions, but those ones should all reduce to the one above or be equivalent.
Check these carefully.

b) F(X,Y,Z) = Π M(0,1,2,3,4,6)

Karnaugh Map
00 01 11 10
0 0 0 0 0
1 0 1 1 0

Which yields the expression:

F = X Z

Simplify the following Boolean SOP expression, with don’t care conditions, using the Karnaugh map
technique. Express your answer in POS form.

b) F(W,X,Y,Z) = Σ m(1,2,5,8,9,12,14) + Σ dc(3,6,10,13,15)

Method 01 : Extract SOP then POS

00 01 11 10
00 0 1 dc 1
01 0 1 0 dc
11 1 dc dc 1
10 1 1 0 dc

Which yields the expression: Fsop = WZ’+ Y’Z + YZ’

Fpos = Demorgan((Fsop)’)
(Fsop)’= Fsop = (WZ’+ Y’Z + YZ’)= (WZ’+ Y’Z + YZ’)’
= (w’+z)(y+z’)(y’+z)
= (w’+z)(yy’+yz+z’y’+z’z)
 The National Higher School of Artificial Intelligence 2023/2024
Digital Systems First Year

= (w’+z)(yz+y’z’)
= w’yz + w’y’z’+ yzz + y’z’z
= w’yz + w’y’z’+ yz
= (w’+1)yz + w’y’z’
= yz + w’y’z’
Fpos = Demorgan((Fsop)’)
Fpos = Demorgan(yz + w’y’z’)= (y’+z’)(w+y+z)

Method 02 : Extract POS directely

00 01 11 10
00 0 1 dc 1
01 0 1 0 dc
11 1 dc dc 1
10 1 1 0 dc

Fpos = (y’+z’)(w+y+z)

a) F(W,X,Y,Z) = Σ m(2,5,7,8,9,12,15) ; dc(W,X,Y,Z) = Σ m(0,1,10,14)

NOTE: Remember the D values can be chosen arbitrarily. In this example, there is no benefit
gained by setting any D to 0. To form the POS expression, all D values are considered as 1’s
and only the 0-cells are encircled. The resulting POS form is:

F = ( W + X’ + Z ) ( X + Y’ + Z’ ) ( W’ + X’ + Y + Z’ )
 The National Higher School of Artificial Intelligence 2023/2024
Digital Systems First Year

Exercise 04
a) Assuming the following Truth Table for a three input variable function F(A,B,C), determine the full
Minterm expression for F.

A B C F
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0
Answer: F(A,B,C) = A’B’C’ + A’BC + AB’C’ + ABC’
b) Using a Karnaugh map, simplify the expression for F(A,B,C) defined in the above Part.

Answer: F(A,B,C) = A’BC + B’C’ + AC’

Exercise 05
The circuit shown below can be simplified. Write a Boolean expression that represents the function of
the simplified circuit using the minimum number of AND, OR and NOT gate.

A’
A A’ + AB
A’ + AB + (A’ + AB)’ B
C

AB

B (A’ + AB)’. B

C = A’ + AB + (A’ + AB)’ B
= A’ + AB + ( A (A’+B’) ) B
= A’ + AB + AA’B + AB’B
= A’ + AB
= A’ + B
 The National Higher School of Artificial Intelligence 2023/2024
Digital Systems First Year

Exercise 6
Draw the circuit diagram for the Boolean expression below. Use NAND gates only. (ie. you may not
use inverter gates).
𝐹 = 𝑋𝑌̅ + 𝑋̅𝑌

F = F’’ = (XY’ + X’Y)’’ = ((X(YY)’)’((XX)’Y)’)’

Draw the circuit diagram for the following Boolean expression using only NOR gates
𝐹 = 𝑋𝑌 + 𝑋̅𝑍 + 𝑌𝑍̅

Express F algebraically in NOR form, that is: (A+B)’ = A NOR B;

note that A’ = (A+A)’ = A nor A.

F(X,Y,Z) = XY + X’Z + YZ’

= (XY)’’ + (X’Z)’’ + (YZ’)’’
= (X’ + Y’)’ + (X + Z’)’ + (Y’ + Z)’
= ((X+X)’+(Y+Y)’)’+ (X +(Z+Z)’)’ +((Y+Y)’+ Z)’
= ((X nor X)+(Y nor Y))’+ (X + (Z nor Z))’+ ((Y nor Y)+ Z)’
= ((X nor X)nor(Y nor Y))+(X nor(Z nor Z))+((Y nor Y)nor Z)

The circuit diagram :

Exercise 7

Design a combinational circuit with three inputs, x, y and z, and the three outputs, A, B, and C. when
the binary input is 0, 1, 2, or 3, the binary output is one greater than the input. When the binary input is
4, 5, 6, or 7, the binary output is one less than the input.

a) Derive the truth table that defines the required relationship between inputs and outputs.
 The National Higher School of Artificial Intelligence 2023/2024
Digital Systems First Year

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

b) Obtain the simplified Boolean functions for each output as a function of the input variables.

B=x+y+z

c) Draw the logic diagram