Bitstring - Revision history

Rgrig: selective merge into "Bit array"

2009-04-12T00:12:59Z

selective merge into "Bit array"

← Previous revision		Revision as of 00:12, 12 April 2009
Line 1:		Line 1:
			#REDIRECT [[Bit array]] {{R from merge}}
	A '''bitstring''' is a sequence of [[bit]]s. Anything on a [[discrete computer]] can be represented by a bitstring. In particular, any discrete computer can be encoded in a bitstring, usually called a [[software program]]. Many mathematical structures can also be represented by bitstrings.

	While every conceivable type of data in today's [[computer memory\|memory device]]s is indeed stored as a sequence of ONs and OFFs or zeros and ones is indeed a [[String (computer science)\|string]] of bits, (ex. '7'<sub>10</sub> == '0111'<sub>2</sub>) bitstrings in the strict sense are used when grouping and packing [[boolean]] [[Flag (computing)\|flag]]s in a memory-efficient way. The state of one flag can be set or read using a [[bit mask]].

	== See also ==

	* [[Binary numeral system]]
	* [[Bitstream]]

	[[Category:Computer data]]
	[[Category:Bit data structures]]

	[[de:Bitstring]]


	{{comp-sci-stub}}

2008-04-26T20:58:57Z

Removed category "Data structures"; Quick-adding category "Bit data structures" (using HotCat)

← Previous revision		Revision as of 20:58, 26 April 2008
Line 8:		Line 8:
	* [[Bitstream]]		* [[Bitstream]]

⚫	[[Category:~~Data~~ structures]]
	[[Category:Computer data]]		[[Category:Computer data]]
		⚫	[[Category:Bit data structures]]

	[[de:Bitstring]]		[[de:Bitstring]]

2007-11-13T18:32:33Z

Undid revision 170107489 by 89.100.196.151 (talk)

2007-11-08T15:20:36Z

2007-06-18T11:31:35Z

Updated categories, tidying

← Previous revision		Revision as of 11:31, 18 June 2007
Line 3:		Line 3:
	While every conceivable type of data in today's [[computer memory\|memory device]]s is indeed stored as a sequence of ONs and OFFs or zeros and ones is indeed a [[String (computer science)\|string]] of bits, (ex. '7'<sub>10</sub> == '0111'<sub>2</sub>) bitstrings in the strict sense are used when grouping and packing [[boolean]] [[Flag (computing)\|flag]]s in a memory-efficient way. The state of one flag can be set or read using a [[bit mask]].		While every conceivable type of data in today's [[computer memory\|memory device]]s is indeed stored as a sequence of ONs and OFFs or zeros and ones is indeed a [[String (computer science)\|string]] of bits, (ex. '7'<sub>10</sub> == '0111'<sub>2</sub>) bitstrings in the strict sense are used when grouping and packing [[boolean]] [[Flag (computing)\|flag]]s in a memory-efficient way. The state of one flag can be set or read using a [[bit mask]].

	''See also~~'': [[binary~~ ~~system]]~~		== See also ==

			* [[Binary numeral system]]
	[[Category:Information technology]]
			* [[Bitstream]]

			[[Category:Data structures]]
			[[Category:Computer data]]

	[[de:Bitstring]]		[[de:Bitstring]]

2007-02-01T22:46:38Z

Stub-sorting. You can help!

2006-07-01T09:34:06Z

clean up using AWB

← Previous revision		Revision as of 09:34, 1 July 2006
Line 7:		Line 7:
	[[Category:Information technology]]		[[Category:Information technology]]

		⚫	[[de:Bitstring]]

⚫	{{comp-stub}}

		⚫	{{comp-stub}}
⚫	[[de:Bitstring]]

2006-03-13T16:16:11Z

flags

← Previous revision		Revision as of 16:16, 13 March 2006
Line 1:		Line 1:
	A '''bitstring''' is a sequence of [[bit]]s. Anything on a [[discrete computer]] can be represented by a bitstring. In particular, any discrete computer can be encoded in a bitstring, usually called a [[program]]. Many mathematical structures can also be represented by bitstrings.		A '''bitstring''' is a sequence of [[bit]]s. Anything on a [[discrete computer]] can be represented by a bitstring. In particular, any discrete computer can be encoded in a bitstring, usually called a [[software program]]. Many mathematical structures can also be represented by bitstrings.

			While every conceivable type of data in today's [[computer memory\|memory device]]s is indeed stored as a sequence of ONs and OFFs or zeros and ones is indeed a [[String (computer science)\|string]] of bits, (ex. '7'<sub>10</sub> == '0111'<sub>2</sub>) bitstrings in the strict sense are used when grouping and packing [[boolean]] [[Flag (computing)\|flag]]s in a memory-efficient way. The state of one flag can be set or read using a [[bit mask]].

			''See also'': [[binary system]]

	[[Category:Information technology]]		[[Category:Information technology]]

2006-03-13T05:42:14Z

robot Adding: de

2006-01-25T04:15:41Z

wikify

← Previous revision		Revision as of 04:15, 25 January 2006
Line 1:		Line 1:
	A sequence of [[bit]]s. Anything on a [[discrete computer]] can be represented by a bitstring. In particular, any discrete computer can be encoded in a bitstring, usually called a [[program]]. Many mathematical structures can also be represented by bitstrings.		A '''bitstring''' is a sequence of [[bit]]s. Anything on a [[discrete computer]] can be represented by a bitstring. In particular, any discrete computer can be encoded in a bitstring, usually called a [[program]]. Many mathematical structures can also be represented by bitstrings.

⚫	{{comp-stub}}
	[[Category:Information technology]]		[[Category:Information technology]]


		⚫	{{comp-stub}}