1

1. Convert the following SOP expression to an equivalent POS expression.
A.
B.
C.
D.
2. Determine the values of A, B, C, and D that make the sum term equal to zero.
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
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
4. Derive the Boolean expression for the logic circuit shown below:
A.
B.
C.
D.
5. From the truth table below, determine the standard SOP expression.
A.
B.
C.
D.
6. One of De Morgan's theorems states that . Simply stated, this means that logically there is no
difference between:
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
7. The commutative law of Boolean addition states that A + B = A × B.
A. True
B. False
View Answer Discuss in Forum Workspace Report
8. Applying DeMorgan's theorem to the expression , we get ________.

A.
B.
C.
D.
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
10. Which output expression might indicate a product-of-sums circuit construction?

A.
B.
C.
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
12. For the SOP expression , how many 1s are in the truth table's output column?
A. 1
B. 2
C. 3
D. 5
13. A truth table for the SOP expression has how many input combinations?
A. 1
B. 2
C. 4
D. 8
14. How many gates would be required to implement the following Boolean expression before simplification? XY
+ X(X + Z) + Y(X + Z)
A. 1
B. 2
C. 4
D. 5
15. Determine the values of A, B, C, and D that make the product term equal to 1.
A. A = 0, B = 1, C = 0, D = 1
B. A = 0, B = 0, C = 0, D = 1
C. A = 1, B = 1, C = 1, D = 1
D. A = 0, B = 0, C = 1, D = 0
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

17. How many gates would be required to implement the following Boolean expression after simplification? XY +
X(X + Z) + Y(X + Z)
A. 1
B. 2
C. 4
D. 5
18. AC + ABC = AC
A. True
B. False
19.
When are the inputs to a NAND gate, according to De Morgan's theorem, the output expression could
be:
A. X=A+B
B.
C. X = (A)(B)
D.
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
21.
Applying DeMorgan's theorem to the expression , we get ________
A.
B.
C.
D.
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
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
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

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

26. The truth table for the SOP expression has how many input combinations?
A. 1
B. 2
C. 4
D. 8
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
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

29. The Boolean expression is logically equivalent to what single gate?

A. NAND
B. NOR
C. AND
D. OR
30. Applying the distributive law to the expression , we get ________.

A.
B.
C.
D.
31. Mapping the SOP expression , we get ________.
A. (A)
B. (B)
C. (C)
D. (D)
32. Derive the Boolean expression for the logic circuit shown below:
A.
B.
C.
D.
33. Which is the correct logic function for this PAL diagram?
A.
B.
C.
D.
34. For the SOP expression , how many 0s are in the truth table's output column?
A. zero
B. 1
C. 4
D. 5
35. Mapping the standard SOP expression , we get

A. (A)
B. (B)
C. (C)
D. (D)
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.

A.
B.
C.
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

A.
B.
C.
D.
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.
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
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
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)
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

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
the factoring of Boolean expressions requires the multiplication of product terms that contain like
D.
variables
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
1. The Boolean expression C + CD is equal to ________.

A. C
B. D
C. C + D
D. 1
2. The Boolean expression for the logic circuit shown is _____.
A.
B.
C.
D.
3.
Applying DeMorgan's theorem and Boolean algebra to the expression results in ________.
A.
B.
C.
D.
4. The standard SOP form of the expression is ________.

A.
B.
C.
D.
5. Identify the Boolean expression that is in standard POS form.

A.
B.
C.
D. (A + B)(C + D)
6. The Boolean expression is equal to ________.
A. C
B. D
C. C + D
D. 1
7.
The Boolean expression can be reduced to ________.
A.
B.
C.
D.
8. Which of the following is true for a 5-variable Karnaugh map?

A. There is no such thing.
B. It can be used only with the aid of a computer.
C. It is made up of two 4-variable Karnaugh maps.
D. It is made up of a 2-variable and a 3-variable Karnaugh map.

9. When four 1s are taken as a group on a Karnaugh map, the number of variables eliminated from the output
expression is ________.
A. 1
B. 2
C. 3
D. 4
10. In Boolean algebra, the word "literal" means ________.

