This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates – Quiz 7 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 7 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. Which of the following statement is FALSE about logic gates? A) Logic gates are the building blocks of electronic circuits. B) It is used in computer components like memory. C) A combination of logic gates is called logic circuit. D) A logic gate understands binary language. E) None of the above. Show Answer Correct Answer: E) None of the above. 2. Cindy is programming a game that the player must find keys to be able to open doors. The player must have the "green key" to open the "green door" . What happens if the condition does not exist? A) Condition is False and the door does not open. B) Condition is True and the door opens. C) Condition is Unknown and the game has a logic error. D) Condition is Invalid because of syntax errors. Show Answer Correct Answer: A) Condition is False and the door does not open. 3. How many inputs does an AND operation take? A) Two. B) One. C) Three. D) It varies. Show Answer Correct Answer: A) Two. 4. Minterms are also called A) Standard sum. B) Standard product. C) Standard division. D) Standard subtraction. Show Answer Correct Answer: B) Standard product. 5. Apply De Morgan's law for (C'+D)' and choose the appropriate one A) C+D. B) C'D'. C) CD. D) C.D'. Show Answer Correct Answer: D) C.D'. 6. The inputs of a NAND gate are connected together. The resulting circuit is ..... A) Not Gate. B) Nor Gate. C) And Gate. D) Or Gate. Show Answer Correct Answer: A) Not Gate. 7. What is the output of an OR operation when both inputs are false? A) Undefined. B) True. C) False. D) Varies. Show Answer Correct Answer: C) False. 8. NAND gate is equivalent to combination of A) NOT gate followed by AND gate. B) NOT gate followed by OR gate. C) OR gate followed by NOT gate. D) AND gate followed by NOT gate. Show Answer Correct Answer: D) AND gate followed by NOT gate. 9. Which law is this an example of:A(B+C) = (A.B)+(A.C)A+(B.C) = (A+B).(A+C) A) Associative. B) Commutative. C) Absorption. D) Distributive. Show Answer Correct Answer: D) Distributive. 10. Logic gates are digital ..... (1 mark) A) Switches. B) Footprints. C) Binary. D) RAM. Show Answer Correct Answer: A) Switches. 11. A variable is a symbol in Boolean algebra used to represent A) Data. B) A condition. C) An action. D) Answers (a), (b) and (c). Show Answer Correct Answer: D) Answers (a), (b) and (c). 12. ChoiceTrue A) False. B) All the above. C) None of the above. D) None of above. Show Answer Correct Answer: A) False. 13. Which gate is called the Universal Gate? A) AND. B) OR. C) NOR. D) NAND. Show Answer Correct Answer: D) NAND. 14. Isla is designing a digital circuit for a school project. She needs to represent the gates in Boolean logic. How would she typically do this? A) Using letters and numbers. B) With symbols like triangles and arcs. C) By programming languages. D) Through graphs. Show Answer Correct Answer: B) With symbols like triangles and arcs. 15. De Morgan's theorem converts A) AND to OR. B) OR to AND. C) Both. D) None. Show Answer Correct Answer: C) Both. 16. Which logic gate represents the Boolean expression A + B? A) AND. B) OR. C) NOT. D) NAND. Show Answer Correct Answer: B) OR. 17. Which of the following is a valid Boolean expression? A) A + B = C. B) A + B = C. C) X > Y. D) A OR B. Show Answer Correct Answer: D) A OR B. 18. Identify the logic gate that outputs 0 only when all inputs are 0. A) AND. B) OR. C) NOT. D) NAND. Show Answer Correct Answer: B) OR. 19. Both inputs need to be 1 for an OR gate to output a 1 A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: B) False. 20. How many inputs can a NAND gate have? A) One input. B) Three inputs. C) Two or more inputs. D) Only digital inputs. Show Answer Correct Answer: C) Two or more inputs. 21. What is the difference between a half adder and a full adder? A) A full adder has a carry-in input; a half adder does not. B) A half adder can handle more digits. C) A full adder uses fewer gates. D) A half adder multiplies bits. Show Answer Correct Answer: A) A full adder has a carry-in input; a half adder does not. 22. What is the output of an OR gate if its inputs are 0 and 0? A) 1. B) 0. C) All the above. D) None of the above. Show Answer Correct Answer: B) 0. 23. What does the statement:(NOT A) AND A evaluate to? A) 0. B) 1. C) A. D) NOT A. Show Answer Correct Answer: A) 0. 24. What does a Comparative Boolean code look for? A) A special character. B) It compares values. C) A specific string. D) A specific floating point. Show Answer Correct Answer: B) It compares values. 25. What are the two rules of De Morgan's theorem? A) (X + Y) = X . Y and (X . Y) = X + Y. B) (X + Y) = X + Y and (X . Y) = X . Y. C) X + Y = 0 and X . Y = 1. D) None of the above. Show Answer Correct Answer: A) (X + Y) = X . Y and (X . Y) = X + Y. ← 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 8Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 9Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 10Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 11 🏠 Back to Homepage 📘 Download PDF Books 📕 Premium PDF Books