Logic Gates

From TRCCompSci - AQA Computer Science
Jump to: navigation, search

TRC PowerPoint

Logic Gates

And Gates

The output of an AND gate is true only when all of the inputs are true. If one or more of an AND gate's inputs are false, then the output of the AND gate is false.

And gate.gif

Truth Table

A B Out
0 0 0
0 1 0
1 0 0
1 1 1

Boolean Equation

[math] A \cdot B[/math]

Or Gates

An OR gate is when either of the values can be true, and the output shall always be true in that instance. The images below shows what the OR gate looks like, and the table shows all possible outcomes.


Truth Table


Boolean Equation

[math] A + B[/math]

Not Gates

A NOT gate outputs the opposite of what is inputted. The image below shows a NOT gate, as well as all possible outcomes.


Boolean Equation

[math] \overline{A}[/math]


A NAND gate is an inverted AND gate meaning the inputs will cause an inverted outcome, so having no input will cause an output of 1, which is the opposite of an AND gate, which would be 0.

Nand Gate.png

Truth Table

Nand truth table.png

Boolean Equation

[math] \overline{A \cdot B}[/math]

NOR Gate

NOR Gate.png

A NOR gate is an inverted OR gate, so any input will cause an output of 0 and this is the opposite of a regular OR gate, which would give an output of 1.

Nor gate and truth table.png

Boolean Equation

[math] \overline{ A + B }[/math]

XOR Gate

An XOR gate is a variation of the OR gate, however, out of its two inputs, it will only give an output of 1 if only one of the inputs is 1, and an output of 0 if both are off or if both are on.

XOR Gate.png

Truth Table

Truth table xor.png

Boolean Equation

[math] A \oplus B[/math]

or alternatively:

[math] \overline{A} \cdot B + A \cdot \overline{B}[/math]