Boolean Algebra and Logic Simplification

1.
Convert the following SOP expression to an equivalent POS expression.
A.
B.
C.
D.
Answer: Option B
2.
Determine the values of A, B, C, and D that make the sum term
A.
A = 1, B = 0, C = 0, D = 0
B.
A = 1, B = 0, C = 1, D = 0
C.
A = 0, B = 1, C = 0, D = 0
D.
A = 1, B = 0, C = 1, D = 1
Answer: Option B
3.
Which of the following expressions is in the sum-of-products (SOP) form?
A.
(A + B)(C + D)
B.
(A)B(CD)
C.
AB(CD)
D.
AB + CD
equal to zero.
Answer: Option D
4.
Derive the Boolean expression for the logic circuit shown below:
A.
B.
C.
D.
Answer: Option A
5.
From the truth table below, determine the standard SOP expression.
A.
B.
C.
D.
Answer: Option D
6.
One of De Morgan's theorems states that
is no difference between:
. Simply stated, this means that logically there
A.
a NOR and an AND gate with inverted inputs
B.
a NAND and an OR gate with inverted inputs
C.
an AND and a NOR gate with inverted inputs
D.
a NOR and a NAND gate with inverted inputs
Answer: Option A
7.
The commutative law of Boolean addition states that A + B = A B.
A.
True
B.
False
Answer: Option B
8.
Applying DeMorgan's theorem to the expression
A.
B.
C.
D.
, we get ________.
Answer: Option A
9.
The systematic reduction of logic circuits is accomplished by:
A.
using Boolean algebra
B.
symbolic reduction
C.
TTL logic
D.
using a truth table
Answer: Option A
10.
Which output expression might indicate a product-of-sums circuit construction?
A.
B.
C.
D.
Answer: Option D
11.
An AND gate with schematic "bubbles" on its inputs performs the same function as a(n)________
gate.
A.
NOT
B.
OR
C.
NOR
D.
NAND
Answer: Option C
12.
For the SOP expression
, how many 1s are in the truth table's output column?
A.
B.
C.
D.
Answer: Option C
13.
A truth table for the SOP expression
has how many input combinations?
A.
B.
C.
D.
Answer: Option D
14.
How many gates would be required to implement the following Boolean expression before
simplification? XY + X(X + Z) + Y(X + Z)
A.
B.
C.
D.
Answer: Option D
15.
Determine the values of A, B, C, and D that make the product term
A.
A = 0, B = 1, C = 0, D = 1
B.
A = 0, B = 0, C = 0, D = 1
equal to 1.
C.
A = 1, B = 1, C = 1, D = 1
D.
A = 0, B = 0, C = 1, D = 0
Answer: Option A
16.
What is the primary motivation for using Boolean algebra to simplify logic expressions?
A.
It may make it easier to understand the overall function of the circuit.
B.
It may reduce the number of gates.
C.
It may reduce the number of inputs required.
D.
all of the above
Answer: Option D
17.
How many gates would be required to implement the following Boolean expression after
simplification? XY + X(X + Z) + Y(X + Z)
A.
B.
C.
D.
B.
False
Answer: Option B
18.
AC + ABC = AC
A.
True
Answer: Option A
19.
When
could be:
A.
are the inputs to a NAND gate, according to De Morgan's theorem, the output expression
X=A+B
B.
C.
X = (A)(B)
D.
Answer: Option A
20.
Which Boolean algebra property allows us to group operands in an expression in any order without
affecting the results of the operation [for example, A + B = B + A]?
A.
associative
B.
commutative
C.
Boolean
D.
distributive
Answer: Option B
21.
A.
B.
C.
D.
Answer: Option A
, we get ________
22.
When grouping cells within a K-map, the cells must be combined in groups of ________.
A.
2s
B.
1, 2, 4, 8, etc.
C.
4s
D.
3s
Answer: Option B
23.
Use Boolean algebra to find the most simplified SOP expression
for F = ABD + CD +ACD + ABC + ABCD.
A.
F = ABD + ABC + CD
B.
F = CD + AD
C.
F = BC + AB
D.
F = AC + AD
Answer: Option A
24.
Occasionally, a particular logic expression will be of no consequence in the operation of a circuit,
such as a BCD-to-decimal converter. These result in ________terms in the K-map and can be treated
as either ________ or ________, in order to ________ the resulting term.
A.
don't care, 1s, 0s, simplify
B.
spurious, ANDs, ORs, eliminate
C.
duplicate, 1s, 0s, verify
D.
spurious, 1s, 0s, simplify
Answer: Option A
25.
The NAND or NOR gates are referred to as "universal" gates because either:
A.
can be found in almost all digital circuits
B.
can be used to build all the other types of gates
C.
are used in all countries of the world
D.
were the first gates to be integrated
Answer: Option B
26.
The truth table for the SOP expression
has how many input combinations?
A.
B.
C.
D.
Answer: Option D
27.
Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________.
A.
LM + MNOPQ
B.
L + MNO + MPQ
C.
LM + M + NO + MPQ
D.
LM + MNO + MPQ
Answer: Option D
28.
A Karnaugh map is a systematic way of reducing which type of expression?
A.
product-of-sums
B.
exclusive NOR
C.
sum-of-products
D.
those with overbars
Answer: Option C
29.
The Boolean expression
is logically equivalent to what single gate?
A.
NAND
B.
NOR
C.
AND
D.
OR
Answer: Option A
30.
Applying the distributive law to the expression
, we get ________.
A.
B.
C.
D.
Answer: Option D
31.
Mapping the SOP expression
, we get ________.
A.
(A)
B.
(B)
C.
(C)
D.
(D)
Answer: Option B
32.
Derive the Boolean expression for the logic circuit shown below:
A.
B.
C.
D.
Answer: Option
33.
Which is the correct logic function for this PAL diagram?
A.
B.
C.
D.
Answer: Option C
34.
For the SOP expression
, how many 0s are in the truth table's output column?
A.
zero
B.
C.
D.
Answer: Option C
35.
Mapping the standard SOP expression
, we get
A.
(A)
B.
(B)
C.
(C)
D.
(D)
Answer: Option B
36.
Which statement below best describes a Karnaugh map?
A.
A Karnaugh map can be used to replace Boolean rules.
B.
The Karnaugh map eliminates the need for using NAND and NOR gates.
C.
Variable complements can be eliminated by using Karnaugh maps.
D.
Karnaugh maps provide a cookbook approach to simplifying Boolean expressions.
Answer: Option D
37.
, we get ________.
A.
B.
C.
D.
Answer: Option D
38.
Which of the examples below expresses the distributive law of Boolean algebra?
A.
(A + B) + C = A + (B + C)
B.
A(B + C) = AB + AC
C.
A + (B + C) = AB + AC
D.
A(BC) = (AB) + C
Answer: Option B
39.
, we get ________.
A.
B.
C.
D.
Answer: Option A
40.
Which of the following is an important feature of the sum-of-products (SOP) form of expression?
A.
All logic circuits are reduced to nothing more than simple AND and OR gates.
B.
The delay times are greatly reduced over other forms.
C.
No signal must pass through more than two gates, not including inverters.
D.
The maximum number of gates that any signal must pass through is reduced by a factor of
two.
Answer: Option C
41.
An OR gate with schematic "bubbles" on its inputs performs the same functions as a(n)________
gate.
A.
NOR
B.
OR
C.
NOT
D.
NAND
Answer: Option D
42.
Which of the examples below expresses the commutative law of multiplication?
A.
A+B=B+A
B.
AB = B + A
C.
AB = BA
D.
AB = A B
Answer: Option C
43.
Determine the binary values of the variables for which the following standard POS expression is
equal to 0.
A.
(0 + 1 + 0)(1 + 0 + 1)
B.
(1 + 1 + 1)(0 + 0 + 0)
C.
(0 + 0 + 0)(1 + 0 + 1)
D.
(1 + 1 + 0)(1 + 0 + 0)
Answer: Option A
44.
The expression W(X + YZ) can be converted to SOP form by applying which law?
A.
associative law
B.
commutative law
C.
distributive law
D.
none of the above
Answer: Option C
45.
The commutative law of addition and multiplication indicates that:
A.
we can group variables in an AND or in an OR any way we want
B.
an expression can be expanded by multiplying term by term just the same as in ordinary
algebra
C.
the way we OR or AND two variables is unimportant because the result is the same
D.
the factoring of Boolean expressions requires the multiplication of product terms that
contain like variables
Answer: Option C
46.
Which of the following combinations cannot be combined into K-map groups?
A.
corners in the same row
B.
corners in the same column
C.
diagonal
D.
overlapping combinations
Answer: Option C

