Review the key concepts, formulae, and examples before starting your quiz.
🔑Concepts
Digital signals are discrete signals having only two possible levels, represented as 'High' (Logic ) or 'Low' (Logic ).
A Logic Gate is a digital circuit that follows a logical relationship between the input and output voltages.
The OR Gate: The output is if either input or input (or both) are . It follows the Boolean expression .
The AND Gate: The output is only if both inputs and are . It follows the Boolean expression .
The NOT Gate: It is an inverter that produces an output which is the complement of the input . It follows the Boolean expression .
The NAND Gate: It is a combination of an AND gate followed by a NOT gate. The output is only when all inputs are . Expression: .
The NOR Gate: It is a combination of an OR gate followed by a NOT gate. The output is only when all inputs are . Expression: .
Universal Gates: NAND and NOR gates are called universal gates because any logic gate (AND, OR, NOT) can be realized using only NAND or only NOR gates.
De Morgan's First Theorem: The complement of a product is equal to the sum of the complements: .
De Morgan's Second Theorem: The complement of a sum is equal to the product of the complements: .
📐Formulae
💡Examples
Problem 1:
Construct the truth table for the logic circuit where a NAND gate's output is fed into both inputs of another NAND gate.
Solution:
Let the first NAND gate have inputs and . Its output is . This output is fed into both inputs of a second NAND gate. The final output is .
Explanation:
By connecting the two inputs of a NAND gate together, it functions as a NOT gate. Therefore, a NAND followed by a NOT (acting NAND) results in an AND operation.
Problem 2:
Identify the logic gate that corresponds to the following truth table: Input ; ; ; .
Solution:
The output is only when both inputs are . This matches the Boolean expression , which is the NOR gate.
Explanation:
In an OR gate, the outputs would be . Inverting these results (NOT-OR) gives , which matches the given table.
Problem 3:
Using De Morgan's theorem, simplify the Boolean expression .
Solution:
According to De Morgan's second theorem, . Let and . Then, . Since double inversion cancels out, and . Thus, .
Explanation:
This shows that a NOR gate with inverted inputs behaves exactly like an AND gate.