Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A circuit has three inputs , and . Gate 1 is an AND gate with inputs and . Gate 2 is a NOT gate with input . Gate 3 is an OR gate whose inputs are the outputs of gates 1 and 2. The output is the output of gate 3. Write as an expression. Find the number of input patterns, out of , that give and the number that give .
A truth table has rows for inputs. NOT: . OR: . AND: . NAND: . NOR: . XOR: , which is when the inputs differ. De Morgan: and .
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 expression. .
Step 2. When is ? An OR gate gives only when both inputs are . So we need , which means , and , which means that and are not both . With there are four patterns of and , and one of them, , gives . So three patterns give : , and .
Step 3. When is ? The other patterns.
Answer: , with patterns that give and patterns that give .
Check. For , , : gate 1 gives , gate 2 gives , and gate 3 gives . It is one of the five.
Log in to join the discussion.
Loading…