UNIT – II

BINARY LOGIC AND BOOLEAN ALGEBRA

QUESTION BANK

PART-A

1)Which symbol represents the AND operation?

a)+
b) . (dot)
c) XOR
d) -
Correct Answer: b) . (dot)

2)The output of OR gate is 1 when:

a)All inputs are 0

b) Any input is 1
c) All inputs are 1
d) None of these
Correct Answer: b) Any input is 1

3)What is the complement of 0 in Boolean algebra?

a)0
b) 1
c) X
d) X'
Correct Answer: b) 1

4)Which logic gate acts as an inverter?

a)AND
b) OR
c) NOT
d) XOR
Correct Answer: c) NOT

5)The output of NAND gate is 0 only when:

a)All inputs are 0

b) All inputs are 1
c) Any input is 1
d) Any input is 0
Correct Answer: b) All inputs are 1

6)What is the result of A + A?

a)A
b) 0
c) 1
d) A'
Correct Answer: a) A

7)Which law states A + AB = A?

a)Distributive
b) Absorption
c) DeMorgan’s
d) Associative
Correct Answer: b) Absorption

8)In Boolean algebra, A . A' equals:

a)0
b) 1
c) A
d) A'
Correct Answer: a) 0

9)What is the output of NOR gate when all inputs are 0?

a)0
b) 1
c) Undefined
d) Depends on inputs
Correct Answer: b) 1

10)Which gate outputs 1 only when inputs are different?

a)XOR
b) NAND
c) AND
d) NOR
Correct Answer: a) XOR

11)A logic circuit that has two inputs and one output is called:

a)Gate
b) Flip-Flop
c) Register
d) Multiplexer
Correct Answer: a) Gate

12)Which Boolean law states A + 0 = A?

a)Identity
b) Complement
c) Domination
d) Absorption
Correct Answer: a) Identity

13)Which gate is also called a universal gate?

a)OR
b) AND
c) NAND
d) XOR
Correct Answer: c) NAND

14)Which operation does the symbol ‘+’ represent in Boolean algebra?

a)AND
b) OR
c) NOT
d) NAND
Correct Answer: b) OR

15)The output of NOR gate is 1 when:

a)All inputs are 0

b) Any input is 1
c) All inputs are 1
d) Never
Correct Answer: a) All inputs are 0

16)Which Boolean law states A(A' + B) = AB?

a)Consensus law
b) Distributive law
c) Absorption law
d) Associative law
Correct Answer: c) Absorption law

17)What does a NAND gate followed by a NOT gate form?

a)OR gate
b) AND gate
c) NOR gate
d) XOR gate
Correct Answer: b) AND gate

18)A logic gate that outputs LOW when inputs are equal is:
a)XOR
b) XNOR
c) NAND
d) NOR
Correct Answer: a) XOR

19)Which law is used in A(B + C) = AB + AC?

a)Distributive law
b) Absorption law
c) Idempotent law
d) Consensus law
Correct Answer: a) Distributive law

20)The truth table for AND gate gives HIGH output only when:

a)Any input is HIGH

b) All inputs are LOW
c) All inputs are HIGH
d) Any input is LOW
Correct Answer: c) All inputs are HIGH

21)In the truth table of OR gate, how many rows have output 1 for 2 inputs?

a)1
b) 2
c) 3
d) 4
Correct Answer: c) 3

22)The truth table of NAND gate shows output 0 only when:

a)All inputs are 1

b) Any input is 0
c) All inputs are 0
d) Any input is 1
Correct Answer: a) All inputs are 1

23)How many possible input combinations for 4 inputs?

a)8
b) 12
c) 16
d) 32
Correct Answer: c) 16
24)Which logic gate truth table has only one 0 in its output?

a)NAND
b) NOR
c) AND
d) OR
Correct Answer: a) NAND

25)The output of an AND gate with inputs A=1, B=0 is:

a)0
b) 1
c) Undefined
d) Don’t care
Correct Answer: a) 0

26)The truth table for an XNOR gate shows HIGH output when:

a)Inputs are different

b)Inputs are same

c)All inputs are 1

d)All inputs are 0

Correct Answer: b) Inputs are same

27)In a 2-input truth table, which gate has output 1 only when inputs are different?

a) AND
b) OR
c) XOR
d) NAND
Correct Answer: c) XOR

28)Which of the following has identical truth table output to NOR gate
complemented?

a) NAND
b) OR
c) AND
d) XOR
Correct Answer: b) OR

29)The total number of outputs in a 3-variable truth table is:

a) 4
b) 6
c) 8
d) 10
Correct Answer: c) 8

30)Which of the following gates has the same output as XNOR when both inputs are
same?

a) XOR
b) AND
c) OR
d) None of these
Correct Answer: d) None of these

31)How many 0’s in output column of 2-input AND gate truth table?

a) 1
b) 2
c) 3
d) 4
Correct Answer: c) 3

32)Which gate’s truth table has alternating 0 and 1 in output for each input change?

a) NOT
b) AND
c) OR
d) XOR
Correct Answer: a) NOT

