25. construct

29. Write the number of possible truth combinations for the

truth table

following Boolean expressions:

a. SO+ON

d. B+E

b. W+E

e. D+ONE

c. WILL

26.

30. Assume a problem is presented that requires the design of a

a. 24 = 16

circuit which will add two binary digits. The first step is to

b. 23 = 8

construct a truth table which includes an output for each

c. 25 = 32

combination of possible input states. From the rules for

d. 22 = 4

binary addition, a truth table is derived as shown below.

0 + 0 = 0 with a carry of

0

27. To

0 + 1 = 1 with a carry of

0

Rules for binary

1 + 0 = 1 with a carry of

0

addition

determine the

1 + 1 = 0 with a carry of

1

truth value of the

combination of

A

B

SUM

CARRY

Truth table derived from

two or more

0

0

0

0

the rules for binary addition

0

1

1

0

statements.

1

0

1

0

1

1

0

1

28. construct

Construct a truth table for a circuit that will add two binary

truth table

digits. Label the inputs C and D. Show the SUM and the

CARRY outputs.

Integrated Publishing, Inc. |