Sie sind auf Seite 1von 19

1.

Convert the following SOP expression to an equivalent POS expression.

A.

B.

C.

D.
Answer & Explanation

Answer: Option B Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 2.

Determine the values of A, B, C, and D that make the sum term A. B. C. D. A = 1, B = 0, C = 0, D = 0 A = 1, B = 0, C = 1, D = 0 A = 0, B = 1, C = 0, D = 0 A = 1, B = 0, C = 1, D = 1

equal to zero.

Answer & Explanation

Answer: Option B Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

3.

Which of the following expressions is in the sum-of-products (SOP) form? A. B. (A + B)(C + D) (A)B(CD)

C. D.

AB(CD) AB + CD

Answer & Explanation

Answer: Option D Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

4.

Derive the Boolean expression for the logic circuit shown below:

A.

B.

C.

D.
Answer & Explanation

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

5.

From the truth table below, determine the standard SOP expression.

A. B. C.

D.
Answer & Explanation

Answer: Option D Explanation: 6. One of De Morgan's theorems states that there is no difference between: A. B. C. D. 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 . Simply stated, this means that logically

Answer & Explanation

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 7.

The commutative law of Boolean addition states that A + B = A B. A. True B. False

Answer & Explanation

Answer: Option B Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

8.

Applying DeMorgan's theorem to the expression A.

, we get ________.

B.

C.

D.
Answer & Explanation

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

9.

The systematic reduction of logic circuits is accomplished by: A. B. C. D. using Boolean algebra symbolic reduction TTL logic using a truth table

Answer & Explanation

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

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

B.

C.

D.
Answer & Explanation

Answer: Option C Explanation: 11. An AND gate with schematic "bubbles" on its inputs performs the same function as a(n)________ gate. A. C. NOT NOR B. D. OR NAND

Answer & Explanation

Answer: Option C Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 12.

For the SOP expression column? A. C. 1 3

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

B. D.

2 5

Answer & Explanation

Answer: Option C Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

13.

A truth table for the SOP expression A. C. 1 4 B. D. 2 8

has how many input combinations?

Answer & Explanation

Answer: Option D Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

14. How many gates would be required to implement the following Boolean expression before simplification? XY + X(X + Z) + Y(X + Z) A. C. 1 4 B. D. 2 5

Answer & Explanation

Answer: Option D Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

15.

Determine the values of A, B, C, and D that make the product term A. B. C. D. A = 0, B = 1, C = 0, D = 1 A = 0, B = 0, C = 0, D = 1 A = 1, B = 1, C = 1, D = 1 A = 0, B = 0, C = 1, D = 0

equal to 1.

Answer & Explanation

Answer: Option A Explanation: 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. C. D.

It may reduce the number of gates. It may reduce the number of inputs required. all of the above

Answer & Explanation

Answer: Option D Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 17. How many gates would be required to implement the following Boolean expression after simplification? XY + X(X + Z) + Y(X + Z) A. C. 1 4 B. D. 2 5

Answer & Explanation

Answer: Option B Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

18. AC + ABC = AC A. True B. False

Answer & Explanation

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

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. D.
Answer & Explanation

X = (A)(B)

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

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. C. associative Boolean B. D. commutative distributive

Answer & Explanation

Answer: Option B Explanation: 21. Applying DeMorgan's theorem to the expression A. , we get ________

B.

C.

D.
Answer & Explanation

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

22. When grouping cells within a K-map, the cells must be combined in groups of ________. A. B. C. D. 2s 1, 2, 4, 8, etc. 4s 3s

Answer & Explanation

Answer: Option B Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

23. Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD +ACD + ABC + ABCD. A. B. C. D. F = ABD + ABC + CD F = CD + AD F = BC + AB F = AC + AD

Answer & Explanation

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

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. B. C. don't care, 1s, 0s, simplify spurious, ANDs, ORs, eliminate duplicate, 1s, 0s, verify

D.

spurious, 1s, 0s, simplify

Answer & Explanation

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

25.

The NAND or NOR gates are referred to as "universal" gates because either: A. B. C. D. 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

Answer & Explanation

Answer: Option B Explanation: No answer description available for this question. Let us discuss. 26. The truth table for the SOP expression combinations? A. C. 1 4 B. D. 2 8 has how many input

Answer & Explanation

Answer: Option D Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 27. Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________. A. LM + MNOPQ

B. C. D.

