Professional Documents
Culture Documents
Situations to explain states What is a logic Gate What is a Truth Table The three different gates Building Truth Tables
Situation
Lets say your friends have asked you to go to the cinema with them but your mum will only allow you to go if you have finished your homework and cleared up your room. In this situation we have the following states
1. Homework done or homework not done 2. Room cleared up and room not cleared up
We know that the states will effect the output of going to the cinema or not
INPUTS
POSSIBLE OUTPUTS
DONE
NOT DONE
Example
Taking the example of above; lets say youve done your homework but you have not cleared up your room what would the output be?
INPUTS OUTPUT
DONE
NOT DONE
States
So from the above example we could see that the states effect the output that we will receive.
As we already know a computer can only understand binary which is 1s (on) and 0s (off)
Hence logic gates are used to be able to conduct similar situations
Logic gates are found in our computers They are electronic devices used to control the flow of data
When data passes through a logic gate it changes its state, this change depends on the input
Many logic gates could be joined together to form a logic circuit, the function of this circuit is more complicated than a single logic gate
A Truth Table is basically the table that shows all the possible inputs and the outputs of the logic gate If we take the example of the cinema once again we would have the following table
Homework Not Done Not Done Done Done Cleared Up Not Done Done Not Done Done Cinema No No No Yes
Truth Tables
As we know computers will not understand the truth table on the previous page why is this? A truth table from an actual computerised logic gate would look like the following
Homework 0 0 1 1 Cleared Up 0 1 0 1 Cinema 0 0 0 1
Homework 0 0 1 1
Cleared Up 0 1 0 1
Cinema 0 0 0 1
We will be learning 1. The symbol used 2. The number of inputs 3. Their truth tables 4. The different outputs
The NOT gate can only have ONE input and ONE output
A X
Since computers only understand 1s and 0s there could be only two (21) possible inputs and outputs for this gate The truth table shows this
Input
Output
A
0 1
X
1 0
Outputs
The NOT gate basically outputs the opposite of its inputs Hence if the input is 1 the output would be 0
Example
A good example is a switch as it can either be on or off hence it can only have one input
0 1
0 1
The OR Gate
The OR gate can only have TWO inputs and ONE output
A B X
The OR Gate
Since computers only understand 1s and 0s there could be four (22) possible inputs and outputs for this gate
The truth table shows this Input Output
A 0 0 B 0 1 X 0 1
Outputs
The OR gate only gives an output of 1 if at least one of its inputs is 1 So if both inputs are 0 the output would be 0 but if both inputs are 1 the output would be 1
Example
The AND gate can only have TWO inputs and ONE output
A B X
The OR Gate
Since computers only understand 1s and 0s there could be four (22) possible inputs and outputs for this gate
The truth table shows this Input Output
A B X
0
0 1
0
1 0
0
0 0
Outputs
The AND gate only gives an output of 1 if both inputs are 1 So if an inputs 1 and the other input is 0 the output would be 0 but if both inputs are 1 the output would be 1
Example
Lets say we want to draw a truth table from the following logic circuit
A B
Step 1
Label all the possible outputs in the logic circuit. In this case we have 3 inputs and there are 3 logic gates. Each logic gates output must be labeled;
D
F
Step 2
Determine the possible number of combinations. In this case its 23=8. So all the labels (both inputs and outputs are listed down with 8 spaces A B C D E F underneath each label).
A AND B NOT C D OR E
Step 3
Fill in the possible combinations underneath the original inputs. Always start from the last input (C) with alternate 0s and 1s
A B C D A AND B 0 0 0 0 1 1 0 0 1 1 0 0 0 1 0 1 0 1 E NOT C F D OR E
1
1
1
1
0
1
Step 4
0
0 0 1 1 1 1
0
1 1 0 0 1 1
1
0 1 0 1 0 1
0
0 0 0 0 1 1
0
1 0 1 0 1 0
0
1 0 1 0 1 1