Wednesday, 22 February 2017

Boolean Algebra Questions

Determine the values of A, B, C, and D that make the sum term  equal to zero.

A. A = 1, B = 0, C = 0, D = 0
B. A = 1, B = 0, C = 1, D = 0
C. A = 0, B = 1, C = 0, D = 0
D. A = 1, B = 0, C = 1, D = 1

Answer: B



Derive the Boolean expression for the logic circuit shown below:
A.
B.
C.
D.
Answer: A




One of De Morgan's theorems states that . Simply stated, this means that logically there is no difference between:

A. a NOR and an AND gate with inverted inputs
B. a NAND and an OR gate with inverted inputs
C. an AND and a NOR gate with inverted inputs
D. a NOR and a NAND gate with inverted inputs

Answer: A




The systematic reduction of logic circuits is accomplished by:

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

Answer: A


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

Answer: D


No comments:

Post a Comment