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

Quiz Instructions

Select an option to see the correct answer instantly.

1. Simplify the Boolean function x(x'+y) to a minimum number of literals.
2. James tells his friend that he is coming to the party. If his friend believes the opposite of what James says, what is the result of the expression:NOT (True)?
3. Is 4 > 5
4. What are NAND and NOR gates known as?
5. NAND can be simplified as
6. What are the basic logic gates used in digital electronics?
7. What does the output of a NAND gate become when all inputs are 1?
8. According to the DeMorgan laws, the complement of a product of variables is equal to
9. Ethan, Scarlett, and Nora are at a traffic signal. What should they do if the signal light is not red?
10. Which operator has the lowest priority?
11. What does binary representation rely on?
12. What does a logic gate do?
13. A variable that can only have two values, True or False.
14. Boolean algebra is based on
15. Is 6 >= 6
16. 8 > 3
17. Describe a real-world application of Boolean logic.
18. X + (X . Y) = X, Identify the boolean law:
19. Explain the concept of a logic circuit.
20. Which logic gate outputs 0 only when all inputs are 1?
21. What happens when a logic circuit is simplified using a Karnaugh Map?
22. The dual of the switching expression (X + (Y . 1)) + (Z + 0) is
23. A boolean is .....
24. Hannah and Aiden are working together on a project. If both Hannah and Aiden complete their tasks, will the project be marked as complete?
25. Which inputs does an SR flip-flop have?