DE Quiz 1.1 2025 Reg no 1 -16

Name

Roll No

The systematic reduction of logic circuits is accomplished by:

• A. using Boolean algebra
• B. symbolic reduction
• C. TTL logic
• D. using a truth table

An AND gate with schematic "bubbles" on its inputs performs the same function as a________ gate.

• A. NOT
• B. OR
• C. NOR
• D. NAND

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

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

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

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

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

• A. 2s
• B. 1, 2, 4, 8, etc.
• C. 4s
• D. 3s

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