This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates – Quiz 26 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 26 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. List the two universal logic gates. A) AND and OR. B) XOR and XNOR. C) NAND and NOR. D) NOT and OR. Show Answer Correct Answer: C) NAND and NOR. 2. Which of these are logic gates? A) AND. B) OR. C) NOT. D) ALL OF THESE. Show Answer Correct Answer: D) ALL OF THESE. 3. What is the purpose of a full adder? A) Adds two binary digits and a carry-in. B) Stores a memory address. C) Converts binary to decimal. D) Performs subtraction. Show Answer Correct Answer: A) Adds two binary digits and a carry-in. 4. ( A + D ) ( A + C) =? A) A + DC + AD. B) A + DC. C) DC. D) None. Show Answer Correct Answer: B) A + DC. 5. If 99 NOR gates are cascaded one after another and input is 1, then find the output signal:- A) 0. B) 1. C) True. D) False. Show Answer Correct Answer: A) 0. 6. Which type of Boolean checks for a specific condition? A) Conditional Boolean. B) Comparative Boolean. C) Arithmetic Boolean. D) Logical Boolean. Show Answer Correct Answer: A) Conditional Boolean. 7. For an AND gate to output true, what is required of its inputs? A) Only one input is true. B) At least one input is true. C) Both inputs are true. D) Both inputs are false. Show Answer Correct Answer: C) Both inputs are true. 8. What is De Morgan's First Law? A) NOT(A + B) = NOT(A) * NOT(B). B) NOT(A * B) = NOT(A) * NOT(B). C) A + (B * C) = (A + B) * (A + C). D) A * (B + C) = (A * B) + (A * C). Show Answer Correct Answer: A) NOT(A + B) = NOT(A) * NOT(B). 9. Which of the following is the Identity Law in Boolean Algebra? A) A + 0 = A. B) A + A = A. C) A + A' = 1. D) A 1 = 1. Show Answer Correct Answer: A) A + 0 = A. 10. Recognize the Boolean law expressed by A + 1 = 1. A) Identity law. B) Null law. C) Domination law. D) Idempotent law. Show Answer Correct Answer: C) Domination law. 11. With four signal inputs, how many possible outputs are there? A) 16. B) 24. C) 4. D) 8. Show Answer Correct Answer: A) 16. 12. The NOT gate takes only one input (it is a unary operator). True or False? A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. 13. In what year was Boolean algebra first introduced? A) 1847. B) 1854. C) 1913. D) 1880. Show Answer Correct Answer: A) 1847. 14. According to the order of precedence in Boolean algebra, which operation is evaluated first? A) OR. B) AND. C) NOT. D) XOR. Show Answer Correct Answer: C) NOT. 15. How many states are there in the truth table for a three-input AND gate? A) 2. B) 4. C) 6. D) 8. Show Answer Correct Answer: D) 8. 16. 4) Which of the following gate will give a 0 when both of its inputs are 1? A) AND. B) OR. C) NAND. D) EXOR. Show Answer Correct Answer: C) NAND. 17. In Boolean algebra, the operation A + A is equal to: A) 0. B) A. C) A'. D) 1. Show Answer Correct Answer: B) A. 18. Which logic operator is mentioned?The statement (A ..... B) is true when both A and B are true. A) And. B) Or. C) Not. D) None of the above. Show Answer Correct Answer: A) And. 19. What is the output of A OR B if A = 0 and B = 1? A) 1. B) 0. C) A. D) B. Show Answer Correct Answer: A) 1. 20. SOP stands for A) Sum of Products. B) Set of Processes. C) System of Programs. D) Series of Pulses. Show Answer Correct Answer: A) Sum of Products. 21. An Exclusive OR, or XOR, is like a regular OR, but with one difference: A) If both inputs are true, the XOR is false. B) If both inputs are false, the XOR is true. C) All the above. D) None of the above. Show Answer Correct Answer: A) If both inputs are true, the XOR is false. 22. Evaluate this Boolean expression:I am in Year 8 AND I am in Year 9 A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: B) False. 23. How many rows will a truth table with 1 input have A) 2. B) 4. C) 8. D) 16. Show Answer Correct Answer: A) 2. 24. The AND and OR gate both take two inputs, while the NOT gate takes just one. True or False? A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. 25. Which gate has all inputs HIGH gives output LOW? A) AND. B) OR. C) NAND. D) XOR. Show Answer Correct Answer: C) NAND. ← PreviousNext →Related QuizzesClass 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 1Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 2Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 3Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 4Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 5Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 6Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 7Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 8Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 9Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 10 🏠 Back to Homepage 📘 Download PDF Books 📕 Premium PDF Books