<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en-GB">
	<id>https://alteeve.com/w/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://alteeve.com/w/index.php?action=history&amp;feed=atom&amp;title=Binary"/>
	<link rel="alternate" type="text/html" href="https://alteeve.com/w/index.php?title=Binary&amp;action=history"/>
	<updated>2026-05-23T18:02:30Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.42.3</generator>
	<entry>
		<id>https://alteeve.com/w/index.php?title=Binary&amp;diff=118&amp;oldid=prev</id>
		<title>Digimer: Created page with &#039;{{header}}  Binary is a form of counting that uses a base-2 system, a counting system with 2 digits. Binary uses only &#039;0&#039; and &#039;1&#039;, which relates to an electrical &#039;low&#039; (0) or…&#039;</title>
		<link rel="alternate" type="text/html" href="https://alteeve.com/w/index.php?title=Binary&amp;diff=118&amp;oldid=prev"/>
		<updated>2009-10-11T02:34:02Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;#039;{{header}}  Binary is a form of counting that uses a &lt;a href=&quot;/w/Base-2&quot; title=&quot;Base-2&quot;&gt;base-2&lt;/a&gt; system, a counting system with 2 digits. Binary uses only &amp;#039;0&amp;#039; and &amp;#039;1&amp;#039;, which relates to an electrical &amp;#039;low&amp;#039; (0) or…&amp;#039;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Páàjì titun&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{header}}&lt;br /&gt;
&lt;br /&gt;
Binary is a form of counting that uses a [[base-2]] system, a counting system with 2 digits. Binary uses only &amp;#039;0&amp;#039; and &amp;#039;1&amp;#039;, which relates to an electrical &amp;#039;low&amp;#039; (0) or &amp;#039;high&amp;#039; (1) signal. This can conceptually be extended to &amp;#039;false&amp;#039; (0) or &amp;#039;true&amp;#039; (1).&lt;br /&gt;
&lt;br /&gt;
In computing, binary is used for all forms of calculations. Larger values are expressed as being &amp;#039;X-bits&amp;#039;, where &amp;#039;X&amp;#039; is the number of &amp;#039;BInary digiTs&amp;#039; used to create the value. Modern computers generally use multiples of &amp;#039;8&amp;#039; bits, as 8 bits are referred to as a [[byte]], or the smallest really usable unit. &lt;br /&gt;
&lt;br /&gt;
A string of bits are given a relative value, where each subsequent bit is given twice the value as the bit beside it. Which side of the string of bits we start counting from is called &amp;#039;[[Endianess]]&amp;#039;, and is either &amp;#039;[[Big Endian]]&amp;#039;, where the [[LSB|least significant bit]] (smallest value bit) is on the left side of the string, or &amp;#039;[[Little Endian]]&amp;#039;, where the least significant bit in on the right side. For the rest of this article, we will be using &amp;#039;Little Endian&amp;#039; in out examples.&lt;br /&gt;
&lt;br /&gt;
For the sake of humans, a table called &amp;#039;[[Hexadecimal]]&amp;#039; was created to more easily represent a collection of four bits as a value between [0-9,a-f]. These four bits are themselves referred to as a [[nibble]]. This is a rarely used term however, because for practical purposes, the sixteen values represented is just too small to represent enough data.&lt;br /&gt;
&lt;br /&gt;
To allow for a more usable set of values, 8-bit strings where used to represent 255 possible strings, and these combinations of 8 bits were referred to as 1 byte; The smallest effective unit of storage used by modern computers.&lt;br /&gt;
&lt;br /&gt;
In the early days of computing, a common standard called [[ASCII]] was created using the lower 128 possible combinations of these 255 possibly combinations of zeros and ones. This ranged from 0 (binary: 0000 0000) to 127 (binary: 0111 1111). The upper 128 possible combinations where left for vendor-specific definitions.&lt;br /&gt;
&lt;br /&gt;
In this way, operating systems that supported the ASCII standard could understand one another&amp;#039;s basic data. These lower 128 possible combinations of binary data would always represent the same things on all the different systems! &lt;br /&gt;
&lt;br /&gt;
For example, the character capital &amp;#039;A&amp;#039; is represented as the binary value &amp;#039;0100 0001&amp;#039; (Hex: &amp;#039;41&amp;#039;), which is the 101st combination on the ASCII table. Alternatively, lower-case &amp;#039;a&amp;#039; is represented as the binary value &amp;#039;0110 0001&amp;#039; (Hex: &amp;#039;61&amp;#039;), which is in turn the 141st possible combination on the ASCII table. &lt;br /&gt;
&lt;br /&gt;
As a side note, this is why to a computer, capital &amp;#039;A&amp;#039; and lower-case &amp;#039;a&amp;#039; are not the same thing. A computer sees two different binary values!&lt;br /&gt;
&lt;br /&gt;
{{footer}}&lt;/div&gt;</summary>
		<author><name>Digimer</name></author>
	</entry>
</feed>