lOMoARcPSD|51086353

MCQs Chapter 2 - Multiple Choice Questions for Boolean

Algebra and Logic Gates
logical design (‫)ةيمالسإلا ةعماجلا‬

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university

Downloaded by Ahmed Nagi ([email protected])
 lOMoARcPSD|51086353

Multiple Choice Questions For Chapter #2

1. In boolean algebra, the OR operation is performed by which properties?
a) Associative properties
b) Commutative properties
c) Distributive properties
d) All of the Mentioned
2. The expression for Absorption law is given by _________
a) A + AB = A
b) A + AB = B
c) AB + AA’ = A
d) A + B = B + A
3. The involution of A is equal to _________
a) A
b) A’
c) 1
d) 0
4. A(A + B) = ?
a) AB
b) 1
c) (1 + AB)
d) A
5. (A + B)(A’ * B’) = ?
a) 1
b) 0
c) AB
d) AB’
6. Complement of the expression A’B + CD’ is _________
a) (A’ + B)(C’ + D)
b) (A + B’)(C’ + D)
c) (A’ + B)(C’ + D)
d) (A + B’)(C + D’)
7. Simplify Y = AB’ + (A’ + B)C.
a) AB’ + C
b) AB + AC
c) A’B + AC’
d) AB + A

Downloaded by Ahmed Nagi ([email protected])

 lOMoARcPSD|51086353

8. The boolean function A + BC is a reduced form of ____________

a) AB + BC
b) (A + B)(A + C)
c) A’B + AB’C
d) (A + C)B
9. The logical sum of two or more logical product terms is called __________
a) SOP
b) POS
c) OR operation
d) NAND operation
10. The expression Y=AB+BC+AC shows the _________ operation.
a) EX-OR
b) SOP
c) POS
d) NOR
11. The expression Y=(A+B)(B+C)(C+A) shows the _________ operation.
a) AND
b) POS
c) SOP
d) NAND
12. The canonical sum of product form of the function y(A,B) = A + B is __________
a) AB + BB + A’A
b) AB + AB’ + A’B
c) BA + BA’ + A’B’
d) AB’ + A’B + A’B’
13. A variable on its own or in its complemented form is known as a __________
a) Product Term
b) Literal
c) Sum Term
d) Word
14. Canonical form is a unique way of representing ____________
a) SOP
b) Minterm
c) Boolean Expressions
d) POS

Downloaded by Ahmed Nagi ([email protected])

 lOMoARcPSD|51086353

15. There are _____________ Minterms for 3 variables (a, b, c).

a) 0
b) 2
c) 8
d) 1
16. _____________ expressions can be implemented using either (1) 2-level AND-OR
logic circuits or (2) 2-level NAND logic circuits.
a) POS
b) Literals
c) SOP
d) None of the above
17. The output of an EX-NOR gate is 1. Which input combination is correct?
a) A = 1, B = 0
b) A = 0, B = 1
c) A = 0, B = 0
d) A = 0, B’ = 1
18. Odd parity of word can be conveniently tested by ___________
a) OR gate
b) AND gate
c) NAND gate
d) XOR gate
19. Convert the following SOP expression to an equivalent POS expression.

a)
b)
c)
d)

20. 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

21. 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

Downloaded by Ahmed Nagi ([email protected])

 lOMoARcPSD|51086353

22. Derive the Boolean expression for the logic circuit shown below:

a)

b)

c)

d)

23. From the truth table below, determine the standard SOP expression.

a)
b)
c)
d)

24. 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.

25. Which output expression might indicate a product-of-sums circuit construction:

a)
b)
c)
d)

Downloaded by Ahmed Nagi ([email protected])

 lOMoARcPSD|51086353

26. For the SOP expression , how many 1s are in the truth table's output
column?
a) 1
b) 2
c) 3
d) 5
27. A truth table for the SOP expression has how many input
combinations?
a) 1
b) 2
c) 4
d) 8

28. 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

29. 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

30. Determine the values of A, B, C, and D that make the product term equal to 1.
a) A = 0, B = 1, C = 0, D = 1
b) A = 0, B = 0, C = 0, D = 1
c) A = 1, B = 1, C = 1, D = 1
d) A = 0, B = 0, C = 1, D = 0

31. 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

32. 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

Downloaded by Ahmed Nagi ([email protected])

 lOMoARcPSD|51086353

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

a) a product term
b) all the variables in a Boolean expression
c) the inverse function
d) a variable or its complement

34. The truth table for the SOP expression has how many input combinations?
a) 1
b) 2
c) 4
d) 8

35. 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

36. Applying the distributive law to the expression , we get ________.

a)
b)
c)
d)

37. For the SOP expression , how many 0s are in the truth table's output column?
a) Zero
b) 1
c) 4
d) 5

38. Applying DeMorgan's theorem to the expression , we get ________.

a)
b)
c)
d)

39. Applying DeMorgan's theorem to the expression , we get ________.

a)
b)
c)
d)

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

a) True
b) False

41. The systematic reduction of logic circuits is performed using Boolean algebra.
a) True
b) False

Downloaded by Ahmed Nagi ([email protected])

 lOMoARcPSD|51086353

42. By applying De Morgan's theorem to a NOR gate, two identical truth tables can be produced.
a) True
b) False

43. The process of reduction or simplification of combinational logic circuits increases the cost of
the circuit.
a) True
b) False

44. Most Boolean reductions result in an equation in only one form.

a) True
b) False

45. The binary value of 1010 is converted to the product term .

a) True
b) False

46. In the commutative law, in ORing and ANDing of two variables, the order in which the
variables are ORed or ANDed makes no difference.
a) True
b) False

47. 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.

48. Determine the binary values of the variables for which the following standard POS
expression is equal to 0.

a) (0 + 1 + 0)(1 + 0 + 1)
b) (1 + 1 + 1)(0 + 0 + 0)
c) (0 + 0 + 0)(1 + 0 + 1)
d) (1 + 1 + 0)(1 + 0 + 0)

49. 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

50. The commutative law of addition and multiplication indicates that:

a) we can group variables in an AND or in an OR any way we want
b) an expression can be expanded by multiplying term by term just the same as in ordinary
algebra
c) the way we OR or AND two variables is unimportant because the result is the same
d) the factoring of Boolean expressions requires the multiplication of product terms that
contain like variables

Downloaded by Ahmed Nagi ([email protected])

 lOMoARcPSD|51086353

51. Derive the Boolean expression for the logic circuit shown below:

a)
b)
c)
d)

52. Simplification of the Boolean expression AB + ABC + ABCD + ABCDE + ABCDEF yields
which of the following results?
a) ABCDEF
b) AB
c) AB + CD + EF
d) A + B + C + D + E + F
e) A + B(C+D(E+F))

53. Given that F = (A + B'+ C)(D + E), which of the following represents the only correct
expression for F'?
a) F' = A'BC'+ D'+ E'
b) F' = AB'C + DE
c) F' = (A'+ B + C')(D'+ E')
d) F' = A'BC' + D'E'
e) F' = (A + B'+ C)(D'+ E')

Downloaded by Ahmed Nagi ([email protected])