<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.paulbui.net/wiki/index.php?action=history&amp;feed=atom&amp;title=Binary</id>
	<title>Binary - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://www.paulbui.net/wiki/index.php?action=history&amp;feed=atom&amp;title=Binary"/>
	<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=Binary&amp;action=history"/>
	<updated>2026-08-08T09:22:04Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.31.8</generator>
	<entry>
		<id>https://www.paulbui.net/wiki/index.php?title=Binary&amp;diff=858&amp;oldid=prev</id>
		<title>PaulClayberg: /* Binary */</title>
		<link rel="alternate" type="text/html" href="https://www.paulbui.net/wiki/index.php?title=Binary&amp;diff=858&amp;oldid=prev"/>
		<updated>2008-09-19T17:14:02Z</updated>

		<summary type="html">&lt;p&gt;‎&lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;Binary&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== Binary ==&lt;br /&gt;
Binary code, or &amp;#039;&amp;#039;&amp;#039;Machine Code&amp;#039;&amp;#039;&amp;#039;, is the basic, lowest level of communication of data used by computers. It consists of a given number of &amp;#039;&amp;#039;bytes&amp;#039;&amp;#039; which contain 8 &amp;#039;&amp;#039;bits&amp;#039;&amp;#039;, or places, each. Binary is base 2 of a number, where all place values are powers of the number 2. For example, the number 3 in binary is 00000011&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;, because there is one &amp;#039;&amp;#039;2&amp;#039;&amp;#039; plus one &amp;#039;&amp;#039;1&amp;#039;&amp;#039;. Notice how 8 &amp;#039;&amp;#039;bits&amp;#039;&amp;#039; are used.&lt;br /&gt;
&lt;br /&gt;
=== 2&amp;#039;s Complement ===&lt;br /&gt;
To represent negative integers, &amp;#039;&amp;#039;&amp;#039;2&amp;#039;s complement&amp;#039;&amp;#039;&amp;#039; is used. This is formed by flipping every bit (&amp;#039;&amp;#039;1&amp;#039;s compliment&amp;#039;&amp;#039;) and adding 1.&lt;br /&gt;
For example:&lt;br /&gt;
:To find -3&amp;lt;sub&amp;gt;10&amp;lt;/sub&amp;gt; in base 2:&lt;br /&gt;
:3&amp;lt;sub&amp;gt;10&amp;lt;/sub&amp;gt; = 00000011&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;&lt;br /&gt;
:One&amp;#039;s complement: 11111100&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;&lt;br /&gt;
:Add one: 11111101&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;&lt;br /&gt;
:&amp;amp;there4; -3&amp;lt;sub&amp;gt;10&amp;lt;/sub&amp;gt; = 11111101&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;&lt;br /&gt;
:Q.E.D.&lt;/div&gt;</summary>
		<author><name>PaulClayberg</name></author>
		
	</entry>
</feed>