This quiz works best with JavaScript enabled. Home > Cbse > Class 12 > Science > Computer Science > Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates – Quiz 3 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 3 (60 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. (5 > 4) XOR (4 < 9) A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: B) False. 2. Give the dual of A+1=1 A) A+0=A. B) A.1=A. C) A.A=A. D) A.0=0. Show Answer Correct Answer: B) A.1=A. 3. According to the Boolean laws:A+0=? A) $\overline{A}$. B) 1. C) 0. D) A. Show Answer Correct Answer: D) A. 4. Which of the following logic gates outputs True only when both inputs are True? A) OR. B) AND. C) NOT. D) XOR. Show Answer Correct Answer: B) AND. 5. According to the associative law of addition, A) A + 0 = A. B) A = A + A. C) (A + B) + C = A + (B + C ). D) A + B = B + A. Show Answer Correct Answer: C) (A + B) + C = A + (B + C ). 6. Which law of Boolean algebra emphasizes the elimination of brackets from logical expression along with the re-arrangement of grouping variables? A) Distributive Law. B) Commutative Law. C) Associative Law. D) None. Show Answer Correct Answer: C) Associative Law. 7. In Binary Coded Decimal (BCD), decimal 9 is represented as: A) 1001. B) 1010. C) 1100. D) 1001. Show Answer Correct Answer: A) 1001. 8. Classify the expression (A + B)' according to DeMorgan's theorem. A) AB. B) A' + B'. C) A'B'. D) A + B. Show Answer Correct Answer: C) A'B'. 9. The Boolean expression Y = (AB)' is logically equivalent to what single gate? A) NAND. B) NOR. C) AND. D) OR. Show Answer Correct Answer: A) NAND. 10. In an AND statement both sides need to be TRUE to produce an output of TRUE. A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. 11. Who was the mathematician that developed Boolean algebra? A) George Boole. B) Charles Babbage. C) Fredrick Boole. D) Augustus De Morgan. Show Answer Correct Answer: A) George Boole. 12. What is a Boolean function? A) A function that maps binary inputs to a binary output. B) A function that maps binary inputs to decimal outputs. C) A function that outputs a string based on integer inputs. D) A function that only accepts numeric inputs. Show Answer Correct Answer: A) A function that maps binary inputs to a binary output. 13. One reason computers use binary is because it prevents confusion and crossed signals. Another reason is a branch of math already existed, called ..... A) Linear Algebra. B) Crustacean Algebra. C) Matrix Algebra. D) Boolean Algebra. Show Answer Correct Answer: D) Boolean Algebra. 14. Maxterms are also called A) Standard sum. B) Standard product. C) Standard division. D) Standard subtraction. Show Answer Correct Answer: A) Standard sum. 15. Which gate outputs 1 if at least one input is 1? A) AND gate. B) OR gate. C) NOR gate. D) NAND gate. Show Answer Correct Answer: B) OR gate. 16. What is described as a table that shows the output of a logic gate for all possible combinations of input? A) Truth table. B) Boolean table. C) Trace table. D) Logic table. Show Answer Correct Answer: A) Truth table. 17. 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. 18. 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. 19. How many inputs does an AND operation take? A) Two. B) It varies. C) Three. D) One. Show Answer Correct Answer: A) Two. 20. Minterms are also called A) Standard sum. B) Standard product. C) Standard division. D) Standard subtraction. Show Answer Correct Answer: B) Standard product. 21. Apply De Morgan's law for (C'+D)' and choose the appropriate one A) CD. B) C+D. C) C'D'. D) C.D'. Show Answer Correct Answer: D) C.D'. 22. 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. 23. What is the output of an OR operation when both inputs are false? A) True. B) Varies. C) False. D) Undefined. Show Answer Correct Answer: C) False. 24. 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. 25. Which law is this an example of:A(B+C) = (A.B)+(A.C)A+(B.C) = (A+B).(A+C) A) Commutative. B) Associative. C) Absorption. D) Distributive. Show Answer Correct Answer: D) Distributive. 26. Logic gates are digital ..... (1 mark) A) Footprints. B) Binary. C) RAM. D) Switches. Show Answer Correct Answer: D) Switches. 27. 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). 28. Which gate is called the Universal Gate? A) AND. B) OR. C) NOR. D) NAND. Show Answer Correct Answer: D) NAND. 29. 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. 30. De Morgan's theorem converts A) AND to OR. B) OR to AND. C) Both. D) None. Show Answer Correct Answer: C) Both. 31. Which logic gate represents the Boolean expression A + B? A) AND. B) OR. C) NOT. D) NAND. Show Answer Correct Answer: B) OR. 32. 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. 33. 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. 34. How many inputs can a NAND gate have? A) Only digital inputs. B) Two or more inputs. C) Three inputs. D) One input. Show Answer Correct Answer: B) Two or more inputs. 35. 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. 36. 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. 37. 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. 38. 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. 39. Define the term 'logic gate' and list its types. A) Types of logic gates include ADD, SUB, MUL, DIV. B) Types of logic gates include AND, OR, NOT, NAND, NOR, XOR, and XNOR. C) Types of logic gates include AND, OR, XOR, XNOR, NOT. D) Types of logic gates include AND, OR, NOT, NAND, NOR, BUF. Show Answer Correct Answer: B) Types of logic gates include AND, OR, NOT, NAND, NOR, XOR, and XNOR. 40. A NOT gate produces what kind of output? A) The inverse of the input. B) A constant 0. C) The product of the inputs. D) The sum of the inputs. Show Answer Correct Answer: A) The inverse of the input. 41. Another way to represent ON or TRUE. (1 mark) A) 1. B) 0. C) All the above. D) None of the above. Show Answer Correct Answer: A) 1. 42. The minterms (0, 3, 4) can be written in expression as A) (A'+B'+C').(A'+B+C).(A+B'+C'). B) A'B'C'+A'BC+AB'C'. C) ABC+AB'C+A'B'C'. D) (A+B+C).(A'+B+C).(A+B'+C'). Show Answer Correct Answer: B) A'B'C'+A'BC+AB'C'. 43. What is invented AND gate called? A) XAND. B) NOR. C) NAND. D) XNAND. Show Answer Correct Answer: C) NAND. 44. 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? A) 5. B) 4. C) 2. D) 3. Show Answer Correct Answer: D) 3. 45. AND Gate:If A is OFF but B is ON, C would light up? A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: B) False. 46. Which single gate could be used to represent the circuit described by? $\overline{A.B}$ A) NAND. B) NOR. C) XNOR. D) NOT. Show Answer Correct Answer: A) NAND. 47. The following equation corresponds to De Morgan's theorem in booloen algebra A) (A+B)(A+B)=A+AB+B. B) (A+B)(A+B)=AA+AB+BB+BA. C) (AB)'=A'+B'. D) None of the above. Show Answer Correct Answer: C) (AB)'=A'+B'. 48. What is the result of the logical OR operation when both inputs are false? A) True. B) 0. C) False. D) 1. Show Answer Correct Answer: B) 0. 49. What is the basic building block of digital electronics? A) Logic gate. B) Microcontroller. C) Transistor. D) Resistor. Show Answer Correct Answer: A) Logic gate. 50. In boolean algebra A+0 = ..... A) 0. B) 2A. C) 1. D) A. Show Answer Correct Answer: D) A. 51. What will the result of this code be?var = True and Falseprint(var) A) True. B) False. C) Var. D) None of these. Show Answer Correct Answer: B) False. 52. The expression (A+B).(B+C) can be written in canonical form as A) (A '+ B'+C).(A+B+C').(A'+B+C). B) (A' + B+C).(A+B+C').(A'+B+C). C) (A + B+C).(A+B+C').(A'+B+C). D) (A + B'+C).(A+B+C').(A'+B+C). Show Answer Correct Answer: C) (A + B+C).(A+B+C').(A'+B+C). 53. In Boolean algebra, how is the NOT operation represented in text format? A) A dot. B) A plus symbol. C) A slash or bar above the section. D) A circle around the symbol. Show Answer Correct Answer: C) A slash or bar above the section. 54. What would the following condition return?100 == 100 A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. 55. How can Boolean algebra be used to simplify logical expressions? A) Boolean algebra is only used for arithmetic calculations. B) Boolean algebra is primarily used for statistical analysis. C) Logical expressions cannot be simplified using any algebraic methods. D) Boolean algebra can be used to simplify logical expressions by applying its laws and theorems. Show Answer Correct Answer: D) Boolean algebra can be used to simplify logical expressions by applying its laws and theorems. 56. Involution Law is also known as A) Complement law. B) Double Inversion Rule. C) Complementary Lw. D) None of the above. Show Answer Correct Answer: B) Double Inversion Rule. 57. A rule in Boolean algebra which permits the removal of brackets from an expression and regrouping of the variables A) Double Negation. B) Distribution. C) Commutation. D) Association. Show Answer Correct Answer: D) Association. 58. Using an OR gate, it one transistor is on and the other is off, the output is ..... A) Indeterminate. B) On. C) Off. D) Negated. Show Answer Correct Answer: B) On. 59. Name the law which states that X(Y+Z)=XY+XZ A) Associative Law. B) Distributive Law. C) Commutative Law. D) Absorption Law. Show Answer Correct Answer: B) Distributive Law. 60. What does the statement:$\left(X+Y\right).\left(X+\overline{Y}\right)$ A) 1. B) Y. C) X. D) 0. Show Answer Correct Answer: C) X. ← PreviousNext →Related QuizzesScience QuizzesClass 12 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 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 9 🏠 Back to Homepage 📘 Download PDF Books 📕 Premium PDF Books