Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A ride at a fair can start (X = 1) only when three things are all true: the gate is closed (G = 1), every seat belt is fastened (F = 1) and the operator presses the start button (O = 1).
AND gives 1 only when both inputs are 1: X = A AND B, output column 0, 0, 0, 1. The rows of a truth table go in binary order: 0 0, 0 1, 1 0, 1 1. A gate in this syllabus has at most two inputs, so three conditions joined by AND need two AND gates.
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 gates. One AND gate joins G and F. A second AND gate joins that output with O. So X = (G AND F) AND O, with AND gates.
Step 2. The rows. Three inputs, each 0 or 1, give rows.
Step 3. The output. The ride starts only when all three inputs are 1. That is row, the last one.
Watch out. Do not draw one AND gate with three inputs. In this syllabus every gate except NOT has exactly two inputs.
Answer: (a) . (b) . (c) .
Log in to join the discussion.
Loading…