Q.1

Each "1" entry in a K-map square represents ______________.

  • a HIGH output on the truth table for all input combinations
  • a LOW output for all possible HIGH input conditions
  • a DON'T CARE condition for all possible input truth table combinations
  • a HIGH for each input truth table condition that produces a HIGH output
Q.2

One reason for using the sum-of-products form is that it can be implemented using all ______ gates without much alteration.

  • AND
  • NAND
  • OR
  • NOR
Q.3

When grouping cells within a K-map, the cells must be combined in groups of ________.

  • 2s
  • 1, 2, 4, 8, etc.
  • 4s
  • 3s
Q.4

The associative law of addition states that A + (B + C) = (A + B) + C.

  • True
  • False
Q.5

Subtraction is commutative.

  • True
  • False
Q.6

The application of Boolean algebra to the solution of digital logic circuits was first explored by ________ of ________.

  • Claude Shannon, MIT
  • George Boole, MIT
  • George Boole, Stanford
  • Claude Shannon, IBM
Q.7

A Karnaugh map will ____________________.

  • eliminate the need for tedious Boolean expressions
  • allow any circuit to be implemented with just AND and OR gates
  • produce the simplest sum-of-products expression
  • give an overall picture of how the signals flow through the logic circuit
Q.8

The application of DeMorgan's theorems to a Boolean expression with double and single inversions produces a resultant expression that contains only single inverter signs over single variables.

  • True
  • False
Q.9

The sum-of-products form is a Boolean expression that describes the ANDing of two or more OR functions.

  • True
  • False
Q.10

The Boolean expression for a three-input AND gate is Y = A • B + C.

  • True
  • False
Q.11

The double-inversion rule states that if a variable is inverted twice, then the variable will be back to its original state.

  • True
  • False
Q.12

According to the commutative law, in ORing and ANDing of two variables, the order in which the variables are ORed or ANDed makes no difference.

  • True
  • False
Q.13

Boolean multiplication is symbolized by A + B.

  • True
  • False
Q.14

The double-inversion rule states that if a variable is inverted twice, then the variable will be back to its original state.

  • True
  • False
Q.15

Boolean multiplication is symbolized by A + B.

  • True
  • False
Q.16

Logically, the output of a NOR gate would have the same Boolean expression as a(n):

  • NAND gate immediately followed by an INVERTER
  • OR gate immediately followed by an INVERTER
  • AND gate immediately followed by an INVERTER
  • NOR gate immediately followed by an INVERTER
Q.17

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

  • A • (B • C) = (A • B) + C
  • A + (B + C) = (A • B) + (A • C)
  • A • (B + C) = (A • B) + (A • C)
  • (A + B) + C = A + (B + C)
Q.18

Which statement below best describes a Karnaugh map?

  • It is simply a rearranged truth table.
  • The Karnaugh map eliminates the need for using NAND and NOR gates.
  • Variable complements can be eliminated by using Karnaugh maps.
  • A Karnaugh map can be used to replace Boolean rules.
Q.19

Which of the examples below expresses the commutative law of multiplication?

  • A + B = B + A
  • A • B = B + A
  • A • (B • C) = (A • B) • C
  • A • B = B • A
Q.20

The commutative law of addition and multiplication indicates that:

  • the way we OR or AND two variables is unimportant because the result is the same
  • 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 factoring of Boolean expressions requires the multiplication of product terms that contain like variables
0 h : 0 m : 1 s