Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 8 (25 MCQs)

Quiz Instructions

Select an option to see the correct answer instantly.

1. Define the term 'logic gate' and list its types.
2. A NOT gate produces what kind of output?
3. Another way to represent ON or TRUE. (1 mark)
4. The minterms (0, 3, 4) can be written in expression as
5. What is invented AND gate called?
6. What is the minimum number of gates required to implement the Boolean function (AB+C) if we have to use only 2-input NOR gates?
7. AND Gate:If A is OFF but B is ON, C would light up?
8. Which single gate could be used to represent the circuit described by? $\overline{A.B}$
9. The following equation corresponds to De Morgan's theorem in booloen algebra
10. What is the result of the logical OR operation when both inputs are false?
11. What is the basic building block of digital electronics?
12. In boolean algebra A+0 = .....
13. What will the result of this code be?var = True and Falseprint(var)
14. The expression (A+B).(B+C) can be written in canonical form as
15. In Boolean algebra, how is the NOT operation represented in text format?
16. What would the following condition return?100 == 100
17. How can Boolean algebra be used to simplify logical expressions?
18. Involution Law is also known as
19. A rule in Boolean algebra which permits the removal of brackets from an expression and regrouping of the variables
20. Using an OR gate, it one transistor is on and the other is off, the output is .....
21. Name the law which states that X(Y+Z)=XY+XZ
22. What does the statement:$\left(X+Y\right).\left(X+\overline{Y}\right)$
23. How many number of cells in the 4-variable K-Map?
24. What is the symbol used for the OR operation?
25. Rule in Boolean Algebra where the order of application of two separate terms is not important. E.G. A AND B = B AND A