1.

Write the truth table for the following logic functions:

a. F = AB + ABC + ABC
b. F = (AB)(C + D)
a.
A
0
0
0
0
1
1
1
1

B
0
0
1
1
0
0
1
1

C
0
1
0
1
0
1
0
1

AB
0
0
1
1
0
0
0
0

ABC
0
1
0
0
0
0
0
0

ABC
0
0
0
0
0
0
0
1

F
0
1
1
1
0
0
0
1

b.
A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

C
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

D
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

AB
0
0
0
0
0
0
0
0
0
0
0
0
1
1
1
1

(AB)
1
1
1
1
1
1
1
1
1
1
1
1
0
0
0
0

C+D
1
1
1
0
1
1
1
0
1
1
1
0
1
1
1
0

(C+D)
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
1

F
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
0

2. Write the SSOP and SPOS forms of the following functions:

a. F(X,Y,Z) = m(2,4,6,7)
XYZ
000
001
010
011
100
101
110
111

Minterms Product Terms

m0
XYZ
m1
XYZ
m2
XYZ
m3
XYZ
m4
XYZ
m5
XYZ
m6
XYZ
m7
XYZ

Maxterms Sum Terms

M0
(X+Y+Z)
M1
(X+Y+Z)
M2
(X+Y+Z)
M3
(X+Y+Z)
M4
(X+Y+Z)
M5
(X+Y+Z)
M6
(X+Y+Z)
M7
(X+Y+Z)

F = m(2,4,6,7) = M(0,1,3,5)
FSSOP = XYZ + XYZ + XYZ + XYZ
FSPOS = (X+Y+Z) (X+Y+Z) (X+Y+Z) (X+Y+Z)

b. F(R,S,T) = R + (ST)
R
0
0
0
0
1
1
1
1

S
0
0
1
1
0
0
1
1

T R ST (ST) F Minterms Maxterms

0 1
0
1
1 RST
1 1
1
0
1
RST
0 1
0
1
1
RST
1 1
0
1
1
RST
0 0
0
1
1
RST
1 0
1
0
0
(R+S+T)
0 0
0
1
1
RST
1 0
0
1
1
RST

F = m(0,1,2,3,4,6,7) = (5)
FSSOP = RST + RST + RST + RST + RST + RST + RST

FSPOS = (R + S + T)

3. Convert the Boolean expression below to its minterm and maxterm

lists:
F(A,B,C,D,E) = (C + E)(E + BD) + (AE + BC)(D + E)
Answer:
Since you have 5 input literals, you will have 25 = 32 possible minterms/maxterms for this
function. There are at least 3 different ways to solve for the minterms and maxterms:
1. via Complete Truth table
2. via K-map
3. via Boolean Minimization Theorems
The first two methods are straightforward, however they are tedious and time-consuming.
We will try to solve this using a combination of methods #3 and #1.

A
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
1
1

1. F = (C + E)(E + BD) + (AE + BC)(D + E)

- Given
2. F = (C+E)(E(BD)) + (AE + BC)(DE)
- De Morgans / De Morgans
3. F = CE(BD) + EE(BD) + AEDE + BCDE
- Distributive / Distributive
4. F = CE(BD) + E(BD) + ADEE + BCDE
- EE = E / Commutative
5. F = (C + 1)(E(BD)) + AD0 + BCDE
- Distributive / EE = 0
6. F = (1)(E(BD)) + 0 + BCDE
- (C+1) = 1 / AD0 = 0
7. F = E(BD) + BCDE
- 1*X = X / X + 0 = X
8. F = (B+D)E + BCDE
- De Morgans / Commutative
9. F = BE + DE + BCDE
- Distributive
10. F = BE + (1+BC)(DE)
- Distributive
11. F = BE + DE
- (1+BC) = 1 / 1(DE) = DE
From 11, we will construct a simplified truth table as follow
A
B
C
D
E BE DE F
B
C
D
E BE DE F
1
0
0
1
1
0
0
0
0
0
0
0
1
1
1
1
0
1
0
0
1
1
1
0
0
0
1
0
0
0
1
0
1
0
1
0
0
0
0
0
1
0
1
0
1
1
0
1
1
0
1
0
1
0
0
1
1
0
0
0
1
0
1
1
1
0
0
0
0
1
0
0
1
1
1
1
1
0
0
0
0
1
1
0
1
0
1
0
0
0
1
1
0
0
1
0
0
0
0
1
1
0
1
0
1
1
1
0
1
0
0
0
0
0
1
1
1
0
0
0
1
1
0
1
1
0
0
0
1
0
0
0
0
1
1
1
1
1
0
0
0
1
1
1
0
0
1
0
0
0
1
1
1
0
1
0
0
0
1
0
1
0
0
0
0
1
1
1
1
0
0
0
0
1
0
1
1
0
0
0
1
1
1
1
1
0
0
0
1
1
0
0
0
1
1
1
1
0
1
0
0
0
F = m(0,2,4,6,8,12,16,18,20,22,24,28)
1
1
1
0
0
0
0
F=
1
1
1
1
0
0
0
M(1,3,5,7,9,10,11,13,14,15,17,19,21,2
0
0
0
0
1
1
1
3,25,26,27,29,30,31)
0
0
0
1
0
0
0
0
0
1
0
1
0
1

