Multiple Choice Identify the
choice that best completes the statement or answers the question.
|
|
1.
|
Which logic function
accomplishes Boolean (logical) addition?
|
|
2.
|
Which logic function
accomplishes Boolean (logical) multiplication?
|
|
3.
|
Which Boolean equation
expresses the commutative law?
a. | AB = BA | c. | A + (B + C) = (A + B) +
C | b. | AB = | d. | AB + AC = A(B +
C) |
|
|
4.
|
AB + AC = A(B + C) is an
example of the
a. | conductive
law. | c. | associative
law. | b. | commutative law. | d. | distributive law. |
|
|
5.
|
How many two-input gates are
needed to build the equivalent circuit for X = ABCD?
|
|
6.
|
Which two-input gate will
produce the final output of this Boolean expression? X = + CD
|
|
7.
|
A · 1 =
________.
a. | 1 | c. | A | b. | 0 | d. | |
|
|
8.
|
A + 1 =
________.
a. | 1 | c. | A | b. | 0 | d. | |
|
|
9.
|
A + 0 =
________.
a. | 1 | c. | A | b. | 0 | d. | |
|
|
10.
|
A · A =
________.
a. | 1 | c. | A | b. | 0 | d. | |
|
|
11.
|
A + A =
________.
a. | 1 | c. | A | b. | 0 | d. | |
|
|
12.
|
A ·
= ________.
a. | 1 | c. | A | b. | 0 | d. | |
|
|
13.
|
A + =
________.
a. | 1 | c. | A | b. | 0 | d. | |
|
|
14.
|
=
________.
a. | 1 | c. | A | b. | 0 | d. | |
|
|
15.
|
A + B =
________.
a. | AB | c. | A + B | b. | B | d. | +
B |
|
|
16.
|
+ AB =
________.
a. | +
B | c. | A +
B | b. | AB | d. | B |
|
|
17.
|
Which equation demonstrates the
Commutative Law?
a. | C + AB = AB +
C | c. | C + B + A =
ABC | b. | A(BC) = (AB)C | d. | A + BC = AB + C |
|
|
18.
|
Which equation demonstrates the
Distributive Law?
a. | BC + A = A +
BC | c. | AB + AC = AB +
C | b. | BC + A =
ABC | d. | BA + CA = A(B +
C) |
|
|
19.
|
The simplest form of X = A(B +
C) + C is ________.
a. | X = AB + AC +
C | c. | X = AB +
C | b. | X = AB +
AC | d. | X = A + B +
C |
|
|
20.
|
The simplest form of X = A(B +
C) + AC is ________.
a. | X = AB +
AC | c. | X = B +
AC | b. | X = A +
AC | d. | X = AB + BC |
|
|
21.
|
The simplest form of X = AC +
(A + B) is ________.
a. | X = AC + B | c. | X = A + B | b. | X = AC + B | d. | X = +
AC |
|
|
22.
|
The simplest form of X = is ________.
|
|
23.
|
What is the simplest form of X
= AB + A + BC?
a. | X = AB +
C | c. | X = B +
C | b. | X = A +
BC | d. | It is in its simplest
form. |
|
|
24.
|
The simplest form of X = ( + )BC is ________.
a. | = + A*B* | c. | BC | b. | = + B*C | d. | X = +
B*C |
|
|
25.
|
Which of the following is an
example of DeMorgan's theorem?
|
|
26.
|
By using DeMorgan's
theorem, X = is simplified to
________.
a. | X = A(B + ) | c. | X = A + B + | b. | X = AB | d. | X = A + B |
|
|
27.
|
Which equation is in its
simplest form?
a. | (A + B)C + BC =
X | c. | ABC + AC =
X | b. | AB + AC + C =
X | d. | ABC + =
X |
|
|
28.
|
Which step in this reduction
series is based on DeMorgan's Theorem?
X = () STEP 1 X = (
+ )()
STEP 2 X = +
STEP 3 X = ( +
1)
STEP
4 X =
a. | STEP 1 | c. | STEP 3 | b. | STEP 2 | d. | STEP 4 |
|
|
29.
|
An OR gate with inverted inputs
functions as
a. | an AND
gate. | c. | a NOR
gate. | b. | an inverter. | d. | a NAND gate. |
|
|
30.
|
An AND gate with inverted
inputs functions as
a. | a NAND
gate. | c. | an OR
gate. | b. | an inverter. | d. | a NOR gate. |
|
|
31.
|
A NAND gate with inverted
inputs functions as
a. | a NAND
gate. | c. | a NOR
gate. | b. | an OR gate. | d. | an AND gate. |
|
|
32.
|
A NOR gate with inverted inputs
functions as
a. | an OR
gate. | c. | a NOR
gate. | b. | a NAND gate. | d. | an AND gate. |
|
|
33.
|
A NAND gate with all inputs
tied to one signal functions as
a. | an OR
gate. | c. | a NOR
gate. | b. | an AND gate. | d. | an inverter. |
|
|
34.
|
The final output of a
product-of-sum (POS) circuit is generated by
a. | an AND. | c. | an OR. | b. | a NOR. | d. | a NAND. |
|
|
35.
|
The final output of a
sum-of-products (SOP) circuit is generated by
a. | a NOR. | c. | a NAND. | b. | an AND. | d. | an OR. |
|
|
36.
|
Which Boolean equation results
from this Karnaugh map?
|
|
37.
|
Which Boolean equation results
from this Karnaugh map?
a. | ( ) + (C) + (BC) | c. | (AB) + (C) | b. | (ABC) + | d. | (A) +
C |
|
|
38.
|
Which Boolean equation results
from this Karnaugh Map?
|
|
39.
|
A NOR gate with all inputs tied
to one signal functions as
a. | an
inverter. | c. | an AND
gate. | b. | a NAND gate. | d. | an OR gate. |
|
|
40.
|
Anything ANDed with a 0 is
equal to
a. | 0. | c. | itself. | b. | 1. | d. | its complement. |
|
|
41.
|
Anything ORed with a 0 is equal
to
a. | 0. | c. | itself. | b. | 1. | d. | its complement. |
|
|
42.
|
Anything ANDed with a 1 is
equal to
a. | 0. | c. | itself. | b. | 1. | d. | its complement. |
|
|
43.
|
Anything ORed with a 1 is equal
to
a. | 0. | c. | itself. | b. | 1. | d. | its complement. |
|
|
44.
|
Anything ANDed with itself is
equal to
a. | 0. | c. | itself. | b. | 1. | d. | its complement. |
|
|
45.
|
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. |
|
|
46.
|
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. |
|
|
47.
|
How many NAND gates does it
take to make an AND gate?
|
|
48.
|
How many NAND gates does it
take to make an OR gate?
|
|
49.
|
A + ABC + A
+ A = ________.
a. | A + | c. | A | b. | 1 | d. | A |
|