Team:INSA Toulouse/contenu/project/binary reminder

From 2013.igem.org

(Difference between revisions)
Line 113: Line 113:
<br>
<br>
-
   <p class="texteright"><span class="spantitle">AND Gate</span></br>
+
   <p class="texteleft"><span class="spantitle">AND Gate</span></br>
<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="imgcontentleft" />
+
   <img src="https://static.igem.org/mediawiki/2013/2/2a/AND_Gate_-_30%2C5%25.png" class="imgcontentright" />
-
   <img src="https://static.igem.org/mediawiki/2013/7/75/AND_Truthtable_-_30%2C5%25.png" class="imgcontentleft" />
+
   <img src="https://static.igem.org/mediawiki/2013/7/75/AND_Truthtable_-_30%2C5%25.png" class="imgcontentright" />
Line 124: Line 124:
<br>
<br>
-
   <p class="texteright"><span class="spantitle">OR Gate</span></br>
+
   <p class="texteleft"><span class="spantitle">OR Gate</span></br>
<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="imgcontentleft" />
+
   <img src="https://static.igem.org/mediawiki/2013/2/2e/OR_Gate_-_30%2C5%25.png" class="imgcontentright" />
-
   <img src="https://static.igem.org/mediawiki/2013/8/8d/OR_Truthtable_-_30%2C5%25.png" class="imgcontentleft" />
+
   <img src="https://static.igem.org/mediawiki/2013/8/8d/OR_Truthtable_-_30%2C5%25.png" class="imgcontentright" />
<div class="clear"></div>
<div class="clear"></div>
<br>
<br>
-
   <p class="texteright"><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 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="imgcontentleft" />
+
   <img src="https://static.igem.org/mediawiki/2013/7/77/XOR_Gate_-_30%2C5%25.png" class="imgcontentright" />
-
   <img src="https://static.igem.org/mediawiki/2013/7/71/XOR_Truthtable_-_30%2C5%25.png" class="imgcontentleft" />
+
   <img src="https://static.igem.org/mediawiki/2013/7/71/XOR_Truthtable_-_30%2C5%25.png" class="imgcontentright" />
<div class="clear"></div>
<div class="clear"></div>
<br>
<br>
-
   <p class="texteleft"><span class="spantitle">Full Adder</span></br>
+
   <p class="texteright"><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>
-
   <img src="https://static.igem.org/mediawiki/2013/5/52/Table_vérité_addition_-_200px.png" class="imgcontentright" />
+
   <img src="https://static.igem.org/mediawiki/2013/5/52/Table_vérité_addition_-_200px.png" class="imgcontentleft" />
<div class="clear"></div>
<div class="clear"></div>

Revision as of 13:54, 20 August 2013

logo


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.