ch4-test.pdf - Exam Name TRUE\/FALSE Write'T if the statement is true and'F if the statement is false 1 Boolean multiplication is symbolized by A B F 2

# ch4-test.pdf - Exam Name TRUE/FALSE Write'T if the...

This preview shows page 1 - 2 out of 6 pages.

Exam Name___________________________________ TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1) Boolean multiplication is symbolized by A + B. 2) In Boolean algebra, 1 ·0 = 0. 3) The complement of 1 is 0. 4) The Boolean expression X = ABC describes a three-input AND gate. 5) When a two-input NAND gate has inputs of 1 and 0, the output is 0. 6) The commutative law of Boolean algebra states that A + B = A ·B. 7) According to the distributive law, Figure 4-1 shows one possible logic implementation of the expression X = A(B+C). 8) For the circuit in Figure 4-1, X = 0 whenever A = 0, regardless of the levels applied to inputs B and C. Figure 4-1 9) DeMorgan's theorem states that (XY)’ = X + Y. TTTFFTF10) DeMorgan's theorem states that( X + Y)’ = X’ Y’. 11) The Karnaugh maps provide graphic approaches to simplifying Boolean expressions. 12) The Sum-of-Product (SOP) form is a standard form of Boolean expression. 13) The Product-of-Sum (POS) form is a standard form of Boolean expression. 14) When mapping an SOP expression using a Karnaugh map a 0 is placed in each cell corresponding to the value of the product term. MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. 15) Which of the following is a correct form of Boolean addition? A) 0 ·0 = 0 B) 0 + 1 = 0 C) 0 + 1 = 1 D) 0 ·1 = 0 TTTCFTTTFFTF

#### You've reached the end of your free preview.

Want to read all 6 pages?

• Spring '17
• Chang Yanchao
• Boolean Algebra, Logic gate, Karnaugh map, Boolean expression