"
Team:INSA Toulouse/contenu/project/binary reminder
From 2013.igem.org
(Difference between revisions)
Mesnageclem (Talk | contribs) |
Mesnageclem (Talk | contribs) |
||
| Line 50: | Line 50: | ||
.imgcontent{margin: 0 0 45px 0; border: 1px solid #e5e6e6;} | .imgcontent{margin: 0 0 45px 0; border: 1px solid #e5e6e6;} | ||
| - | .imgcontentright{margin: 0 | + | .imgcontentright{margin: 0 0 45px 10px; border: 1px solid #e5e6e6;float:right;} |
| - | .imgcontentleft{margin: 0 10px 45px | + | .imgcontentleft{margin: 0 10px 45px 0; border: 1px solid #e5e6e6;float:left;} |
.tablecontent{ | .tablecontent{ | ||
| Line 118: | Line 118: | ||
<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> | ||
| - | <img src="https://static.igem.org/mediawiki/2013/2/2a/AND_Gate_-_30%2C5%25.png" class=" | + | <img src="https://static.igem.org/mediawiki/2013/2/2a/AND_Gate_-_30%2C5%25.png" class="imgcontentleft" /> |
<img src="https://static.igem.org/mediawiki/2013/7/75/AND_Truthtable_-_30%2C5%25.png" class="imgcontentright" /> | <img src="https://static.igem.org/mediawiki/2013/7/75/AND_Truthtable_-_30%2C5%25.png" class="imgcontentright" /> | ||
| Line 129: | Line 129: | ||
<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> | ||
| - | <img src="https://static.igem.org/mediawiki/2013/2/2e/OR_Gate_-_30%2C5%25.png" class=" | + | <img src="https://static.igem.org/mediawiki/2013/2/2e/OR_Gate_-_30%2C5%25.png" class="imgcontentleft" /> |
<img src="https://static.igem.org/mediawiki/2013/8/8d/OR_Truthtable_-_30%2C5%25.png" class="imgcontentright" /> | <img src="https://static.igem.org/mediawiki/2013/8/8d/OR_Truthtable_-_30%2C5%25.png" class="imgcontentright" /> | ||
| Line 139: | Line 139: | ||
<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> | ||
| - | <img src="https://static.igem.org/mediawiki/2013/7/77/XOR_Gate_-_30%2C5%25.png" class=" | + | <img src="https://static.igem.org/mediawiki/2013/7/77/XOR_Gate_-_30%2C5%25.png" class="imgcontentleft" /> |
<img src="https://static.igem.org/mediawiki/2013/7/71/XOR_Truthtable_-_30%2C5%25.png" class="imgcontentright" /> | <img src="https://static.igem.org/mediawiki/2013/7/71/XOR_Truthtable_-_30%2C5%25.png" class="imgcontentright" /> | ||
Revision as of 13:58, 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.
