Question Bank-1
A. Objective Type Questions
1. The Boolean identity A + A’ = ?
(a) A (b) 1 (c) 0 (d) A’
2. The distributive law of Boolean algebra is:
(a) A + (B·C) = (A+B)·(A+C) (b) A·(B+C) = (A·B)+C
(c) A+B = A·B (d) None
3. The dual of A+0=A is:
(a) A·1=A (b) A+1=1 (c) A·0=0 (d) A+A=A
4. A logic circuit with only present input affecting the output is called:
(a) Sequential (b) Combinational (c) Feedback (d) Memory
5. Which gate gives output 1 only when all inputs are 0?
(a) AND (b) NOR (c) OR (d) XOR
6. A K-map with 3 variables has how many cells?
(a) 4 (b) 8 (c) 16 (d) 32
7. In Boolean algebra, A·0 = ?
(a) 0 (b) A (c) 1 (d) A’
8. The canonical SOP requires:
(a) All minterms contain all variables (b) Variables may be missing
(c) Only product terms (d) None
9. A Full Adder is a:
(a) Sequential circuit (b) Combinational circuit (c) Memory circuit (d) Counter
10. The simplest universal gate is:
(a) NAND (b) OR (c) AND (d) XOR
11. The output of XOR gate for A=1, B=1 is:
(a) 1 (b) 0 (c) A (d) B
12. The canonical SOP form requires:
(a) All minterms contain all variables (b) Some terms missing variables
(c) Only OR terms (d) None
13. A flip-flop is used for:
(a) Addition (b) Multiplication (c) Storage (d) Decoding
14. The output of AND gate is 1 only if:
(a) All inputs = 1 (b) All inputs = 0 (c) Any input = 1 (d) None
15. In Boolean algebra, A+1=:
(a) A (b) 1 (c) 0 (d) A’
16. The complement of 0 is:
(a) 1 (b) 0 (c) Undefined (d) None
17. A full adder has:
(a) 1 input, 2 outputs (b) 2 inputs, 1 output (c) 3 inputs, 2 outputs (d) None
18. A transducer converts:
(a) One form of energy into another (b) Data into code
(c) Mechanical to binary only (d) None
19. An active transducer:
(a) Needs external power (b) Produces output without external power ✅
(c) Cannot work independently (d) None
20. A passive transducer:
(a) Generates its own signal (b) Requires external power (c) Is always digital (d) None
21. What is the base of hexadecimal number system?
(a) 15
(b) 16
(c) 10
(d) None of above
22. What is the radix of octal number system?
(a) 8
(b) 7
(c) 9
d) 10
23. The expression Y=AB+BC+AC shows the _________ operation.
A. EX-OR
B. SOP
C. POS
D. NOR
24. The expression Y=(A+B)(B+C)(C+A) shows the ________operation.
A. AND
B. POS
C. SOP
D. NAND
25. The canonical sum of product form of the function y(A,B) = A + B is __________
A. AB + BB + A’A
B. AB + AB’ + A’B
C. BA + BA’ + A’B’
D. AB’ + A’B + A’B’
B. True/False Questions
A+A=A. ✅ True
A⋅0=A. ❌ False (Ans=0)
A+1=1. ✅ True
NAND is a universal gate. ✅ True
K-map reduces Boolean expressions. ✅ True
Flip-flop is sequential circuit. ✅ True
XOR output =1 for different inputs. ✅ True
NOR is universal gate. ✅ True
Canonical SOP uses all variables. ✅ True
Half adder is sequential. ❌ False (Combinational)
Combinational circuits have no memory. ✅ True
Sequential circuits have memory. ✅ True
A transducer converts energy. ✅ True
Active transducer needs external power. ❌ False
Passive transducer needs external power. ✅ True
Primary transducer senses input directly. ✅ True
Secondary transducer converts output of primary. ✅ True
Thermocouple is passive transducer. ❌ False (Active)
LVDT is active transducer. ❌ False (Passive)
Potentiometer is passive transducer. ✅ True
Strain gauge is passive transducer. ✅ True
Output of OR gate is 0 if all inputs=0. ✅ True
Truth table represents logic behavior. ✅ True
The Boolean identity A + A = A is true. Ans: True
In Boolean algebra, A·0 = A. Ans: False
XOR gate gives 1 for same inputs. Ans: False
K-map simplifies Boolean expressions. Ans: True
Flip-flops are combinational circuits. Ans: False
Binary number system is having radix 2. Ans True
C. One-Mark Questions
Define Boolean algebra.
State commutative law.
State associative law.
State distributive law.
Write De Morgan’s theorems.
What is a minterm?
What is a maxterm?
Define canonical SOP form.
Define canonical POS form.
Design a logic circuit for expression AB + C.
Simplify: A+A⋅B
Simplify: A⋅(A+B)
Define K-map.
How many cells in 3-variable K-map?
Write Boolean expression of XOR gate.
What is the output of NAND gate if inputs are 1,1?
Define combinational circuit.
Define sequential circuit.
Give one example of combinational circuit.
Give one example of sequential circuit.
Define latch.
Define flip-flop.
Define transducer.
Example of active transducer.
Example of passive transducer.
Example of primary transducer.
Example of secondary transducer.
D. 2.5 Marks Questions
State and prove De Morgan’s theorem with truth table.
Prove distributive law with truth table.
Simplify F(A,B,C)=Σ(1,2,3,5,7) using K-map.
Design half adder with truth table, and draw its logic circuit..
Explain full adder with truth table, and draw its logic circuit..
Difference between combinational and sequential circuits with the help of block
diagram
Define transducer and classify.
Difference between active and passive transducer with examples.
Difference between primary and secondary transducer with examples.
Solve the Boolean function: 𝒇(𝑨, 𝑩. 𝑪. 𝑫) = ∑𝒎(𝟏, 𝟑, 𝟕, 𝟏𝟏, 𝟏𝟓) + ∑𝒅(𝟎, 𝟐, 𝟓)using
K-Map.
Solve the minimal SOP using K-map.
Y ( A, B, C, D) m (1,5,6,12,13,14) d (2, 4)
Show the function A BC in standard/canonical SOP