4. Use Boolean minimization to simplify the following logic

functions:
a. F(Q,R,S,T) = [(Q + R) + (R + T) + (S + T)] in SOP form
1. F = [(Q + R) + (R + T) + (S + T)]
2. F = [((Q + R)) * ((R + T)) * ((S + T))]
3. F = [(Q + R) (R + T) (S + T)]
4. F = [(Q + R)R + (Q + R)T] (S + T)
5. F = [QR + RR + QT + RT](S+T)
6. F = [QR + QT + RT](S+T)
7. F = QR(S+T) + QT(S+T) + RT(S+T)
8. F = QRS + QRT + QTS + QTT + RTS + RTT
9. F = QRS + QRT + QST + Q0 +RST + R0
10. F = QRS + QRT + QST + RST

- Given
- De Morgans
- Double Negation
- Distributive
- Distributive
- RR = 0 / A+0 = A
- Distributive
- Distributive
- Commutative/ TT = 0
- A0 = 0 / A+0 = A

F = QRS + QRT + QST + RST

b. F = ABCD(ABCD + ABCD + ABCD + ABCD) in POS form
1. F = ABCD(ABCD + ABCD + ABCD + ABCD)
2. F = ABCD(ABCD + ABCD + ABCD)
3. F = ABCDABCD + ABCDABCD + ABCDABCD
4. F = AABBCCDD + AABBCCDD + AABBCCDD
5. F = ABC0 + 0BCD +AB0D
6. F = 0 + 0 + 0
7. F = 0

F=0

- Given
- A+A = A

- Distributivity
- Commutativity
- AA = A / AA = 0
- A0 = 0
-0+0=0

5. Determine the minimal SOP form of the function below using the
K-maps provided.
F(A,B,C,D,E,F) = m(2,4,5,6,12 to 21, 28 to 31, 34, 38, 50, 51, 60 to 63)
CD
EF

CD
00

01

11

10

00

01

11

10

EF

00

01

11

10

00

01

11

10

(AB = 00)

(AB = 10)

CD
EF

CD
00

01

11

10

00

01

11

10

0
(AB = 01)

EF

00

01

11

10

00

01

11

10

(AB = 11)

3 Octets , 3 Quads

FMSOP = ACD + BCD + ADE + BCEF + BCDE + ABCD

6. Determine the minimal SOP and minimal POS forms of the

function below using tabular minimization (binary form).
F(M,N,O,P) = m(0,1,4,5,6,7,8,9,10,12,14)
a. minimal SOP
0s Cube
m0 0000
-------------m1 0001
m4 0100
m8 1000
-------------m5 0101
m6 0110
m9 1001
m10 1010
m12 1100
-------------m7 0111
m14 1110

*
*
*
*
*
*
*
*
*
*
*

Prime Implicants
a
b
c
d
e
f

1s Cube

2s Cube

Prime Implicants

000- (0,1) *
0-00 (0,4) *
-000 (0,8) *
---------------0-01 (1,5) *
-001 (1,9) *
010- (4,5) *
01-0 (4,6) *
-100 (4,12) *
100- (8,9) *
10-0 (8,10) *
1-00 (8,12) *
---------------01-1 (5,7) *
011- (6,7) *
-110 (6,14) *
1-10 (10,14) *
11-0 (12,14) *

0-0- (0,1;4,5)
-00- (0,1;8,9)
0-0- (0,4;1,5)
--00 (0,4;8,12)
-00- (0,8;1,9)
--00 (0,8,4,12)
------------------01-- (4,5;6,7)
01-- (4,6;5,7)
-1-0 (4,6;12;14)
-1-0 (4,12;6,14)
1--0 (8,10;12,14)
1--0 (8,12;10,14)

a
b

m0
*
*
*

m1
*
*

m4
*
*
*
*

FMSOP = NO + MN + MP

m5
*
*

m6

*
*

d
e
f

m7

m8

m9

*
*

m10

m12

m14

*
*

*
*

*
*

b. minimal POS
F(M,N,O,P) = m(0,1,4,5,6,7,8,9,10,12,14) = (2,3,11,13,15)
0s Cube
M2 0010
-------------M3 0011
-------------M11 1011
M13 1101
-------------M15 1111

*
*
*
*

1s Cube

Prime Implicants

001- (2,3)
----------------011 (3,11)
---------------1-11 (11,15)
11-1 (13,15)

a
b
c
d

Prime Implicants
a
b
c
d

M2
*

M3
*
*

FMPOS = (M+N+O)(N+O+P)(M+N+P)
or
FMPOS = (M+N+O)(M+O+P)(M+N+P)

M11

M13

M15

*
*

*
*

7. Draw the logic circuit implementation for the following Boolean

functions.
a. F(M,N,O,P) = m(0,5,7,13) using 2-input AND, OR, and NOT
gates
M

1 0

b. F(R,S,T) = M(1,4) using 3-input AND, OR, and NOT gates

R

1 0

c. F(A,B,C) = AB + ABC using only 3-input NAND gates

A

1 0