1. No category

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?
A) three
B) four
C) one
D) two
1)
2) The final output of a sum-of-products (SOP) circuit is generated by
A) a NOR.
B) an OR.
C) a NAND.
2)
D) an AND.
3) How many two-input gates are needed to build the equivalent circuit for X = ABCD?
A) one
B) two
C) three
D) four
3)
4) The simplest form of X = A(B + C) + C is ________.
A) X = AB + AC
C) X = A + B + C
B) X = AB + C
D) X = AB + AC + C
4)
5) DeMorgan's Theorem is used to simplify circuits
A) that contain inverters.
C) that are very complex.
B) that contain ORs and ANDs.
D) that contain NORs and NANDs.
5)
6) Which equation demonstrates the Distributive Law?
A) BA + CA = A(B + C)
B) BC + A = ABC
C) AB + AC = AB + C
D) BC + A = A + BC
6)
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
A) distributive law.
C) associative law.
8)
B) commutative law.
D) conductive law.
9) A · A = ________.
A) 1
9)
B) 0
C) A
D) A
10) The simplest form of X = AC + C(A + B) is ________.
A) X = C + AC
B) X = AC + BC
10)
C) X = A + BC
11) The simplest form of X = A(B + C) + AC is ________.
A) X = A + AC
B) X = B + AC
C) X = AB + BC
1
D) X = AC + B
D) X = AB + AC
11)
12) Anything ORed with a 1 is equal to
A) 0.
C) itself.
12)
B) 1.
D) its complement.
13) When ones in a Karnaugh Map are not next to each other visually, they can be grouped if they are
next to each other by means of
A) technique.
B) complements.
C) wraparound.
D) virtuosity.
13)
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
A) 0.
B) 1.
C) itself.
D) its complement.
16) An AND gate with inverted inputs functions as
A) an OR gate.
B) a NAND gate.
C) an inverter.
15)
D) a NOR gate.
17) Which step in this reduction series is based on DeMorgan's Theorem?
X = A*B(B + C)
A) STEP 1
STEP 1
X = (A + B)(BC)
STEP 2
X=ABC+BBC
STEP 3
X = B C(A + 1)
STEP 4
X=BC
B) STEP 2
C) STEP 3
18) A NOR gate with all inputs tied to one signal functions as
A) a NAND gate.
B) an AND gate.
C) an OR gate.
17)
D) STEP 4
D) an inverter.
19) A + AB = ________.
A) AB
C) AB
D) A + B
B) X = ABC
C) X = A + B + C
20)
D) X = A + BC
21) The simplest form of X = (A + B)A + AB is ________.
A) X = A + B
18)
19)
B) A + B
20) By using DeMorgan's theorem, X = A(B + C) is simplified to ________.
A) X = A(B + C)
16)
B) X = A + AB
21)
C) X = B
22) Anything ORed with a 0 is equal to
A) 0.
C) itself.
B) 1.
D) its complement.
2
D) X = A + B
22)
23) Which Boolean equation expresses the commutative law?
A) A + B = B + A
C) XY = YX
B) AB = BA
23)
D) all of the above
24) A + AB = ________.
A) A + B
24)
B) A + B
C) AB
25) Anything ANDed with a 0 is equal to
A) 0.
C) itself.
D) AB
25)
B) 1.
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
A) POS logic.
B) SOP logic.
C) NAND logic.
D) DeMorgan's theorem.
27)
28) A + A = ________.
28)
A) 1
B) 0
C) A
D) A
29) Which of the following is an example of DeMorgan's theorem?
A) A B = A + B
B) AB = A + B
C) AB = A B
30) The simplest form of X = (AB + AC)BC is ________.
A) X = A + B*C
C) = A*B*C + A*B*C
29)
D) A + B = A + B
30)
B) = A*C + B*C
D) ABC
31) X + Y = Y + X is an example of the
A) distributive law.
C) commutative law.
31)
B) conductive law.
D) associative law.
32) Which Boolean expression indicates an inverted gate output?
A) A + B
B) A + B
C) A + B
33) Anything ANDed with a 1 is equal to
A) 0.
C) itself.
32)
D) A + B
33)
B) 1.
D) its complement.
34) A NAND gate with all inputs tied to one signal functions as
A) an inverter.
B) an AND gate.
C) an OR gate.
D) a NOR gate.
35) A + 1 = ________.
A) 1
34)
35)
B) 0
C) A
3
D) A
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
A) a NOR gate.
B) an AND gate.
C) an OR gate.
D) an inverter.
38) Which Boolean equation expresses the commutative law?
37)
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?
A) X = ABC
B) X = (A + B)(C + D)
C) X = AB + CD
D) X = A + B + C
39)
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
A) 0.
C) itself.
41)
B) 1.
D) its complement.
42) The simplest form of X = AB + ABC + A(B + C) is ________.
A) X = AB + AC
B) X = AB + C
C) X = AB + AC + C
D) X = A
42)
43) A NOR gate with a bubble on one of its inputs is equivalent to
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?
A) 1
B) 2
C) 3
4
43)
D) 4
44)
45) Which Boolean equation expresses the associative law?
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.
45)
46) A + A = ________.
A) 1
46)
B) 0
C) A
D) A
47) Which Boolean equation results from this Karnaugh map?
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
A) an OR.
B) a NOR.
C) a NAND.
47)
D) an AND.
49) Which two-input gate will produce the final output of this Boolean expression?
X = AB + CD
A) OR
B) AND
C) NAND
48)
49)
D) NOR
50) An OR gate is equivalent to
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.
50)
51) How many two-input gates are needed to build the logic circuit represented by X = C(A+B)?
A) one
B) three
C) two
D) four
51)
52) Which law of Boolean Algebra is applied in this equation?
ABC + BC + A = BC(A + 1) + A
A) Commutative
B) Associative
C) Additive
52)
D) Distributive
53) A = ________.
A) 1
53)
B) 0
C) A
54) Which equation is in its simplest form?
D) A
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
A) inversion circles.
B) inversion bubbles.
C) connection dots.
D) input/output bubbles.
55)
56) Anything that is complemented twice is equal to
A) 0.
C) itself.
56)
B) 1.
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 ________.
A) X = B + AC
B) X = AB + AB
59) A NOR gate with its output inverted functions as
A) an AND gate.
B) an OR gate.
58)
C) X = AC + AB
D) X = AC
C) an inverter.
D) a NAND gate.
59)
60) In VHDL programming, a hyphen used to specify a ________ bit state.
A) 0
B) 1
C) high impedance
D) don't care
60)
61) A NOR gate with inverted inputs functions as
A) a NOR gate.
B) an AND gate.
61)
C) an OR gate.
D) a NAND gate.
62) A + 0 = ________.
A) 1
62)
B) 0
C) A
D) A
63) Which of the following is not a reason for Boolean simplification?
A) It uses fewer gates.
B) A Boolean expression is longer.
C) Reliability is increased.
D) Circuit cost is reduced.
63)
64) Anything ANDed with its own complement is equal to
A) 0.
B) 1.
C) itself.
D) its complement.
64)
65) An AND gate is equivalent to
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.
65)
66) How many NAND gates does it take to make an AND gate?
A) 1
B) 2
C) 3
D) 4
67) A + ABC + ABC + AC = ________.
A) AC
66)
67)
B) A + C
C) 1
6
D) A
68) A NOR gate with each input inverted functions as
A) an AND gate.
B) a NAND gate.
C) an OR gate.
D) an inverter.
68)
69) Which equation demonstrates the Commutative Law?
A) A(BC) = (AB)C
B) C + AB = AB + C
C) A + BC = AB + C
D) C + B + A = ABC
69)
70) Anything ANDed with itself is equal to
A) 0.
C) itself.
B) 1.
D) its complement.
70)
71) X(YZ) = (XY)Z is an example of the
A) commutative law.
C) distributive law.
B) associative law.
D) conductive law.
71)
72) Which answer is an example of a sum-of-products (SOP) expression?
A) X = (AB)(CD)
B) X = A + B
C) X = AB + AC
D) X = (A + B)(C + D)
72)
73) An AND with bubbles on its inputs is equivalent to
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.
73)
74) Which logic function accomplishes Boolean (logical) multiplication?
A) NOR
B) invert
C) AND
74)
D) OR
75) Which Boolean equation results from this Karnaugh map?
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
A) a NAND gate.
B) an AND gate.
C) a NOR gate.
77) Which logic function accomplishes Boolean (logical) addition?
A) OR
B) invert
C) NAND
7
75)
D) an OR gate.
D) AND
76)
77)
78) A · A = ________.
78)
C) A
D) A
79) How many NAND gates does it take to make a NOR gate?
A) 1
B) 2
C) 3
D) 4
A) 1
B) 0
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 = ________.
A) 1
81)
B) 0
C) A
D) A
82) An OR gate with one bubble on an input is equivalent to
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.
82)
83) A NAND gate with its output inverted functions as
A) an AND gate.
B) a NOR gate.
C) an inverter.
D) an OR gate.
84) An OR gate with inverted inputs functions as
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 ________.
A) X = A + AC
79)
83)
84)
85)
B) X = A B C
C) X = A B
86) How many NAND gates does it take to make an inverter?
A) 1
B) 2
C) 3
87) When entering a truth table in VHDL inputs are grouped together as
A) elements.
B) statements.
C) vectors.
D) X = A + B + C
D) 4
D) arrays.
88) Which Boolean equation results from this Karnaugh Map?
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
86)
87)
88)
89) The simplest form of X = A + AB + ABC is ________.
A) X = BC
B) X = ABC
89)
C) X = AB
9
D) X = A + B
Answer Key
Testname: CHAP05Q
1)
2)
3)
4)
5)
6)
7)
8)
9)
10)
11)
12)
13)
14)
15)
16)
17)
18)
19)
20)
21)
22)
23)
24)
25)
26)
27)
28)
29)
30)
31)
32)
33)
34)
35)
36)
37)
38)
39)
40)
41)
42)
43)
44)
45)
46)
47)
48)
49)
50)
D
B
C
B
D
A
A
A
C
C
D
B
C
C
B
D
A
D
D
D
C
C
D
B
A
A
B
A
B
D
C
C
C
A
A
D
C
C
B
B
C
D
E
C
A
C
A
D
A
B
10
Answer Key
Testname: CHAP05Q
51)
52)
53)
54)
55)
56)
57)
58)
59)
60)
61)
62)
63)
64)
65)
66)
67)
68)
69)
70)
71)
72)
73)
74)
75)
76)
77)
78)
79)
80)
81)
82)
83)
84)
85)
86)
87)
88)
89)
C
D
C
B
B
C
B
A
B
D
B
C
B
A
A
B
D
A
B
C
B
C
D
C
A
D
A
B
D
D
C
C
A
D
C
A
C
B
D
11