"
Team:INSA Toulouse/contenu/project/binary reminder
From 2013.igem.org
| Line 86: | Line 86: | ||
<h2 class="title2">How to count with binary numbers?</h2> | <h2 class="title2">How to count with binary numbers?</h2> | ||
| - | <p class="texte">For those who don’t remember (or who don’t have any idea | + | <p class="texte">For those who don’t remember your binary counting courses (or for those who don’t have any idea about binary counting), we provide a little reminder!</p> |
<img src="https://static.igem.org/mediawiki/2013/3/3f/Binary_decimal.png" class="imgcontent" /> | <img src="https://static.igem.org/mediawiki/2013/3/3f/Binary_decimal.png" class="imgcontent" /> | ||
| Line 113: | Line 113: | ||
<h2 class="title2">What is a logic gate?</h2> | <h2 class="title2">What is a logic gate?</h2> | ||
<br> | <br> | ||
| - | < | + | <p class="texte">A logic gate is an idealized or physical device implementing a Boolean function, that is, it performs a logical operation on one or more logical inputs, and produces a single logical output (From Wikipedia). Simply said: logic gates are the devices that perform the boolean logic operations</p> |
<p class="texteleft"><span class="spantitle">AND Gate</span></br> | <p class="texteleft"><span class="spantitle">AND Gate</span></br> | ||
| - | + | <br>For an AND gate, if the two inputs are equal to 1, the result equals 1.<p> | |
| - | <br>For | + | |
<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/2/2a/AND_Gate_-_30%2C5%25.png" class="imgcontentleft" /> | ||
| Line 127: | Line 126: | ||
<p class="texteleft"><span class="spantitle">OR Gate</span></br> | <p class="texteleft"><span class="spantitle">OR Gate</span></br> | ||
| - | <br>For | + | <br>For an OR gate, if one or the other (or both) of the inputs are equal to 1, the result equals 1.<p> |
<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/2/2e/OR_Gate_-_30%2C5%25.png" class="imgcontentleft" /> | ||
| Line 137: | Line 136: | ||
<p class="texteleft"><span class="spantitle">XOR Gate</span></br> | <p class="texteleft"><span class="spantitle">XOR Gate</span></br> | ||
| - | <br>For a XOR gate, one or the other of the inputs are | + | <br>For a XOR gate, if one or the other (but not both of them) of the inputs are equal to 1, the result equals 1.<p> |
<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/77/XOR_Gate_-_30%2C5%25.png" class="imgcontentleft" /> | ||
Revision as of 07:46, 27 September 2013
Binary Reminder
How to count with binary numbers?
For those who don’t remember your binary counting courses (or for those who don’t have any idea about binary counting), we provide a little reminder!
| 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?
A logic gate is an idealized or physical device implementing a Boolean function, that is, it performs a logical operation on one or more logical inputs, and produces a single logical output (From Wikipedia). Simply said: logic gates are the devices that perform the boolean logic operations
AND Gate
For an AND gate, if the two inputs are equal to 1, the result equals 1.
OR Gate
For an OR gate, if one or the other (or both) of the inputs are equal to 1, the result equals 1.
XOR Gate
For a XOR gate, if one or the other (but not both of them) of the inputs are equal to 1, the result equals 1.
Full Adder
This is the truth table of a full adder.
