Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A student must draw the circuit for X = NOT ((A AND B) OR C). The student notices that an OR gate followed by a NOT gate is a NOR gate, and draws only two gates: an AND gate and a NOR gate.
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 gates. AND, OR and NOT: gates.
Step 2. The rows. X = 1 when (A AND B) OR C is 0. That needs C = 0, and A and B not both 1. The rows are 0 0 0, 0 1 0 and 1 0 0: rows.
Step 3. The student's circuit. It gives the same outputs, but the syllabus says circuits must be drawn for the statement given, without simplification. So it is not allowed: .
Watch out. Draw what the question gives. Simplify only when the question asks you to.
Answer: (a) . (b) . (c) .
Log in to join the discussion.
Loading…