CHAPTER05 QUESTIONS

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

1) How many two-input gates are needed to build the equivalent circuit for X = AB+AC? 1)
A) three B) four C) one D) two

2) The final output of a sum-of-products (SOP) circuit is generated by 2)

A) a NOR. B) an OR. C) a NAND. D) an AND.

3) How many two-input gates are needed to build the equivalent circuit for X = ABCD? 3)
A) one B) two C) three D) four

4) The simplest form of X = A(B + C) + C is ________. 4)

A) X = AB + AC B) X = AB + C
C) X = A + B + C D) X = AB + AC + C

5) DeMorgan's Theorem is used to simplify circuits 5)

A) that contain inverters. B) that contain ORs and ANDs.
C) that are very complex. D) that contain NORs and NANDs.

6) Which equation demonstrates the Distributive Law? 6)

A) BA + CA = A(B + C) B) BC + A = ABC
C) AB + AC = AB + C D) BC + A = A + BC

7) Which Boolean equation results from this Karnaugh map? 7)

A) (AB) + (BC) + (B C) B) (AB) + (AC) + (BC)

C) (AB) + (BC) + (B C) D) (AC) + (A B) + (B C)

8) AB + AC = A(B + C) is an example of the 8)

A) distributive law. B) commutative law.
C) associative law. D) conductive law.

9) A · A = ________. 9)
A) 1 B) 0 C) A D) A

10) The simplest form of X = AC + C(A + B) is ________. 10)

A) X = C + AC B) X = AC + BC C) X = A + BC D) X = AC + B

11) The simplest form of X = A(B + C) + AC is ________. 11)

A) X = A + AC B) X = B + AC C) X = AB + BC D) X = AB + AC

1
12) Anything ORed with a 1 is equal to 12)
A) 0. B) 1.
C) itself. D) its complement.

13) When ones in a Karnaugh Map are not next to each other visually, they can be grouped if they are 13)
next to each other by means of
A) technique. B) complements. C) wraparound. D) virtuosity.

14) Which equation is in its simplest form? 14)

A) (A + B)C + BC = X B) ABC + AC = X
C) ABC + BC = X D) AB + AC + C = X

15) Anything ORed with its own complement is equal to 15)

A) 0. B) 1.
C) itself. D) its complement.

16) An AND gate with inverted inputs functions as 16)

A) an OR gate. B) a NAND gate. C) an inverter. D) a NOR gate.

17) Which step in this reduction series is based on DeMorgan's Theorem? 17)

X = A*B(B + C) STEP 1 X = (A + B)(BC)

STEP 2 X=ABC+BBC

STEP 3 X = B C(A + 1)

STEP 4 X=BC
A) STEP 1 B) STEP 2 C) STEP 3 D) STEP 4

18) A NOR gate with all inputs tied to one signal functions as 18)
A) a NAND gate. B) an AND gate. C) an OR gate. D) an inverter.

19) A + AB = ________. 19)

A) AB B) A + B C) AB D) A + B

20) By using DeMorgan's theorem, X = A(B + C) is simplified to ________. 20)

A) X = A(B + C) B) X = ABC C) X = A + B + C D) X = A + BC

21) The simplest form of X = (A + B)A + AB is ________. 21)

A) X = A + B B) X = A + AB C) X = B D) X = A + B

22) Anything ORed with a 0 is equal to 22)

A) 0. B) 1.
C) itself. D) its complement.

2
23) Which Boolean equation expresses the commutative law? 23)
A) A + B = B + A B) AB = BA C) XY = YX D) all of the above

24) A + AB = ________. 24)

A) A + B B) A + B C) AB D) AB

25) Anything ANDed with a 0 is equal to 25)

A) 0. B) 1.
C) itself. D) its complement.

26) Which Boolean expression indicates inverted inputs to a gate? 26)

A) A + B B) A + B
C) AB D) Both AB and A + B are correct.

27) The AND-OR-INVERT gates are designed to simplify implementation of 27)

A) POS logic. B) SOP logic.
C) NAND logic. D) DeMorgan's theorem.

28) A + A = ________. 28)

A) 1 B) 0 C) A D) A

29) Which of the following is an example of DeMorgan's theorem? 29)

A) A B = A + B B) AB = A + B C) AB = A B D) A + B = A + B

30) The simplest form of X = (AB + AC)BC is ________. 30)

A) X = A + B*C B) = A*C + B*C
C) = A*B*C + A*B*C D) ABC

31) X + Y = Y + X is an example of the 31)

A) distributive law. B) conductive law.
C) commutative law. D) associative law.

32) Which Boolean expression indicates an inverted gate output? 32)

A) A + B B) A + B C) A + B D) A + B

33) Anything ANDed with a 1 is equal to 33)