L + MNO + MPQ LM + M + NO + MPQ LM + MNO + MPQ

Answer & Explanation

Answer: Option D Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 28. A Karnaugh map is a systematic way of reducing which type of expression? A. B. C. D. product-of-sums exclusive NOR sum-of-products those with overbars

Answer & Explanation

Answer: Option C Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 29.

The Boolean expression single gate? A. C. NAND AND

is logically equivalent to what

B. D.

NOR OR

Answer & Explanation

Answer: Option A Explanation:

No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 30.

Applying the distributive law to the expression ________. A. B. C. D.


Answer & Explanation

, we get

Answer: Option D 31. Mapping the SOP expression , we get ________.

A. C.

(A) (C)

B. D.

(B) (D)

Answer & Explanation

Answer: Option B Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 32. Derive the Boolean expression for the logic circuit shown below:

A.

B.

C. D.
Answer & Explanation

Answer: Option C Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

33. Which is the correct logic function for this PAL diagram?

A.

B.

C. D.
Answer & Explanation

Answer: Option C Explanation:

No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

34.

For the SOP expression A. C. zero 4

, how many 0s are in the truth table's output column? B. D. 1 5

Answer & Explanation

Answer: Option C Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

35.

Mapping the standard SOP expression

, we get

A. C.

(A) (C)

B. D.

(B) (D)

Answer & Explanation

Answer: Option B 36. Which statement below best describes a Karnaugh map?

A. B. C. D.

A Karnaugh map can be used to replace Boolean rules. The Karnaugh map eliminates the need for using NAND and NOR gates. Variable complements can be eliminated by using Karnaugh maps. Karnaugh maps provide a cookbook approach to simplifying Boolean expressions.

Answer & Explanation

Answer: Option D Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 37.

Applying DeMorgan's theorem to the expression A.

, we get ________.

B.

C.

D.
Answer & Explanation

Answer: Option D Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

38. Which of the examples below expresses the distributive law of Boolean algebra? A. B. C. D. (A + B) + C = A + (B + C) A(B + C) = AB + AC A + (B + C) = AB + AC A(BC) = (AB) + C

Answer & Explanation

Answer: Option B Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

39.

Applying DeMorgan's theorem to the expression A.

, we get ________.

B.

C.

D.
Answer & Explanation

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

40. Which of the following is an important feature of the sum-of-products (SOP) form of expression? A. B. C. All logic circuits are reduced to nothing more than simple AND and OR gates. The delay times are greatly reduced over other forms. No signal must pass through more than two gates, not including inverters. The maximum number of gates that any signal must pass through is reduced by a factor of two.

D.

Answer & Explanation

Answer: Option C Explanation: No answer description available for this question. Let us discuss.

41. Use the rules of Boolean algebra to reduce the Boolean expression in problem 10. A. B. C.
Answer & Explanation

Y=B+C Y=AB+C

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 42. An OR gate with schematic "bubbles" on its inputs performs the same functions as a(n)________ gate. A. C. NOR NOT B. D. OR NAND

Answer & Explanation

Answer: Option D Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

43. Which of the examples below expresses the commutative law of multiplication? A. B. C. D. A+B=B+A AB = B + A AB = BA AB = A B

Answer & Explanation

Answer: Option C Explanation:

No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

44. Determine the binary values of the variables for which the following standard POS expression is equal to 0. A. B. C. D. (0 + 1 + 0)(1 + 0 + 1) (1 + 1 + 1)(0 + 0 + 0) (0 + 0 + 0)(1 + 0 + 1) (1 + 1 + 0)(1 + 0 + 0)

Answer & Explanation

Answer: Option A Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum

45. The expression W(X + YZ) can be converted to SOP form by applying which law? A. B. C. D. associative law commutative law distributive law none of the above

Answer & Explanation

Answer: Option C Explanation: 46. 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 an expression can be expanded by multiplying term by term just the same as in ordinary algebra the way we OR or AND two variables is unimportant because the result is the same

B.

C.

D.

the factoring of Boolean expressions requires the multiplication of product terms that contain like variables

Answer & Explanation

Answer: Option C Explanation: No answer description available for this question. Let us discuss. View Answer Workspace Report Discuss in Forum 47. Which of the following combinations cannot be combined into K-map groups? A. B. C. D. corners in the same row corners in the same column diagonal overlapping combinations

Answer & Explanation

Answer: Option C Explanation: No answer description availa

Das könnte Ihnen auch gefallen