Amy Guan

Short Assignment 9: Circuits

1.)

Boolean expression (a . b) + (a . c)
a b c (a.b) (a.c) (a.b) + (a.c)
0 0 0 0 0 0
1 0 0 0 0 0
0 1 0 0 0 0
0 0 1 0 0 0
1 1 0 1 0 1
1 1 1 1 1 1
1 0 1 0 1 1
0 1 1 0 0 0

Boolean expression a . (b + c)
a b c (b + c) a . (b+c)
0 0 0 0 0
1 0 0 0 0
0 1 0 1 0
0 0 1 1 0
1 1 0 1 1
1 1 1 1 1
1 0 1 1 1
0 1 1 1 0

Both truth tables are the same.

2.) There are two fewer transistors when building Boolean expression a . (b + c) because three gates are used in
(a . b) + (a . c), each using 2 transistors, so 6 total transistors are used in them. There are 2 gates used in a . (b +
c), using a total of 4 transistors. Thus, two fewer transistors are used.
3.) Boolean expression (a + b) . (a + c)

a b c (a + b) (a + c) (a + b) . (a + c)

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

Boolean expression a + (b . c)

a b c b.c a + (b . c)

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

4.) Boolean expression a + (b . c) uses one less gate, so 2 less transistors are used in the Boolean expression.
Each gate uses two transistors, so using one less gate will need two less transistors used for the expression.

5.)
6.)
A B C D simplified A.B A.C B.C D = (A . B) + (A . C) + (B . C)
expressions
1 1 1 1 a.b.c 1 1 1 1
1 1 0 1 a . b . c 1 0 0 1
1 0 1 1 a . b . c 0 1 0 1
0 1 1 1 a . b . c 0 0 1 1
0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0
0 1 0 0 0 0 0 0
1 0 0 0 0 0 0 0

d = (a . b . c) + (a . b . c) + (a . b . c) + (a . b . c)
simplified Boolean expression = d = (A . B) + (A . C) + (B . C)
7.)

a b c z0 z1 z2 z3 z4 z5 z6 z7
0 0 0 1 0 0 0 0 0 0 0
0 0 1 0 1 0 0 0 0 0 0
0 1 0 0 0 1 0 0 0 0 0
0 1 1 0 0 0 1 0 0 0 0
1 0 0 0 0 0 0 1 0 0 0
1 0 1 0 0 0 0 0 1 0 0
1 1 0 0 0 0 0 0 0 1 0
1 1 1 0 0 0 0 0 0 0 1

z0 = a + b + c
z1 = a + b + c
z2 = a + b + c
z3 = a + b + c
z4 = a + b + c
z5 = a + b + c
z6 = a + b + c
z7 = a + b + c

for three connections to each gate:

.
.
.
.
.
.
.
.
with only 2 connections to each gate: