"
Team:INSA Toulouse/contenu/project/binary reminder
From 2013.igem.org
(Difference between revisions)
Mesnageclem (Talk | contribs) |
Mesnageclem (Talk | contribs) |
||
| Line 99: | Line 99: | ||
<td style="border-right:1px solid #e5e6e6;">Decimal</td> | <td style="border-right:1px solid #e5e6e6;">Decimal</td> | ||
<td style="border-right:1px solid #e5e6e6;">5</td> | <td style="border-right:1px solid #e5e6e6;">5</td> | ||
| - | < | + | <tdstyle="border-right:1px solid #e5e6e6;">2</td> |
<td>7</td> | <td>7</td> | ||
</tr> | </tr> | ||
Revision as of 08:34, 14 August 2013
Project
Binary Reminder
How to count with binary numbers?
For those who doesn’t remember (or who doesn’t have any idea of) binary courses, a little reminder about binary counting is here for you!
| Operation | Result | ||
| Decimal | 5 | 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.
