Scribd
Upload
137 views6 pages

Ece30 QZ 1

The document contains questions about Boolean algebra and logic circuits. It asks the reader to: 1) Convert an SOP expression to POS form and determine input values to make a sum term equal to zero. 2) Identify which expression is in SOP form and derive the Boolean expression for a logic circuit. 3) Determine the standard SOP expression from a truth table. 4) Identify one of De Morgan's theorems and apply it to an expression.

Uploaded by

Dyan Faye
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
137 views6 pages

Ece30 QZ 1

The document contains questions about Boolean algebra and logic circuits. It asks the reader to: 1) Convert an SOP expression to POS form and determine input values to make a sum term equal to zero. 2) Identify which expression is in SOP form and derive the Boolean expression for a logic circuit. 3) Determine the standard SOP expression from a truth table. 4) Identify one of De Morgan's theorems and apply it to an expression.

Uploaded by

Dyan Faye
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

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 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 (A + B)(C + D) (A)B(CD) AB(CD) AB + CD

equal to zero.

3.

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

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 between: A. B. C. D. 7. 8. A. . Simply stated, this means that logically there is no difference

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 True B. False

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

Applying DeMorgan's theorem to the expression A. B. C. D.

, we get ________.

9.

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

A. B. C. D. 10. The systematic reduction of logic circuits is accomplished by: A. B. C. D. 11. A. B. C. D. 12. An AND gate with schematic "bubbles" on its inputs performs the same function as a(n)________ gate. A. C. 13. NOT NOR B. D. OR NAND using Boolean algebra symbolic reduction TTL logic using a truth table

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

For the SOP expression A. C. 1 3

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

14.

A truth table for the SOP expression A. C. 1 4

has how many input combinations? B. D. 2 8

15.

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

16.

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.

17.

What is the primary motivation for using Boolean algebra to simplify logic expressions? A. B. C. D. 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

18.

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 True B. D. B. 2 5 False

19. 20.

AC + ABC = AC A. When A. B. C. D. X = (A)(B)

are the inputs to a NAND gate, according to De Morgan's theorem, the output expression could be: X=A+B

21. 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 C. Boolean 22. Applying DeMorgan's theorem to the expression A. B. C. D. 23. 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 , we get ________ B. commutative D. distributive

24.

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

25.

Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as a BCDto-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. D. 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? B. D. 2 8

26.

The NAND or NOR gates are referred to as "universal" gates because either: A. B. C. D.

27.

The truth table for the SOP expression A. C. 1 4 LM + MNOPQ L + MNO + MPQ LM + M + NO + MPQ LM + MNO + MPQ product-of-sums exclusive NOR sum-of-products those with overbars

28.

Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________. A. B. C. D.

29.

A Karnaugh map is a systematic way of reducing which type of expression? A. B. C. D.

30.

The Boolean expression A. C. NAND AND

is logically equivalent to what single gate? B. D. NOR OR

31.

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

, we get ________.

32.

32. Mapping the SOP expression

, we get ________.

A. C. 33.

(A) (C)

B. D.

(B) (D)

Derive the Boolean expression for the logic circuit shown below:

A. B. C. D.

You might also like