Bitstring: Difference between revisions
Content deleted Content added
Undid revision 170107489 by 89.100.196.151 (talk) |
m Removed category "Data structures"; Quick-adding category "Bit data structures" (using HotCat) |
||
| Line 8: | Line 8: | ||
* [[Bitstream]] |
* [[Bitstream]] |
||
| ⚫ | |||
[[Category:Computer data]] |
[[Category:Computer data]] |
||
| ⚫ | |||
[[de:Bitstring]] |
[[de:Bitstring]] |
||
Revision as of 20:58, 26 April 2008
A bitstring is a sequence of bits. 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 memory devices is indeed stored as a sequence of ONs and OFFs or zeros and ones is indeed a string of bits, (ex. '7'10 == '0111'2) bitstrings in the strict sense are used when grouping and packing boolean flags in a memory-efficient way. The state of one flag can be set or read using a bit mask.
See also
 | This computer science article is a stub. You can help Wikipedia by expanding it. |