4.1 When implemented, a minterm Boolean expression produces what pattern of logic gates?

4.2 When implemented, a maxterm Boolean expression produces what pattern of logic gates?

4.3 Simplify the Boolean expression _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _A B C D + A B C D + A B C D + A B C D + A B C D + A B C D + A ∙ ∙ ∙ ∙ ∙ ∙ ∙ ∙ ∙ ∙ ∙ ∙ ∙ ∙ ∙ ∙ ∙ ∙

B C D = Y.∙ ∙ ∙

4.4 Do you think it is possible to develop a maxterm (product-of-sums) Boolean expression from a truth table?

4.5 Do you think the Karnaugh map shown in Fig. 4-21(b) can be used to simplify either minterm or maxterm Boolean expressions?

FTCc ELE2053 Week#4 Homework Chapter 4 Combining Logic Gates 1

FTCc ELE2053 Week#4 Homework Chapter 4 Combining Logic GatesName: Date:

4.6 A six-variable truth table would have how many combinations?

__ __ __ __4.7 Write the keyboard version of the Boolean expression A B C + A B C + A B C = Y as∙ ∙ ∙ ∙ ∙ ∙ you may have to do when entering information into a computer circuit simulator.

4.8 Write a maxterm Boolean expression for the logic diagram shown in Fig. 4-58.FTCc ELE2053 Week#4 Homework Chapter 4 Combining Logic Gates 2

4.9 Using DeMorgan’s theorems(or circuit simulator software if available) write the minterm Boolean expression that would describe the logic function of the circuit in Fig. 4-58.

Hint: Use the maxterm expression developed in question 4-8.

4.10 Draw a three-variable truth table that would describe the logic function of the circuit in Fig. 4-58.

Hint: Work from the minterm expression developed in question 4-9.

FTCc ELE2053 Week#4 Homework Chapter 4 Combining Logic Gates 3