"
Team:INSA Toulouse/contenu/project/binary reminder
From 2013.igem.org
(Difference between revisions)
Mesnageclem (Talk | contribs) |
|||
| Line 88: | Line 88: | ||
<p class="texte">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!</p> | <p class="texte">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!</p> | ||
| - | <img src="https://static.igem.org/mediawiki/2013/ | + | <img src="https://static.igem.org/mediawiki/2013/3/3f/Binary_decimal.png" class="imgcontent" /> |
<table class="tablecontent"> | <table class="tablecontent"> | ||
Revision as of 08:01, 20 September 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.
