State the name of the logic gate with the symbol shown in Fig. 9.1.
[1]
(b)
State the name of the logic gate with the truth table shown in Table 9.1.
Table 9.1
input
output
0
1
1
0
[1]
(c)
Fig. 9.2 shows a digital circuit.
Complete the truth table in Table 9.2 for this circuit for all possible combinations of input.
Table 9.2
A
B
C
D
E
1
1
1
0
1
0
0
0
[4]
[Total: 6]
Show the mark scheme
These are the official mark-scheme rows. Each point that matches your answer earns a mark.
Tap the mark scheme to open it full size.
Show a worked answer
How to reach each mark, step by step. Try the question yourself first.
9(a)
The symbol is a NAND gate.
9(b)
The output is the opposite of the input, so it is a NOT gate.
9(c)
The first gate is OR, so $C$ is 1 if either input is 1. The second gate is AND, so $D$ is 1 only if both inputs are 1.
The final gate is NAND, so $E$ is 0 only when both $C$ and $D$ are 1.
In the first two rows, enter $(A, B, E) = (\mathbf{1}, \mathbf{1}, \mathbf{0})$ and $(\mathbf{0}, \mathbf{1}, \mathbf{1})$.
In the last two rows, enter $(A, B, E) = (\mathbf{1}, \mathbf{0}, \mathbf{1})$ and $(\mathbf{0}, \mathbf{0}, \mathbf{1})$. The middle two input pairs can be swapped.