Weitere Beispiele werden automatisch zu den Stichwörtern zugeordnet - wir garantieren ihre Korrektheit nicht.
Many implementations check the least significant bit to see if it is a 1.
The next least significant bit drives a speaker of twice this area, and so on.
The address and the data bytes are sent most significant bit first.
Effectively, we are only computing the values for which the most significant bit of the window is set.
The most significant bit of the first array element is examined.
Each byte will have the group in its 7 least significant bits.
P is a counting class, and can be seen as finding the least significant bit of the answer to the corresponding problem.
Therefore, the least significant bit can be used (more or less undetectably) for something else other than color information.
Again, the least significant bit (rightmost in this table) is sent first.
Less significant bits are sometimes ignored to reduce the tree size.
The three least significant bits are set to 0.
Sign of the operand depends upon its most significant bit.
The least significant bit (first transmitted) defines the frame type.
Without dither the low level may cause the least significant bit to "stick" at 0 or 1.
The most significant bit is 1, so the value represented is negative.
The problem of finding the most significant bit is in PP.
We wouldn't notice if the least significant bit in the various color bytes was off or on.
In this way it is possible to only transmit, for example, the 3 most significant bits (with sign) of each sample.
If the test was true, the value one is written to the least significant bit of the destination register to indicate the condition.
Find the most significant bit of the result.
You just know there's a lot of uncertainty in the least significant bits of that.
And adding 1 to get the two's complement can be done by simulating a carry into the least significant bit.
That is, bit number 1 is always the most significant bit.
Set to a copy of the most significant bit of an arithmetic result.
Recursive processing continues until the least significant bit has been used for sorting.