A. a product term
B. all the variables in a Boolean expression
C. the inverse function
D. a variable or its complement

1. A variable is a symbol used to represent a logical quantity that can have a value of 1 or 0.
A. True
B. False
2. The OR function is Boolean multiplication and the AND function is Boolean addition.
A. True
B. False
3. In Boolean algebra, A + 1 = 1.
A. True
B. False
4. The product-of-sums (POS) is basically the ORing of ANDed terms.

A. True
B. False
5. In Boolean algebra, = A.
A. True
B. False
6. SOP stands for sum-of-powers.
A. True
B. False
7. The VHDL editor provided with a schematic editor development system will produce a file with the extension
.vhd, which can be used by the simulator to test the output of the logic design.
A. True
B. False
8. In the commutative law, in ORing and ANDing of two variables, the order in which the variables are ORed or
ANDed makes no difference.
A. True
B. False
9. The binary value of 1010 is converted to the product term .

A. True
B. False
10. Most Boolean reductions result in an equation in only one form.

A. True
B. False
11. The symbol shown below is for a 2-input NAND gate.
A. True
B. False
12. A Karnaugh map is similar to a truth table because it presents all the possible values of input variables and
the resulting output of each value.
A. True
B. False
13. The process of reduction or simplification of combinational logic circuits increases the cost of the circuit.
A. True
B. False
14. By applying De Morgan's theorem to a NOR gate, two identical truth tables can be produced.
A. True
B. False
15. Five-variable Karnaugh maps are impossible.

A. True
B. False
16. If you need a NAND, an AND, and an inverter you would purchase a 7400 IC.
A. True
B. False
17. The systematic reduction of logic circuits is performed using Boolean algebra.
A. True
B. False
18. CPLD software can be used to design original circuits that prove the Boolean rules and laws.
A. True
B. False
19. A Karnaugh map is similar to a truth table.

A. True
B. False
20. Boolean algebra simplifies logic circuits.

A. True
B. False

1

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

1

Hochgeladen von

Copyright:

Verfügbare Formate

1. Convert the following SOP expression to an equivalent POS expression.

B. a NAND and an OR gate with inverted inputs

C. an AND and a NOR gate with inverted inputs

8. Applying DeMorgan's theorem to the expression , we get ________.

9. The systematic reduction of logic circuits is accomplished by:

D. using a truth table

10. Which output expression might indicate a product-of-sums circuit construction?

B. It may reduce the number of gates.

C. It may reduce the number of inputs required.

D. all of the above

B. spurious, ANDs, ORs, eliminate

C. duplicate, 1s, 0s, verify

D. spurious, 1s, 0s, simplify

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

28. A Karnaugh map is a systematic way of reducing which type of expression?

D. those with overbars

29. The Boolean expression is logically equivalent to what single gate?

30. Applying the distributive law to the expression , we get ________.

35. Mapping the standard SOP expression , we get

C. Variable complements can be eliminated by using Karnaugh maps.

37. Applying DeMorgan's theorem to the expression , we get ________.

39. Applying DeMorgan's theorem to the expression , we get ________.

B. The delay times are greatly reduced over other forms.

D. none of the above

45. The commutative law of addition and multiplication indicates that:

B. corners in the same column

1. The Boolean expression C + CD is equal to ________.

2. The Boolean expression for the logic circuit shown is _____.

4. The standard SOP form of the expression is ________.

5. Identify the Boolean expression that is in standard POS form.

8. Which of the following is true for a 5-variable Karnaugh map?

B. It can be used only with the aid of a computer.

C. It is made up of two 4-variable Karnaugh maps.

D. It is made up of a 2-variable and a 3-variable Karnaugh map.

10. In Boolean algebra, the word "literal" means ________.

B. all the variables in a Boolean expression

C. the inverse function

D. a variable or its complement

4. The product-of-sums (POS) is basically the ORing of ANDed terms.

9. The binary value of 1010 is converted to the product term .

10. Most Boolean reductions result in an equation in only one form.

15. Five-variable Karnaugh maps are impossible.

19. A Karnaugh map is similar to a truth table.

20. Boolean algebra simplifies logic circuits.

Das könnte Ihnen auch gefallen