answersLogoWhite

0

What is a bitstring?

User Avatar

Bobo192

Lvl 1
9y ago
Updated: 8/21/2019

A bitstring is a term used in computing for a sequence of bits.

User Avatar

Wiki User

9y ago

What else can I help you with?

Related Questions

How is Data Encryption Standard work in details?

Data Encryption Standard is a symmetric-key algorithm for the encryption of electronic data. It is considered a block cipher because it uses an algorithm that takes a plaintext bits and transforms it through into another ciphertext bitstring of the same length


What Different between bit array and jagged array?

A bit array is a kind of array data structure that stores a sequence of bits or boolean values as an array. It is also called a bitset, bitmap or bitstring. A bit is the basic unit of data in computer science. The bit represents one of two possible values( 0 or 1, True or False, Yes or No) of a logical condition in the form of 0 and 1. An example of an eight-bit array is 10011100. A jagged array is a special kind of multidimensional array that stores a collection of arrays of variable sizes. Each row of the jagged array contains columns of different sizes. It is also called as a ragged array. This implies that you can create an array with each element serving as a pointer(reference or link) to another array of the same type. Consider an example of a 2D matrix of size 3 X 3. One can say that the rectangular collection of size 3 X 3 will have 3 rows and 3 columns, but this is not the case with jagged arrays. In the case of jagged arrays, the number of rows is fixed, but the number of columns may not be fixed. The differences between a bit array and a jagged array are as follows: Array Elements: The elements of a bit array are digits( only 0 and 1), whereas the elements of a jagged array are arrays of variable size. Example of a bit array: 11011100. Example of a jagged array: int jagged_arr[][] = new int[][]{ new int[] { 1, 5, 6, 4 }, new int[] { 2, 3}, new int[] { 9, 8, 7}, }; Dimensionality: A bit array is generally one-dimensional but can be represented as two dimensional bit array. On the other side, a jagged array is a multidimensional array. Size: The size of the bit array is fixed, whereas the column size of the jagged array may not be fixed. Complex: A bit array is a simple array data structure, whereas a jagged array is more complex than a bit array. Parallelism: Bit-level parallelism is possible in a bit array, whereas it is not possible in a jagged array. The bit-level parallelism enables long-term storage and manipulation of small arrays of bits in the register set. It also maximises the use of cache data. Speed: Jagged array is faster than a bit array since the traversal is faster in jagged arrays than in single or multi-dimensional arrays. Compactness: The bit arrays have a variety of uses in areas where the efficiency of the system or required space is at a premium due to their compact design. On the other side, the design of jagged arrays is not compact, but they have a flexible design. Uses: One can use the bit arrays for priority queues and boolean flags. A bloom filter is a hash-based probabilistic data structure to determine if a given element is a component of a set. A jagged array is mainly used for memory management and faster code execution.


Why choose 8 bit is equal to 1 byte?

The earliest computers could only send 8 bits at a time, it was only natural to start writing code in sets of 8 bits. This came to be called a byte.It's essentially arbitrary, however 8 bits was initially a good fit since it was able to easily fit all letters, upper and lower case, plus all punctuation and numerals. A Byte is no longer a hard boundary, however. There are many protocols that use individual bits, or groups of 4 bits, or any number really. Modern processors also use 32-bit "words" and 64-bit "words".