Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A logic analyser records X for every input pattern of A, B and C, from 0 0 0 up to 1 1 1: 0, 0, 0, 0, 0, 0, 1, 1.
Give each condition a letter and say what 1 means. and is AND, or is OR, not is NOT, but not both is XOR, neither nor is NOR. From a truth table: one AND term for each row with X = 1 (an input that is 0 gets NOT), joined by OR. Any expression with the same table is correct.
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 rows. X = 1 in 1 1 0 and 1 1 1: terms.
Step 2. The expression. X = (A AND B AND (NOT C)) OR (A AND B AND C).
Step 3. Shorter. In both rows A = B = 1, and C can be anything. So X = A AND B, one gate with inputs. Check: A AND B is 1 only in the last two rows.
Answer: (a) . (b) as above. (c) .
Log in to join the discussion.
Loading…