Q.1

A variable is a symbol used to represent a logical quantity that can have a value of 1 or 0.

  • True
  • False
Q.2

The Boolean expression C + CD is equal to ________.

  • C
  • D
  • C + D
  • 1
Q.3

The OR function is Boolean multiplication and the AND function is Boolean addition.

  • True
  • False
Q.4

In Boolean algebra, A + 1 = 1.

  • True
  • False
Q.5

The product-of-sums (POS) is basically the ORing of ANDed terms.

  • True
  • False
Q.6

Which of the following is true for a 5-variable Karnaugh map?

  • There is no such thing.
  • It can be used only with the aid of a computer.
  • It is made up of two 4-variable Karnaugh maps.
  • It is made up of a 2-variable and a 3-variable Karnaugh map.
Q.7

An OR gate with schematic "bubbles" on its inputs performs the same functions as a(n)________ gate.

  • NOR
  • OR
  • NOT
  • NAND
Q.8

An AND gate with schematic "bubbles" on its inputs performs the same function as a(n)________ gate.

  • NOT
  • OR
  • NOR
  • NAND
Q.9

Which of the following expressions is in the sum-of-products (SOP) form?

  • (A + B)(C + D)
  • (A)B(CD)
  • AB(CD)
  • AB + CD
Q.10

When four 1s are taken as a group on a Karnaugh map, the number of variables eliminated from the output expression is ________.

  • 1
  • 2
  • 3
  • 4
Q.11

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

  • A + B = B + A
  • AB = B + A
  • AB = BA
  • AB = A × B
Q.12

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

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

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

  • True
  • False
Q.14

In Boolean algebra, the word "literal" means ________.

  • a product term
  • all the variables in a Boolean expression
  • the inverse function
  • a variable or its complement
Q.15

Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD + ACD + ABC + ABCD.

  • F = ABD + ABC + CD
  • F = CD + AD
  • F = BC + AB
  • F = AC + AD
Q.16

In Boolean algebra, the word "literal" means ________.

  • a product term
  • all the variables in a Boolean expression
  • the inverse function
  • a variable or its complement
Q.17

The expression W(X + YZ) can be converted to SOP form by applying which law?

  • associative law
  • commutative law
  • distributive law
  • none of the above
Q.18

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

  • 1
  • 2
  • 4
  • 5
Q.19

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.

  • don't care, 1s, 0s, simplify
  • spurious, ANDs, ORs, eliminate
  • duplicate, 1s, 0s, verify
  • spurious, 1s, 0s, simplify
Q.20

The systematic reduction of logic circuits is accomplished by:

  • using Boolean algebra
  • symbolic reduction
  • TTL logic
  • using a truth table
0 h : 0 m : 1 s