# Boolean Algebra and Logic Simplification

mcqspedia.com has 15 Question/Answers about Topic Boolean Algebra and Logic Simplification

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

- A. NOR
- B. OR
- C. NOT
- D. NAND
- Correct Answer: Option D

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

- A. corners in the same row
- B. corners in the same column
- C. diagonal
- D. overlapping combinations
- Correct Answer: Option C

## 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. don't care, 1s, 0s, simplify
- B. spurious, ANDs, ORs, eliminate
- C. duplicate, 1s, 0s, verify
- D. spurious, 1s, 0s, simplify
- Correct Answer: Option A

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

- A. product-of-sums
- B. exclusive NOR
- C. sum-of-products
- D. those with overbars
- Correct Answer: Option C

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

- A. F = ABD + ABC + CD
- B. F = CD + AD
- C. F = BC + AB
- D. F = AC + AD
- Correct Answer: Option A

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

- A. All logic circuits are reduced to nothing more than simple AND and OR gates.
- B. The delay times are greatly reduced over other forms.
- C. No signal must pass through more than two gates, not including inverters.
- D. The maximum number of gates that any signal must pass through is reduced by a factor of two.
- Correct Answer: Option C

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

- A. (A + B)(C + D)
- B. (A)B(CD)
- C. AB(CD)
- D. AB + CD
- Correct Answer: Option D

## The NAND or NOR gates are referred to as “universal” gates because either:

- A. can be found in almost all digital circuits
- B. can be used to build all the other types of gates
- C. are used in all countries of the world
- D. were the first gates to be integrated
- Correct Answer: Option B

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

- A. NOT
- B. OR
- C. NOR
- D. NAND
- Correct Answer: Option C

## 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. It may reduce the number of gates.
- C. It may reduce the number of inputs required.
- D. all of the above
- Correct Answer: Option D

## 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
- B. commutative
- C. Boolean
- D. distributive
- Correct Answer: Option B

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

- A. LM + MNOPQ
- B. L + MNO + MPQ
- C. LM + M + NO + MPQ
- D. LM + MNO + MPQ
- Correct Answer: Option D

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

- A. associative law
- B. commutative law
- C. distributive law
- D. none of the above
- Correct Answer: Option C

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

- A. 1
- B. 2
- C. 4
- D. 5
- Correct Answer: Option B

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

- A. 1
- B. 2
- C. 4
- D. 5
- Correct Answer: Option D