# (MCQ) 60 multiple choice questions on boolean theorems Share on:

Boolean theorems, or Boolean algebra, is a mathematical system that analyzes and simplifies digital logic circuits. It was developed by George Boole in the mid-19th century and is named after him. Boolean algebra is based on the idea that there are only two possible states for any variable or expression: true (1) or false (0).

## 60 multiple choice questions on boolean theorems

In this article, we are going to discuss multiple choice questions on boolean theorems, Sixty questions are given below:

### Which of the following is a Boolean theorem used for simplifying Boolean expressions?

• a) Thevenin’s theorem
• b) Superposition theorem
• c) De Morgan’s theorem
• d) Kirchhoff’s theorem

### Which of the following is an example of a Boolean variable?

• a) Temperature
• b) Voltage
• c) Time
• d) Switch state

• a) A + B
• b) AB
• c) A’B
• d) A ⊕ B

### What is the output of an AND gate when both inputs are 0?

• a) 0
• b) 1
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression (A.B) + (A.C)?

• a) De Morgan’s theorem
• b) Distributive law
• c) Commutative law
• d) Associative law

### Which of the following Boolean theorems is used to simplify the expression A + A’B?

• a) Absorption law
• b) Commutative law
• c) Associative law
• d) Distributive law

### What is the output of an XOR gate when the inputs are 1 and 0?

• a) 1
• b) 0
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression A + AB?

• a) Identity law
• b) Inverse law
• c) Complement law
• d) Distributive law

### What is the output of a NOT gate when the input is 1?

• a) 0
• b) 1
• c) -1
• d) None of the above

• a) NOR gate
• b) OR gate
• c) NAND gate
• d) NOT gate

### What is the complement of the Boolean function F(A,B,C) = A’B’C’?

• a) F(A,B,C) = ABC
• b) F(A,B,C) = A+B+C
• c) F(A,B,C) = A’+B’+C’
• d) F(A,B,C) = A’B’C

### Which of the following Boolean theorems is used to simplify the expression (A + B)(A + C)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the output of an OR gate when both inputs are 0?

• a) 0
• b) 1
• c) -1
• d) None of the above

• a) A + B
• b) AB
• c) A’B
• d) A ⊕ B

### Which of the following Boolean theorems is used to simplify the expression A + AB?

• a) Identity law
• b) Inverse law
• c) Complement law
• d) Distributive law

### What is the output of a NAND gate when both inputs are 1?

• a) 0
• b) 1
• c) -1
• d) None of the above

• a) A + B
• b) AB
• c) A’B
• d) A ⊕ B

### Which of the following Boolean theorems is used to simplify the expression A + A’B?

• a) Absorption law
• b) Commutative law
• c) Associative law
• d) Distributive

### What is the output of an AND gate when one input is 1 and the other is 0?

• a) 0
• b) 1
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression (A + B)(A + B’)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the output of a NAND gate when one input is 1 and the other is 0?

• a) 0
• b) 1
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression A(A + B)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the complement of the Boolean function F(A,B,C) = AB+C’?

• a) F(A,B,C) = AB+C
• b) F(A,B,C) = A+B+C’
• c) F(A,B,C) = A’B’+C
• d) F(A,B,C) = AB’+C

• a) A + B
• b) AB
• c) A’B
• d) A ⊕ B

### Which of the following Boolean theorems is used to simplify the expression (A + B)(A’ + B)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the output of an OR gate when one input is 1 and the other is 0?

• a) 0
• b) 1
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression A + AB’?

• a) Absorption law
• b) Commutative law
• c) Associative law
• d) Distributive law

### What is the complement of the Boolean function F(A,B,C) = (A+B)(A’+B’)C?

• a) F(A,B,C) = AB’C’
• b) F(A,B,C) = AB’C
• c) F(A,B,C) = A’B’C’
• d) F(A,B,C) = A’B’C