A) 0. B) 1.
C) itself. D) its complement.

34) A NAND gate with all inputs tied to one signal functions as 34)
A) an inverter. B) an AND gate. C) an OR gate. D) a NOR gate.

35) A + 1 = ________. 35)

A) 1 B) 0 C) A D) A

3
36) Which Boolean equation results from this Karnaugh Map? 36)

A) (ABD) + (B CD) + (CD) B) (ACD) + (BC D) + (B C)

C) (ABD) + (ACD) + (CD) D) (ACD) + (BCD) + (CD)

37) A NAND gate with each input inverted functions as 37)

A) a NOR gate. B) an AND gate. C) an OR gate. D) an inverter.

38) Which Boolean equation expresses the commutative law? 38)

A) AB + AC = A(B + C) B) A + (B + C) = (A + B) + C
C) AB = BA D) AB = AB

39) Which answer is an example of a product-of-sum (POS) expression? 39)

A) X = ABC B) X = (A + B)(C + D)
C) X = AB + CD D) X = A + B + C

40) Which equation is in its simplest form? 40)

A) ABC + ABC = X B) AB + AC + AB = X
C) A(B + C) + A = X D) AB + A + AC

41) Anything ORed with itself is equal to 41)

A) 0. B) 1.
C) itself. D) its complement.

42) The simplest form of X = AB + ABC + A(B + C) is ________. 42)

A) X = AB + AC B) X = AB + C
C) X = AB + AC + C D) X = A

43) A NOR gate with a bubble on one of its inputs is equivalent to 43)
A) a NOR with bubbles in its inputs.
B) a NAND with bubbles on its inputs.
C) a NAND with a bubble on one input.
D) a NOR.
E) an AND with a bubble on the other input.

44) How many NAND gates does it take to make an OR gate? 44)
A) 1 B) 2 C) 3 D) 4

4
45) Which Boolean equation expresses the associative law? 45)
A) (AB)C = A(BC)
B) X(Y + Z) = XY + XZ
C) A + BC = BC + A
D) Both A + BC = BC + A and (AB)C = A(BC) are correct.

46) A + A = ________. 46)

A) 1 B) 0 C) A D) A

47) Which Boolean equation results from this Karnaugh map? 47)

A) (AB) + C B) (AB) + (BC)

C) (ABC) + C D) (A B) + (AC) + (BC)

48) The final output of a product-of-sum (POS) circuit is generated by 48)

A) an OR. B) a NOR. C) a NAND. D) an AND.

49) Which two-input gate will produce the final output of this Boolean expression? 49)
X = AB + CD
A) OR B) AND C) NAND D) NOR

50) An OR gate is equivalent to 50)

A) a NOR with bubbles in its inputs.
B) a NAND with bubbles on its inputs.
C) a NAND with a bubble on one input.
D) a NOR.
E) an AND with a bubble on one input.

51) How many two-input gates are needed to build the logic circuit represented by X = C(A+B)? 51)
A) one B) three C) two D) four

52) Which law of Boolean Algebra is applied in this equation? 52)

ABC + BC + A = BC(A + 1) + A
A) Commutative B) Associative C) Additive D) Distributive

53) A = ________. 53)

A) 1 B) 0 C) A D) A

54) Which equation is in its simplest form? 54)

A) AB(B + C) = X B) AB + AC + BC = X
C) AB + AB + AC = X D) AB(AC + C) = X

5
55) The circles used on gate inputs and outputs are called 55)
A) inversion circles. B) inversion bubbles.
C) connection dots. D) input/output bubbles.

56) Anything that is complemented twice is equal to 56)

A) 0. B) 1.
C) itself. D) its complement.

57) What is the simplest form of X = A + AC ? 57)

A) X = C B) X = A + C
C) X = AC D) It is in its simplest form.

58) The simplest form of X = A(B + C) + AB is ________. 58)

A) X = B + AC B) X = AB + AB C) X = AC + AB D) X = AC

59) A NOR gate with its output inverted functions as 59)

A) an AND gate. B) an OR gate. C) an inverter. D) a NAND gate.

60) In VHDL programming, a hyphen used to specify a ________ bit state. 60)
A) 0 B) 1
C) high impedance D) don't care

61) A NOR gate with inverted inputs functions as 61)

A) a NOR gate. B) an AND gate. C) an OR gate. D) a NAND gate.

62) A + 0 = ________. 62)

A) 1 B) 0 C) A D) A

63) Which of the following is not a reason for Boolean simplification? 63)
A) It uses fewer gates. B) A Boolean expression is longer.
C) Reliability is increased. D) Circuit cost is reduced.

64) Anything ANDed with its own complement is equal to 64)

A) 0. B) 1.
C) itself. D) its complement.

65) An AND gate is equivalent to 65)

