Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Complete the truth table for X = (A NOR B) OR (A AND B). Use a working column P for A NOR B and Q for A AND B.
X = 1?X when A = 0 and B = 1?X = 1?A truth table has 2, 4 or 8 rows for 1, 2 or 3 inputs, filled in binary order (0 0 0, 0 0 1, ... 1 1 1). Add a working column for each gate, then the output. To name a two-input gate from its column, count the 1s and see where they are.
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 working columns. P = A NOR B is 1, 0, 0, 0. Q = A AND B is 0, 0, 0, 1.
Step 2. The table.
| A B | P Q | X = P OR Q |
|---|---|---|
| 0 0 | 1 0 | 1 |
| 0 1 | 0 0 | 0 |
| 1 0 | 0 0 | 0 |
| 1 1 | 0 1 | 1 |
X = 1 in rows.
Step 3. The row 0 1. P = 0 and Q = 0, so X = 0.
Step 4. The pattern. X is 1 when both inputs are the same. The column 1, 0, 0, 1 is the XOR column turned over.
Answer: (a) . (b) . (c) The two inputs are equal.
Log in to join the discussion.
Loading…