### Which of the following Boolean theorems is used to simplify the expression (A + B)C + A’B’C?

• a) De Morgan’s theorem
• b) Distributive law
• c) Commutative law
• d) Associative law

### What is the output of an XOR gate when both inputs are 1?

• a) 0
• b) 1
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression A(B + C)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the output of a NOR gate when both inputs are 0?

• a) 0
• b) 1
• c) -1
• d) None of the above

• a) A + B
• b) AB
• c) A’B
• d) A ⊕ B

### Which of the following Boolean theorems is used to simplify the expression (A + B’)C + AB’C?

• a) De Morgan’s theorem
• b) Distributive law
• c) Commutative law
• d) Associative law

### What is the complement of the Boolean function F(A,B,C) = A’BC’?

• a) F(A,B,C) = AB’C
• b) F(A,B,C) = A+B+C
• c) F(A,B,C) = A+B’C’
• d) F(A,B,C) = ABC

### Which of the following Boolean theorems is used to simplify the expression A + A’B?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the output of a NAND gate when both inputs are 1?

• a) 0
• b) 1
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression A + A’B + AC?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the complement of the Boolean function F(A,B,C) = A + B’C?

• a) F(A,B,C) = A’B+C’
• b) F(A,B,C) = A’+B’C’
• c) F(A,B,C) = AB’C
• d) F(A,B,C) = A’B+C

• a) A + B
• b) AB
• c) A’B
• d) A ⊕ B

### Which of the following Boolean theorems is used to simplify the expression (A + B)(A + C)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the output of an OR gate when both inputs are 1?

• a) 0
• b) 1
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression (A + B’)(A + C’)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the complement of the Boolean function F(A,B,C) = A’B’ + AC?

• a) F(A,B,C) = AB’ + A’C’
• b) F(A,B,C) = A+B+C
• c) F(A,B,C) = A+B’C’
• d) F(A,B,C) = AB’C

### Which of the following Boolean theorems is used to simplify the expression A + AB?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the output of a NOR gate when one input is 1 and the other is 0?

• a) 0
• b) 1
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression A(B + C’)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the complement of the Boolean function F(A,B,C) = AB’ + AC’?

• a) F(A,B,C) = A’B’C’
• b) F(A,B,C) = A’B + A’C
• c) F(A,B,C) = AB’C
• d) F(A,B,C) = A’B + AC

### Which of the following Boolean theorems is used to simplify the expression (A + B)(A’ + C)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive

### What is the output of an XOR gate when both inputs are 1?

• a) 0
• b) 1
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression (A + B)(A’ + B’)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the complement of the Boolean function F(A,B,C) = A + B’ + C’?

• a) F(A,B,C) = A’B’C
• b) F(A,B,C) = AB’C’
• c) F(A,B,C) = A’B + AC
• d) F(A,B,C) = A’B’C’

### Which of the following Boolean theorems is used to simplify the expression A(A + B)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the output of a NOT gate when the input is 1?

• a) 0
• b) 1
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression A(B + C) + A(B + C’)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the complement of the Boolean function F(A,B,C) = A’BC + AC’?

• a) F(A,B,C) = A+B’C’
• b) F(A,B,C) = AB’C
• c) F(A,B,C) = AB’ + A’C’
• d) F(A,B,C) = A’B + AC

### Which of the following Boolean theorems is used to simplify the expression A + AB?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the output of an AND gate when one input is 1 and the other is 0?

• a) 0
• b) 1
• c) -1
• d) None of the above

### Which of the following Boolean theorems is used to simplify the expression (A + B)(A’ + B + C)?

• a) Absorption law
• b) Complement law
• c) Associative law
• d) Distributive law

### What is the complement of the Boolean function F(A,B,C) = AB’ + AC?

• a) F(A,B,C) = A’B’C’
• b) F(A,B,C) = A’B + A’C
• c) F(A,B,C) = AB’C
• d) F(A,B,C) = A’B + AC’