Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A gate has two inputs. Its output column, in the rows 0 0, 0 1, 1 0, 1 1, is 1, 0, 0, 0.
The gates are numbered 1 AND, 2 OR, 3 NAND, 4 NOR, 5 XOR. Give the number of the gate, and the number of rows in which it gives 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. Count the 1s. There is one. So the gate is AND or NOR.
Step 2. Where is it? The 1 is in the row 0 0. AND has its 1 in the row 1 1. So this is NOR, gate number .
Answer: gate , NOR, with row giving 1.
Log in to join the discussion.
Loading…