Team:INSA Toulouse/contenu/project/binary reminder
From 2013.igem.org
(Difference between revisions)
Mesnageclem (Talk | contribs) |
Mesnageclem (Talk | contribs) |
||
Line 35: | Line 35: | ||
.texteright500{color:#5a6060; font-family:'Open Sans'; font-size:14px; display:block; float:right; width:500px; margin:0 0 50px 0;} | .texteright500{color:#5a6060; font-family:'Open Sans'; font-size:14px; display:block; float:right; width:500px; margin:0 0 50px 0;} | ||
+ | |||
+ | .texteright450{color:#5a6060; font-family:'Open Sans'; font-size:14px; display:block; float:right; width:450px; margin:0 0 50px 0;} | ||
.spantitle{color:#5a6060; font-family:'Open Sans'; font-weight:600; font-size:18px;} | .spantitle{color:#5a6060; font-family:'Open Sans'; font-weight:600; font-size:18px;} | ||
Line 48: | 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 10px 45px 10px; border: 1px solid #e5e6e6;float:right;} |
.imgcontentleft{margin: 0 10px 45px 10px; border: 1px solid #e5e6e6;float:left;} | .imgcontentleft{margin: 0 10px 45px 10px; border: 1px solid #e5e6e6;float:left;} | ||
Line 144: | Line 146: | ||
<br> | <br> | ||
- | <p class=" | + | <p class="texteright450"><span class="spantitle">Full Adder</span></br> |
<br>This is the truth table of a full adder.<p> | <br>This is the truth table of a full adder.<p> | ||
Revision as of 13:56, 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.