Digital Electronics-Boolean Algebra and Logic Simplification
Digital Electronics-Boolean Algebra and Logic Simplification
1. Determine the values of A, B, C, and D that make the sum term equal to zero.
- 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
2. Which of the following expressions is in the sum-of-products (SOP) form?
- (A + B)(C + D)
- (A)B(CD)
- AB(CD)
- AB + CD
4. The systematic reduction of logic circuits is accomplished by:
- using Boolean algebra
- symbolic reduction
- TTL logic
- using a truth table
5. An AND gate with schematic "bubbles" on its inputs performs the same function as a(n)________ gate.
- NOT
- OR
- NOR
- NAND
6. Determine the values of A, B, C, and D that make the product term equal to
- 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
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
8. 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
9. 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
10. When grouping cells within a K-map, the cells must be combined in groups of ________.
- 2s
- 1, 2, 4, 8, etc.
- 4s
- 3s