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
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)