33) Which gate’s truth table is completely opposite to OR gate?

a) AND
b) NOR
c) XOR
d) NAND
Correct Answer: b) NOR

34)Which gate outputs 1 when inputs are both 0 or both 1?

a) XOR
b) AND
c) OR
d) XNOR
Correct Answer: d) XNOR

35)Which gate always gives output 1 when inputs are 0 and 1?

a) XOR
b) XNOR
c) AND
 d) NOR
Correct Answer: a) XOR

PART-B

ANSWER THE FOLLOWING:

1)Write the truth table for a NAND gate.

A B A · B NAND Output (A · B)̅

0 0 0 1

0 1 0 1

1 0 0 1

1 1 1 0

2)Write down De Morgan’s Theorems.

Ans: De Morgan’s Theorems are two important rules in Boolean Algebra used for simplifying
logic expressions involving complements.

First Theorem:Explain Second Theorem: Explain

3) Define the Commutative Law with examples.

Ans: Binary variables in Boolean Algebra follow the commutative law. This law states that
operating boolean variables A and B is similar to operating boolean variables B and A.

A. B = B. A

A+B=B+A

4) What is the Distributive Law in Boolean Algebra?

Ans:Boolean Variables also follow the distributive law and the expression for Distributive law
is given as:

A . ( B + C) = (A . B) + (A . C)

5)What is a logic gate? List any two basic gates.

Ans: A logic gate is a digital circuit that performs a Boolean operation on one or more binary
inputs (0 or 1) and produces a single binary output.
Logic gates are the fundamental building blocks of digital systems like computers and
calculators.

AND Gate:

Output is 1 only if all inputs are 1.

 Boolean Expression: A · B

OR Gate:

Output is 1 if at least one input is 1.

Boolean Expression: A + B

6)Define the Identity Law in Boolean Algebra.

Ans:In the Boolean Algebra, we have identity elements for both AND(.) and OR(+)
operations. The identity law state that in boolean algebra we have such variables that on
operating with AND and OR operation we get the same result, i.e.

A+0=A

A.1 = A

7)State the Complement Law with expressions.

Ans:The Complement Law states that a variable ORed with its complement is always 1, and
a variable ANDed with its complement is always 0.

A + A' = 1

A.A=0

8)What is meant by a Boolean expression?

Ans:It is an expression that always yields two values either true or false when evaluated. If
the condition is true then it will return true or false and vice versa.

9)What are the universal gates? Why are they called so?

Ans:The universal gates are the logic gates that are versatile in that they can be programmed
to execute any Boolean function. The most popular types among them are NAND and NOR
gates.

This makes digital circuit design more efficient and cost-effective, especially in IC
(Integrated Circuit) design.

Using just NAND or NOR gates reduces manufacturing complexity.

10) Write any two rules of Boolean Algebra.

Ans:Boolean Algebra is a branch of algebra that deals with boolean values—true and false. It
is fundamental to digital logic design and computer science, providing a mathematical
framework for describing logical operations and expressions.

Associative Law

Associative law state that the order of performing Boolean operator is illogical as their result
is always the same. This can be understood as,

(A.B).C=A.(B.C)
 ( A + B ) + C = A + ( B + C)

Inversion Law

Inversion law is the unique law of Boolean algebra this law states that, the complement of
the complement of any number is the number itself.

(A')' = A

11)What is a truth table?

Ans: Table containing all the possible values of the logical variables and the combination of
the variable along with the given operation is called the truth table. The number of rows in
the truth table depends on the total Boolean variables used in that function. It is given by
using the formula,

Number of Rows in Truth Table = 2 n (where n is the number of Boolean variables used)

12) What is a Logic Gate?

Ans:A logic gates are an electronic circuit that are designed by using electrical components
like diodes, transistors, resistors, and more. It is used to perform logical operations based on
the inputs provided to it and gives a logical output that can be either high(1) or low(0). The
operation of logic gates is based on Boolean algebra or mathematics. Logic gates find their
uses in our day-to-day lives, such as in the architecture of our telephones, laptops, tablets
and memory devices.

13)Explain AND GATE?

14)Explain OR GATE?

15)Explain NOT GATE?

16)Explain NAND GATE?

17)Explain NOR GATE?

18)Explain XOR GATE?

19)Explain XNOR GATE?

20) Write the truth table for a XOR gate and XNOR?

21) State and explain any five gates Boolean Logic.

22) State and prove both De Morgan’s First Theorems with truth tables.

23)Explain the Universal Gates with Truth Table and diagram.

24) State and prove both De Morgan’s Second Theorems with truth tables.

25)Implement the Boolean function into logic gates.

a)F=(A.B)’. (B’+C)’
 b)F=(A+B)’.(A’B)

26) Implement the Boolean function into logic gates.

a)F=(A’.B.C’).(A+B+C)’

b)F=(A.B’.C)’+(A+B)’

27) Construct the truth tables for all basic logic gates.

28)Explain All Laws of the Boolean Algebra.