The image presents a set of questions from a Grade 11 Information and Communication Technology exam. I will solve question (iv) - Construct the Boolean expression for the logic circuit and draw the truth table as well.
2025/7/30
1. Problem Description
The image presents a set of questions from a Grade 11 Information and Communication Technology exam. I will solve question (iv) - Construct the Boolean expression for the logic circuit and draw the truth table as well.
2. Solution Steps
The logic circuit consists of NAND gates and an OR gate. Let's trace the circuit to determine the Boolean expression.
Let and be the inputs.
The first NAND gate has inputs and . The output of the first NAND gate is .
The second NAND gate has inputs and . The output of the second NAND gate is .
The third NAND gate has inputs and . The output of the third NAND gate is .
The output of the first NAND gate and the third NAND gate are sent as inputs to the lower AND gate which then undergoes a NOT process. Therefore, . Applying DeMorgan's law to inside the NOT we have .
The output of the second NAND gate and the third NAND gate are sent as inputs to the upper AND gate which then undergoes a NOT process. Therefore, . Applying DeMorgan's law to inside the NOT we have .
The last OR gate has inputs and . Therefore, the output is . This simplifies to .
Boolean expression:
Truth table:
| x | y | x * y | x + y + (x*y) |
|---|---|-------|---------------|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 |
3. Final Answer
Boolean expression:
Truth table:
| x | y | x * y | x + y + (x*y) |
|---|---|-------|---------------|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 |