Geometrics Placement Paper - Boolean Algebra Questions

Geometrics Previous Years Solved Sample Placement Papers

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

   Ans: D

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

   Ans: A

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

   Ans: D

4. The truth table for SOP expression AB + C has how many input combinations?

   A: 1

   B: 2

   C: 4

   D: 8

   Ans: C

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

   Ans: D

6. The product of sum is basically the ORing of ANDed terms

   A: True

   B: False

   C: May be both

   D: None of the above

   Ans: A

7. By applying De Morgan's theorem to a NOR gate, two identical truth tables can be produced.

   A: True

   B: False

   C: May be both

   D: Answer not given

   Ans: A

8. The process of reduction or simplification of combinational logic circuits increases the cost of the circuit.

   A: True

   B: False

   C: May be both

   D: Answer not given

   Ans: B

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

   A: True

   B: False

   C: May be both

   D: Answer not given

   Ans: B

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

    A: True

    B: False

    C: May be both

    D: Answer not given

    Ans: B

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

    C: May be both

    D: Answer not given

    Ans: A

12. 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)

    Ans: C

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

    Ans: C

14. Simplification of the Boolean expression AB + ABC + ABCD + ABCDE + ABCDEF yields which of the following results?

    A: ABCDEF

    B: AB + CD + EF

    C: A + B + C + D + E + F

    D: AB

    Ans: D