Digital Electronics (III Semester)
Important Practice Question Bank
Legend
= Very Important (Repeated in many University/Autonomous exams)
= Important (Frequently asked)
= Expected
= Must Practice (Very high probability)
Boolean Algebra
• State DeMorgan's First and Second Theorems.
• State the Principle of Duality.
• Simplify F = A + AB + A B̅ using Boolean Laws.
• Simplify F = A + A̅ B.
• Implement all basic gates using NAND only.
• Implement all basic gates using NOR only.
SOP & POS
• Convert F = A + B'C into Canonical SOP. Practice similar Problems.
• Convert F = A'B + BC into Canonical POS. Practice similar Problems.
• Convert F = A + BC into Standard SOP. Practice similar Problems.
• Convert F = AB + C into Standard POS. Practice similar Problems.
4-variable K-map (Minimum SOP)
• F(A,B,C,D)=Σm(0,2,5,7,8,10,13,15)
• F(A,B,C,D)=Σm(1,3,4,5,9,11,12,13)
• F(A,B,C,D)=Σm(0,1,2,5,8,9,10,13)
• F(A,B,C,D)=Σm(4,5,6,7,12,13,14,15)
• F(A,B,C,D)=Σm(0,1,4,5,8,9,12,13)
• F(A,B,C,D)=Σm(2,3,6,7,10,11,14,15)
K-map with Don't Care
• Σm(0,2,5,7,8,10,13)+d(1,9,15)
• Σm(1,3,5,7,9,11)+d(0,2,8)
• Σm(4,5,6,7,12,13)+d(14,15)
POS using K-map
• ΠM(0,2,5,7,8,10,13,15)
• ΠM(1,3,4,5,9,11,12,13)
Quine-McCluskey
• Σm(0,1,2,5,6,7,8,9,10,14)
• Σm(1,3,7,8,9,11,15)
• Σm(0,2,5,7,8,10,13)+d(1,9,15)
Verilog HDL
• Write Verilog programs for AND, OR, NOT (Gate-Level).
• Write Verilog programs for XOR, XNOR (Dataflow).
• Write Behavioural model for NAND gate.
• Write Testbench for AND gate.
• Write Testbench for XOR gate.