Boolean Algebra and Logic Simplification

Uploaded by

Copyright:

Available Formats

Boolean Algebra and Logic Simplification

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Boolean Algebra and Logic Simplification

Uploaded by

Copyright:

Available Formats

1.

Convert the following SOP expression to an equivalent POS expression.

. Simply stated, this means that logically there

a NOR and an AND gate with inverted inputs

a NAND and an OR gate with inverted inputs

an AND and a NOR gate with inverted inputs

a NOR and a NAND gate with inverted inputs

using Boolean algebra

using a truth table

, how many 1s are in the truth table's output column?

has how many input combinations?

It may make it easier to understand the overall function of the circuit.

It may reduce the number of gates.

It may reduce the number of inputs required.

all of the above

don't care, 1s, 0s, simplify

spurious, ANDs, ORs, eliminate

duplicate, 1s, 0s, verify

spurious, 1s, 0s, simplify

can be found in almost all digital circuits

can be used to build all the other types of gates

are used in all countries of the world

were the first gates to be integrated

has how many input combinations?

those with overbars

is logically equivalent to what single gate?

, how many 0s are in the truth table's output column?

A Karnaugh map can be used to replace Boolean rules.

Variable complements can be eliminated by using Karnaugh maps.

Karnaugh maps provide a cookbook approach to simplifying Boolean expressions.

The delay times are greatly reduced over other forms.

none of the above

we can group variables in an AND or in an OR any way we want

corners in the same row

corners in the same column

You might also like