Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Mo copies a circuit from a textbook page and describes it in words: A goes into a NOT gate; B and C go into an XOR gate; the output of the NOT gate and the output of the XOR gate go into a NAND gate, whose output is X.
A logic expression and a logic circuit say the same thing. Draw one gate for each operator (NOT included), brackets first, the last operator as the output gate, exactly as written and without simplification. Every gate except NOT has two inputs. Read a circuit from the output back to the inputs.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The expression. X = (NOT A) NAND (B XOR C).
Step 2. The row 0 1 0. NOT A = 1. B XOR C = 1 XOR 0 = 1. Then 1 NAND 1 = .
Step 3. Count the rows. X = 0 only when NOT A = 1 and B XOR C = 1, so A = 0 and B differs from C. That is the rows 0 0 1 and 0 1 0. The other rows give X = 1.
| A B C | X |
|---|---|
| 0 0 0 | 1 |
| 0 0 1 | 0 |
| 0 1 0 | 0 |
| 0 1 1 | 1 |
| 1 0 0 | 1 |
| 1 0 1 | 1 |
| 1 1 0 | 1 |
| 1 1 1 | 1 |
Answer: (a) X = (NOT A) NAND (B XOR C). (b) . (c) .
Log in to join the discussion.
Loading…