A) a NOR with bubbles in its inputs.
B) a NAND with bubbles on its inputs.
C) a NAND with a bubble on one input.
D) a NOR.
E) an AND with a bubble on one input.

66) How many NAND gates does it take to make an AND gate? 66)
A) 1 B) 2 C) 3 D) 4

67) A + ABC + ABC + AC = ________. 67)

A) AC B) A + C C) 1 D) A

6
68) A NOR gate with each input inverted functions as 68)
A) an AND gate. B) a NAND gate. C) an OR gate. D) an inverter.

69) Which equation demonstrates the Commutative Law? 69)

A) A(BC) = (AB)C B) C + AB = AB + C
C) A + BC = AB + C D) C + B + A = ABC

70) Anything ANDed with itself is equal to 70)

A) 0. B) 1.
C) itself. D) its complement.

71) X(YZ) = (XY)Z is an example of the 71)

A) commutative law. B) associative law.
C) distributive law. D) conductive law.

72) Which answer is an example of a sum-of-products (SOP) expression? 72)

A) X = (AB)(CD) B) X = A + B
C) X = AB + AC D) X = (A + B)(C + D)

73) An AND with bubbles on its inputs is equivalent to 73)

A) a NOR with bubbles in its inputs.
B) a NAND with bubbles on its inputs.
C) a NAND with a bubble on one input.
D) a NOR.
E) an AND with a bubble on one input.

74) Which logic function accomplishes Boolean (logical) multiplication? 74)

A) NOR B) invert C) AND D) OR

75) Which Boolean equation results from this Karnaugh map? 75)

A) A B + AC + BC B) (AB) + (AB) + (B C)
C) (AB) + (B C) + (BC) D) (A B) + (AB) + (BC)

76) A NAND gate with inverted inputs functions as 76)

A) a NAND gate. B) an AND gate. C) a NOR gate. D) an OR gate.

77) Which logic function accomplishes Boolean (logical) addition? 77)

A) OR B) invert C) NAND D) AND

7
78) A · A = ________. 78)
A) 1 B) 0 C) A D) A

79) How many NAND gates does it take to make a NOR gate? 79)
A) 1 B) 2 C) 3 D) 4

80) What is the simplest form of X = AB + AC + BC? 80)

A) X = BC + C B) X = AB + C
C) X = A + BC D) It is in its simplest form.

81) A · 1 = ________. 81)

A) 1 B) 0 C) A D) A

82) An OR gate with one bubble on an input is equivalent to 82)

A) a NOR with bubbles in its inputs.
B) a NAND with bubbles on its inputs.
C) a NAND with a bubble on the other input.
D) a NOR.
E) an AND with a bubble on one input.

83) A NAND gate with its output inverted functions as 83)

A) an AND gate. B) a NOR gate. C) an inverter. D) an OR gate.

84) An OR gate with inverted inputs functions as 84)

A) an inverter. B) an AND gate. C) a NOR gate. D) a NAND gate.

85) The simplest form of X = (A + B) + AC is ________. 85)

A) X = A + AC B) X = A B C C) X = A B D) X = A + B + C

86) How many NAND gates does it take to make an inverter? 86)
A) 1 B) 2 C) 3 D) 4

87) When entering a truth table in VHDL inputs are grouped together as 87)
A) elements. B) statements. C) vectors. D) arrays.

88) Which Boolean equation results from this Karnaugh Map? 88)

A) (A B CD) + (ABD) + (A D) + (BD) B) (AB C D) + (ABC) + (AD) + (BD)

C) (AB C D) + (A BD) + (AD) + (CD) D) (AB C) + (A BCD) + (AD) + (CD)

8
89) The simplest form of X = A + AB + ABC is ________. 89)
A) X = BC B) X = ABC C) X = AB D) X = A + B

9
Answer Key
Testname: CHAP05Q

1) D
2) B
3) C
4) B
5) D
6) A
7) A
8) A
9) C
10) C
11) D
12) B
13) C
14) C
15) B
16) D
17) A
18) D
19) D
20) D
21) C
22) C
23) D
24) B
25) A
26) A
27) B
28) A
29) B
30) D
31) C
32) C
33) C
34) A
35) A
36) D
37) C
38) C
39) B
40) B
41) C
42) D
43) E
44) C
45) A
46) C
47) A
48) D
49) A
50) B
10
Answer Key
Testname: CHAP05Q

51) C
52) D
53) C
54) B
55) B
56) C
57) B
58) A
59) B
60) D
61) B
62) C
63) B
64) A
65) A
66) B
67) D
68) A
69) B
70) C
71) B
72) C
73) D
74) C
75) A
76) D
77) A
78) B
79) D
80) D
81) C
82) C
83) A
84) D
85) C
86) A
87) C
88) B
89) D

11