Chapter 2 – Logic
Gates & Boolean Algebra
Easy
Level Questions (10 Questions)
These
questions primarily assess students’ Remembering and Understanding levels,
focusing on recall of definitions, basic explanations, and straightforward
identification or construction of truth tables and logic gates.
1.
Define digital logic. Explain the difference between positive and
negative logic conventions in digital systems. (5 Marks)
2.
What is a truth table? Explain its primary purpose in digital circuit
design. (5 Marks)
3.
Draw the logic symbol and write the truth table for a 2-input AND gate.
(5 Marks)
4.
Draw the logic symbol and write the truth table for a 2-input OR gate.
(5 Marks)
5.
Draw the logic symbol and write the truth table for a NOT gate. (5
Marks)
6.
Define a universal gate. Name the two universal gates and explain why
they are called "universal." (5 Marks)
7.
Draw the logic symbol and write the truth table for a 2-input NAND gate.
(5 Marks)
8.
Draw the logic symbol and write the truth table for a 2-input NOR gate.
(5 Marks)
9.
List any three fundamental postulates of Boolean Algebra.
(5 Marks)
10.
State the Idempotent Law and the Complementation Law of Boolean Algebra. (5 Marks)
Moderate
Level Questions (7 Questions)
These
questions primarily assess students’ Applying and Analyzing
levels, requiring them to apply concepts to solve problems, compare different
gate types, and simplify Boolean expressions.
1.
Implement a 2-input XOR gate using only NAND gates. Draw the logic
circuit diagram and show how its truth table is derived from the NAND gate
operations. (5 Marks)
2.
Compare and contrast the functionality of an Exclusive-OR gate and a
standard OR gate. Provide a practical scenario where an XOR gate would be more
appropriate than an OR gate. (5 Marks)
3.
State and prove De Morgan’s Theorem for two variables: (A + B)’ = A’B’.
Use a truth table for your proof. (5 Marks)
4.
Using Boolean Algebra theorems, simplify the
following Boolean expression: F = A + A’B. Show each step of your
simplification. (5 Marks)
5.
A logic circuit has three inputs A, B, and C. The output Y is HIGH only
when an odd number of inputs are HIGH.
o
Construct the truth table for this logic function.
o
Write the unsimplified Sum-of-Products Boolean
expression for Y. (5 Marks)
6.
Given the Boolean expression F = (A + B)(A’ +
C), simplify it using Boolean Algebra theorems. Draw the logic circuit for both
the original and the simplified expressions. (5 Marks)
7.
Explain how the Associative Law and Distributive Law of Boolean Algebra
are applied in simplifying complex digital circuits. Provide a simple example
for each law. (5 Marks)
