"
Team:INSA Toulouse/contenu/project/binary reminder
From 2013.igem.org
(Difference between revisions)
Mesnageclem (Talk | contribs) |
Mesnageclem (Talk | contribs) |
||
| Line 113: | Line 113: | ||
<br> | <br> | ||
| - | <p class=" | + | <p class="texteright"><span class="spantitle">AND Gate</span></br> |
<br>For a AND gate, two inputs are needed to have a result egal 1.<p> | <br>For a AND gate, two inputs are needed to have a result egal 1.<p> | ||
| Line 121: | Line 121: | ||
<br> | <br> | ||
| - | <p class=" | + | <p class="texteright"><span class="spantitle">OR Gate</span></br> |
<br>For a OR gate, one or the other (or both) of the inputs are needed to have a result egal 1.<p> | <br>For a OR gate, one or the other (or both) of the inputs are needed to have a result egal 1.<p> | ||
| Line 129: | Line 129: | ||
<br> | <br> | ||
| - | <p class=" | + | <p class="texteright"><span class="spantitle">XOR Gate</span></br> |
<br>For a XOR gate, one or the other of the inputs are needed to have a result egal 1 but not both of them.<p> | <br>For a XOR gate, one or the other of the inputs are needed to have a result egal 1 but not both of them.<p> | ||
Revision as of 09:14, 20 August 2013
Binary Reminder
How to count with binary numbers?
For those who don’t remember (or who don’t have any idea of) binary courses, a little reminder about binary counting is here for you!
| Operation | Result | ||
| Decimal | 5 | 2 | 7 |
| Binary | 1 (1*2^2) 0 (0*2^1) 1 (1*2^0) |
0 (0*2^2) 1 (1*2^1) 0 (0*2^0) |
1 (1*2^2) 1 (1*2^1) 1 (1*2^0) |
What is a logic gate?
AND Gate
For a AND gate, two inputs are needed to have a result egal 1.
OR Gate
For a OR gate, one or the other (or both) of the inputs are needed to have a result egal 1.
XOR Gate
For a XOR gate, one or the other of the inputs are needed to have a result egal 1 but not both of them.
Full Adder
This is the truth table of a full adder.
