Q.1

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

Q.2

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

  • 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
Q.3

Mapping the standard SOP expression , we get

  • (A)
  • (B)
  • (C)
  • (D)
Q.4

Mapping the standard SOP expression , we get

  • (A)
  • (B)
  • (C)
  • (D)
Q.5

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

Q.6

Which of the following combinations cannot be combined into K-map groups?

  • corners in the same row
  • corners in the same column
  • diagonal
  • overlapping combinations
Q.7

What is the primary motivation for using Boolean algebra to simplify logic expressions?

  • 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
Q.8

Which statement below best describes a Karnaugh map?

  • 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.
Q.9

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

  • LM + MNOPQ
  • L + MNO + MPQ
  • LM + M + NO + MPQ
  • LM + MNO + MPQ
Q.10

How many gates would be required to implement the following Boolean expression after simplification? XY + X(X + Z) + Y(X + Z)

  • 1
  • 2
  • 4
  • 5
Q.11

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

  • product-of-sums
  • exclusive NOR
  • sum-of-products
  • those with overbars
Q.12

AC + ABC = AC

  • True
  • False
Q.13

Which of the examples below expresses the distributive law of Boolean algebra?

  • (A + B) + C = A + (B + C)
  • A(B + C) = AB + AC
  • A + (B + C) = AB + AC
  • A(BC) = (AB) + C
Q.14

Which of the following is an important feature of the sum-of-products (SOP) form of expression?

  • 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.
Q.15

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]?

  • associative
  • commutative
  • Boolean
  • distributive
Q.16

If you need a NAND, an AND, and an inverter you would purchase a 7400 IC.

  • True
  • False
Q.17

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

Q.18

The systematic reduction of logic circuits is performed using Boolean algebra.

  • True
  • False
Q.19

SOP stands for sum-of-powers.

  • True
  • False
Q.20

CPLD software can be used to design original circuits that prove the Boolean rules and laws.

  • True
  • False
0 h : 0 m : 1 s