Presentation of Logic Gates
Presentation of Logic Gates
Hamza Tanveer
This gate gives high output (1) if all the inputs are 1’s. otherwise the output will be low (0).
A B C
0 0 0
0 1 0
1 0 0
1 1 1
The NAND gate works opposite to the AND gate. Its Boolean algebra representation is: C=(A.B)’
And it’s truth table and schema as following:
A B C
0 0 1
0 1 1
1 0 1
1 1 0
This circuit will give high output (1) if any input is high (1).
A B C
0 0 1
0 1 0
1 0 0
1 1 0
NOT gate
This is the simplest gate it just inverts the input, if the input is high the output will be low and conversely.
So B=A’
A B
0 1
1 0
In EWB, draw the following two circuits and fill the truth table below
A B A.B (A.B)’
0 0
0 1
1 0
1 1
In EWB, draw the following circuit and fill the truth table
A B (A.B)’
0 0
0 1
1 0
1 1
The OR and NOR gates
In EWB, draw the following two circuits and fill the truth table below
A B A+B (A+B)’
0 0
0 1
1 0
1 1
The NOR-NOT combination
A B ((A+B)’)’
0 0
0 1
1 0
1 1
The logic converter can be found in the Instruments toolbox. It can be used to derive a truth table from a
circuit schematic:
1. Attach the input terminals of the logic converter to up to eight input points in the circuit.
2. Connect the single output of the circuit to the output terminal on the logic converter icon.
The truth table for the circuit appears in the logic converter's display.
In the following circuit, we will be examining the AND gate. The two inputs of the gate are attached the A
and B inputs of the logic converter. The circuit output C is connected to Out line of the logic converter.
After clicking on the Truth Table button of the logic converter, the logic converter tries
all possible combinations of the circuit input and derives its truth table.
Repeat what you did in task 5 for the NOR gate. Show your connections in the circuit below.
A B A+B (A+B)’
0 0
0 1
1 0
1 1
A B C D
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Finding the truth table of a given circuit using the logic converter