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 1 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Computer Science Chapter 6 Boolean Algebra And Logic Gates Quiz 1 (60 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. Which of the following is an example of a non-weighted code? A) Gray code. B) Excess-3. C) Octal code. D) BCD. Show Answer Correct Answer: A) Gray code. 2. Evaluate:die1 = 6die2 = 3score = die1+die2score >= 10 A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: B) False. 3. Write the Boolean value of FALSE. A) 0. B) 1. C) All the above. D) None of the above. Show Answer Correct Answer: A) 0. 4. ( (Not True) OR ( 5 != 25) ) NAND ( (5 < 4) XOR True ) A) True. B) False. C) This is just unfair now. D) None of the above. Show Answer Correct Answer: B) False. 5. Identify the gate that can be used to implement all other logic gates. A) XNOR. B) Buffer. C) XOR. D) NOR. Show Answer Correct Answer: D) NOR. 6. State the purpose of a D type flip-flop A) To store logic gates. B) To store the state of clock pulses. C) To store calculations. D) To store the state of a bit. Show Answer Correct Answer: D) To store the state of a bit. 7. Identify the Boolean notation for the complement of A. A) A + 1. B) -A. C) A'. D) 1-A. Show Answer Correct Answer: C) A'. 8. 5) The Boolean expression for a 3-input AND gate is ..... A) C) X = A + B + C. B) D) X = AB + C. C) A )X = AB. D) B) X = ABC. Show Answer Correct Answer: D) B) X = ABC. 9. If the result of a logical expression or logical statement is always true or 1 A) TAUTOLOGY. B) FALLACY. C) TRUE. D) LOGIC GATE. Show Answer Correct Answer: A) TAUTOLOGY. 10. The output of an OR gate is LOW when all inputs are: A) 1. B) 0. C) Equal. D) Don't care. Show Answer Correct Answer: B) 0. 11. The only time this statement is false is if both inputs are false. A) A NOT gate. B) An AND statement. C) An OR statement. D) An IF statement. Show Answer Correct Answer: C) An OR statement. 12. In negative logic, the logic 1 state corresponds to A) High voltage level. B) Low voltage level. C) Negative voltage level. D) Ground level. Show Answer Correct Answer: D) Ground level. 13. The binary equivalent of decimal number 13 is: A) 1011. B) 1110. C) 1101. D) 1100. Show Answer Correct Answer: C) 1101. 14. The involution of A is equal to ..... A) A'. B) 1. C) 0. D) A. Show Answer Correct Answer: D) A. 15. What is the branch of mathematics that deals exclusively with true and false values? A) Vector algebra. B) Algebraic combinatorics. C) Boolean algebra. D) Trigonometry. Show Answer Correct Answer: C) Boolean algebra. 16. What is the simplified form of A + A? A) AA. B) A. C) 1. D) 0. Show Answer Correct Answer: B) A. 17. What is the output of an OR gate if both inputs are 1? A) 0. B) Undefined. C) Depends on the circuit. D) 1. Show Answer Correct Answer: D) 1. 18. The product consists of either the variables or its negations is called A) Maxterm. B) Minterm. C) None. D) None of the above. Show Answer Correct Answer: B) Minterm. 19. The simplest gate is the ..... gate, also known as an inverter. It accepts a single input and outputs the opposite value A) NOT. B) AND. C) NAND. D) AND. Show Answer Correct Answer: A) NOT. 20. Which of these is considered universal gate A) AND. B) NOT. C) XOR. D) NOR. Show Answer Correct Answer: D) NOR. 21. Which gate is used to find the complement of product of 2 input signals? A) AND. B) OR. C) NAND. D) NOR. Show Answer Correct Answer: C) NAND. 22. Truth table shows A) Logic diagram. B) Output for all inputs. C) Circuit delay. D) Memory size. Show Answer Correct Answer: B) Output for all inputs. 23. Select the best definition of a literal A) A Boolean variable. B) The complement of a Boolean variable. C) 1 or 2. D) The actual understanding of a Boolean variable. Show Answer Correct Answer: C) 1 or 2. 24. When is the output for AND gate TRUE? A) When both inputs are TRUE. B) When at least one of the inputs is TRUE. C) When both inputs are FALSE. D) When at least one of the inputs is FALSE. Show Answer Correct Answer: A) When both inputs are TRUE. 25. What is the output of a XOR gate when both inputs are 1? A) Depends on the gate. B) 0. C) Undefined. D) 1. Show Answer Correct Answer: B) 0. 26. Calculate the dual of Boolean expression (B'+C).A A) (B'.A)+C. B) (B'.C')+A. C) (B'.C)+A. D) (B'.A)+A. Show Answer Correct Answer: C) (B'.C)+A. 27. How can you simplify Boolean expressions? A) Apply calculus methods to simplify expressions. B) Use graphical representations to analyze logic. C) Implement programming techniques for optimization. D) Use Boolean algebra laws and techniques like Karnaugh maps to simplify. Show Answer Correct Answer: D) Use Boolean algebra laws and techniques like Karnaugh maps to simplify. 28. What is the significance of truth tables in Boolean algebra? A) Truth tables are used for weather forecasting. B) Truth tables help in baking recipes. C) Truth tables are essential for car maintenance. D) Truth tables in Boolean algebra are significant as they help in analyzing and simplifying logical expressions, determining the validity of arguments, and designing digital circuits. Show Answer Correct Answer: D) Truth tables in Boolean algebra are significant as they help in analyzing and simplifying logical expressions, determining the validity of arguments, and designing digital circuits. 29. What does a truth table represent? A) The design of a logic circuit. B) The physical arrangement of logic gates. C) A specific problem statement. D) The output of a logic circuit for every possible combination of inputs. Show Answer Correct Answer: D) The output of a logic circuit for every possible combination of inputs. 30. What does the double negation rule state? A) NOT (NOT A) = A. B) A + 0 = 0. C) A . 1 = 0. D) A + A = 1. Show Answer Correct Answer: A) NOT (NOT A) = A. 31. In Boolean algebra A.A.A.A is equal to A) 1. B) A. C) 4A. D) A$^{4}$. Show Answer Correct Answer: B) A. 32. Which of these is a definition of a transistor A) Microscopic devices that open and close circuits to communicate electrical signals. B) A device used to change a circuit. C) A type of gate used in a CPU. D) Circuit components which take several inputs. Show Answer Correct Answer: A) Microscopic devices that open and close circuits to communicate electrical signals. 33. To perform product of maxterms Boolean function must be brought into A) AND terms. B) OR terms. C) NOT terms. D) NAND terms. Show Answer Correct Answer: B) OR terms. 34. How many rows does a truth table need if there are 2 inputs?(1 mark) A) 4. B) 2. C) 16. D) 8. E) 6. Show Answer Correct Answer: A) 4. 35. Which property:A+B = B+A or A * B = B*A A) Distributive. B) Associative. C) Commutative. D) Bermuda Triangle. Show Answer Correct Answer: C) Commutative. 36. According to Boolean algebra theorems x.x is equal to A) X. B) 0. C) X'. D) 1. Show Answer Correct Answer: A) X. 37. What does De Morgan's first law state? A) NOT (A AND B) = NOT A OR NOT B. B) A AND B = A OR B. C) NOT A = A. D) A OR B = A AND B. Show Answer Correct Answer: A) NOT (A AND B) = NOT A OR NOT B. 38. A string is ..... A) A number with a decimal part. B) Letters, numbers or punctuation. C) A whole number. D) True or False. Show Answer Correct Answer: B) Letters, numbers or punctuation. 39. Boolean algebra is different from ordinary algebra in which way? A) Boolean algebra can represent more than 1 discrete level between 0 and 1. B) Boolean algebra have only 2 discrete levels:0 and 1. C) Boolean algebra can describe up to levels of logic levels. D) They are actually the same. Show Answer Correct Answer: B) Boolean algebra have only 2 discrete levels:0 and 1. 40. Convert (1011) ..... 2 to decimal: A) 10. B) 13. C) 11. D) 15. Show Answer Correct Answer: B) 13. 41. In the Boolean algebra, a variable has ..... different state(s)/value(s). A) 2. B) 4. C) 1. D) 3. Show Answer Correct Answer: A) 2. 42. The XOR gate produces ..... when even number of 1's are there in the input combinations. A) 0. B) 1. C) All the above. D) None of the above. Show Answer Correct Answer: A) 0. 43. NOT Gate:If A is Off, B would light up? A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. 44. Identify the logic gate that outputs 1 only when all inputs are 1. A) OR. B) AND. C) NOT. D) XOR. Show Answer Correct Answer: B) AND. 45. Describe the significance of the truth table in logic circuits. A) It determines the power consumption of the circuit. B) The truth table is significant in logic circuits as it provides a clear representation of how inputs relate to outputs, aiding in design and analysis. C) It is used to measure the voltage across the circuit. D) It shows the physical layout of the circuit components. Show Answer Correct Answer: B) The truth table is significant in logic circuits as it provides a clear representation of how inputs relate to outputs, aiding in design and analysis. 46. According to Boolean law ((A)')' A) A'. B) 1. C) A. D) 0. Show Answer Correct Answer: C) A. 47. Another way to represent OFF or FALSE A) 0. B) 1. C) All the above. D) None of the above. Show Answer Correct Answer: A) 0. 48. X = 100Y = 50print(x and y)What is the ouput of this code? A) False. B) 100. C) 50. D) True. Show Answer Correct Answer: C) 50. 49. What does the statement:(NOT A) OR A evaluate to? A) 1. B) A. C) 0. D) NOT A. Show Answer Correct Answer: A) 1. 50. How many different combinations of 1 and 0 are possible with 3 bits? A) 4. B) 7. C) 6. D) 5. E) 8. Show Answer Correct Answer: E) 8. 51. NOR Gate is the combination of? A) NOT and AND. B) OR and AND. C) NAND and OR. D) NOT and OR. Show Answer Correct Answer: D) NOT and OR. 52. In the truth table for a NOR gate, what is the output when both inputs are 1? A) 1. B) Undefined. C) A. D) 0. Show Answer Correct Answer: D) 0. 53. A NOT takes a single Boolean value, either true or false, and ..... A) Makes it true. B) Keeps it the same. C) Negates it. D) Makes it false. Show Answer Correct Answer: C) Negates it. 54. What is the correct way to declare a boolean variable in Java? A) Boolean isTrue = '1';. B) Boolean isTrue = true;. C) Boolean isTrue = 'true';. D) Boolean isTrue = 1;. Show Answer Correct Answer: B) Boolean isTrue = true;. 55. What gate produces 0 only when both inputs are 1? A) NAND. B) AND. C) OR. D) XOR. Show Answer Correct Answer: A) NAND. 56. An integer is ..... A) True or False. B) A number with a decimal part. C) A whole number. D) Letters, numbers or punctuation. Show Answer Correct Answer: C) A whole number. 57. The expression for the Absorption law is given by ..... (A' means $\overline{A}$ A) AB+AA'=A. B) A+AB=A. C) A+AB=B. D) A+B=B+A. Show Answer Correct Answer: B) A+AB=A. 58. Write the Boolean value of TRUE. A) 0. B) 1. C) All the above. D) None of the above. Show Answer Correct Answer: B) 1. 59. Two transistors connected in series, with two inputs and one output, act like ..... A) A NOT gate. B) An AND gate. C) An OR gate. D) An IF statement. Show Answer Correct Answer: B) An AND gate. 60. If there are 3 variables, then we can have ..... number of minterms A) 3. B) 6. C) 8. D) 4. Show Answer Correct Answer: C) 8. Next →Related QuizzesScience QuizzesClass 12 QuizzesClass 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 9 🏠 Back to Homepage 📘 Download PDF Books 📕 Premium PDF Books