J277 Boolean Logic
J277 Boolean Logic
I am confident
I am confident now I have I still need to
before I start completed work on this
this workbook this workbook area
Construct truth tables for the
following logic gates: NOT, AND and
OR
Construct truth tables for simple logic
circuits using combinations of NOT,
AND and OR
Create, modify and interpret simple
logic circuit diagrams
Create and interpret simple Boolean
expressions made up of NOT, AND
and OR
Table of Contents
Knowledge Checklist ............................................................................................... 2
Boolean Logic .......................................................................................................... 3
The AND logic gate .............................................................................................. 3
The OR logic gate ................................................................................................ 4
The NOT logic gate .............................................................................................. 5
Logic circuits ............................................................................................................. 6
Solving logic circuits ............................................................................................. 9
• AND
• OR
• NOT
Logic gates work by taking some form of input on the left-hand side,
processing these inputs through the gate and delivering an output on the
right-hand side. Usually these are represented by a 1 or a 0 to represent true
or false.
This can be shown using a simple truth table. In order to draw a truth table
we need to name the inputs and outputs on the logic gate first and this is
usually done with letters of the alphabet.
A B Z
0 0
0 1
1 0
1 1
As you can see in the table above we have used binary counting to fill in the
first two columns. This ensures we have covered every combination of the 0
and 1 digits possible with two columns. Remember: 0 is classed as false and 1
is true.
A B Z
0 0 0
0 1 1
1 0 1
1 1 1
In this truth table there are fewer columns and rows as there is only one input
which has two possible states: 0 or 1.
A Z
0 1
1 0
Gate Name A B Z
Gate Name A Z
Gate Name A B Z
Here we have an AND gate and a NOT gate joined together. To solve this
problem start from the inputs on the left and work across the diagram. We
start with the inputs A and B and use binary counting to populate the table
showing all the variants possible. Once we know the inputs we can work out
the Z output which is an AND logic gate. Once we have the Z column
completed we can work out the Y column which is using a NOT gate (flipping
the 1’s to 0 and the 0’s to 1).
Here we can see the truth table for the above logic circuit.
A B Z Y
0 0 0 1
0 1 0 1
1 0 0 1
1 1 1 0
A B Z Y
Here we have A and B using an AND logic gate giving the output X and C
going through a NOT logic gate giving the output Y. X and Y are then passed
through an OR logic gate to give the final output Z.
This is a larger truth table than we have used before as we have three inputs.
Again, use binary counting to populate the inputs of the table as this will
ensure that every possible combination is covered. Next go through the two
left hand truth tables first. Start with the top one (the AND gate) and fill in the
X column using A and B as the inputs. Next go through the Y column (the
NOT gate) using C as the input and then finally go through the Z column (the
OR gate) using the X and Y columns as inputs.
Task 3: Complete the truth table for the logic circuit shown
below. We have filled in the A, B and C inputs for you.
A B C X Y Z
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
A B C D X Y Z
To solve this problem, you need to find out the answer to the NOT logic gate
which would be 0. Then you use that and the other input with the AND logic
gate which would give you 0 as the output.
(A AND B) OR (C AND D)
Here we have brackets and these show use the individual logic gates.
The next step would be to join these, and we can see from the statement
that they are joined by an OR gate.
When dealing with brackets start from the inner set and work outwards in the
same way you would do this with a maths equation. For instance, in the
following example:
(A OR B) AND (NOT (C OR D)
A B C X Y Z