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

Quiz Instructions

Select an option to see the correct answer instantly.

1. Divides a number by another number and returns just the whole number
2. Rule in Boolean Algebra where if you invert a term twice it is equal to its original term. E.G (NOT NOT A) = A
3. When computer engineers are designing processors, they ..... work at the transistor level.
4. Apply Demorgan's theorem to simplify the following expression:[(A+B)+C]'
5. The only time an XOR is true is when .....
6. Which has the highest order of precedence:AND, OR or NOT?
7. Which of the following represents the Idempotent Law?
8. Another way to represent ON or TRUE
9. Which of the following represents the complement of the function X + YZ
10. Three managers have a key of a safe with them, and it requires any two keys to open the safe. If A, B and C denote the presence of the three managers respectively in front of the safe, write down the switching expression denoting the condition for opening the safe?
11. The process of combining adjacent 1's in K-map is known as:
12. 6) Which among the below stated boolean expressions do not obey De-Morgan's theorem?
13. According to the associative law:
14. De Morgan's Theorem:(AB)' =?
15. The two variables age and day are initialized with the values shown. age < ..... 16 day < ..... "Tuesday" Choose the compound conditional that evaluates to true.
16. A + 0 =?
17. The associative law of multiplication for three variables is written as A (BC) = .....
18. The expression (AB)'+(BC)' can also be written as
19. What is the output of an XOR gate when both inputs are the same?
20. Why is abstraction important in computer engineering?
21. Select the correct meaning of the symbol in Boolean algebra.
22. How many input and output required for multiplexer?
23. What would the following condition return?5 > 2
24. Identify the logic gate that produces the complement of its input.
25. NOR function is dual of