# Logic Design

Β Find the oneβs and twoβs complement of each of the following positive binary numbers, assuming

a number system with number of bits π = 8.

a) 10010

b) 01001000

2. Prove each of the following, using only the six postulates and/or Theorems 1-3 of Boolean

algebra (Each step must be justified by listing the applicable postulate or theorem).

a) (π + π)(π + πβ²) = π

b) π(π΄ +πβ²) = ππ΄

3. Use the absorption theorems (Theorems 4-5-6), plus any other theorems and postulates, to

simplify the following expressions. (The simplified expressions should have as few terms as

possible.)

a) π΄π΅πΆ + π΄π΅πΆβ² + π΄π΅β² + π΄π΅β²πΆβ² + π΄β²π΅πΆβ²

b) (π + π + πβ²)(π + π + π)(πβ² + π)(πβ² + π + πβ²)(π + πβ² + πβ²)

4. Apply DeMorganβs theorem to convert the following expression to one in which no complement

is applied to more than a single variable.

a) (ππβ² + ππ + πβ²π)β²

b) ((πβ² + π)(π + πβ²)(π + πβ² + π))β²

c) ((π₯β² + π¦) + (π₯ + π§))β²

5. Find the simplest switching expressions for the following functions. (Minimize the number of

terms and the number of literals in each term.) The final expression may be in either sum of

products or product of sums form.

a) π(π΄, π΅, πΆ, π·) = βπ(0,1,3,6,7,12,13)

b) π(π΄, π΅, πΆ, π·) = βπ(0,1,3,6,7,12,13)

6. Find the truth tables, minterm lists, and maxterm lists for the following switching functions.

a) π(π, π, π) = ππ + οΏ½Μ οΏ½π

b) π(π,π, π, π) = (π + οΏ½Μ οΏ½ + οΏ½Μ οΏ½)(π + οΏ½Μ οΏ½ + π)(οΏ½Μ οΏ½ + π)

c) π(π, π, π) = ππΜ + οΏ½Μ οΏ½οΏ½Μ οΏ½Μ Μ Μ Μ Μ Μ Μ Μ Μ Μ

7. Find a minimal two-level NAND circuit for each of the following switching functions.

a) π(π΄, π΅, πΆ) = βπ(2,5,6,7)

b) π(π΄, π΅, πΆ, π·) = βπ(0,2,5,7,8,10,13,15)

8. Find a minimal two-level NOR circuit for each of the switching functions in problem 7.

9. For the circuit diagram given below:

a. Derive a switching expression for output Y, in terms of A, B, and C.

b. Find the minterms and maxterms of function Y(A,B,C)