0
What is the range of numbers that can be represented using 7-bit signed binary number?
Wiki User
∙ 13y ago
range iS given by
-{2^(k-1) - 1 } to +{2^(k-1)-1}
So putting k=7
range i from -63 to +63
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
What is the binary range in decimal of a byte?
Nobody knows what you are talking about, but if you mean what the biggest number is in a byte, it is 255 or 127. The former is only for unsigned, while the latter is the maximun if the byte is signed. If you mean how many numbers can be represented, it is 256 or 128. Again, the former is if it is unsigned and the latter is if it is signed.
Describe the range of numbers that can be represented by a 16 bit number using two complement?
A signed 16 bit number can represent the decimal numbers -32768 to 32767.
What is the main limitation of sign magnitude representation?
One of the bit patterns is wasted. Addition doesn't work the way we want it to. Remember we wanted to have negative binary numbers so we could use our binary addition algorithm to simulate binary subtraction. How does signed magnitude fare with addition? To test it, let's try subtracting 2 from 5 by adding 5 and -2. A positive 5 would be represented with the bit pattern '0101B' and -2 with '1010B'. Let's add these two numbers and see what the result is: 0101 0010 ----- 0111 Now we interpret the result as a signed magnitude number. The sign is '0' (non-negative) and the magnitude is '7'. So the answer is a postive 7. But, wait a minute, 5-2=3! This obviously didn't work. Conclusion: signed magnitude doesn't work with regular binary addition algorithms.
Determine the decimal value of the signed binary number 11101000 expressed in 1s complement?
232
What is the maximum number represents by 16 bit signed binary digits?
Plus or minus 65,535
What is the binary range in decimal of a byte?
Nobody knows what you are talking about, but if you mean what the biggest number is in a byte, it is 255 or 127. The former is only for unsigned, while the latter is the maximun if the byte is signed. If you mean how many numbers can be represented, it is 256 or 128. Again, the former is if it is unsigned and the latter is if it is signed.
Describe the range of numbers that can be represented by a 16 bit number using two complement?
A signed 16 bit number can represent the decimal numbers -32768 to 32767.
Signed binary multiplier?
Binary multiplier is taking numbers and using multiplication and division. This is used in math.
What is the lowest value 6 bit number you can have in binary?
000000 is the lowest number in a 6 bit unsigned binary number (meaning the high order bit is not the sign bit). If it is a signed number then the lowest number would be represented by 100000 which is equivalent to -32 in decimal. Highest unsigned number in 6 bits is decimal 63. Highest signed number in 6 bits is decimal 31.
Where do you use sign binary number?
Whenever a computer program uses integers - for example, in a game, to store a player's score, but also for many other situations - this will internally be stored as a binary number. This number may be signed or unsigned. Some programming languages, such as Java, only use signed numbers. In other cases, the programmer may decide to use either signed or unsigned numbers, depending on his needs.
What does binary number 1111000 convert to in decimal numbers?
111100002 equals 24010 using unsigned notation. It equals -1610 using signed notation.
Explain the methods which are available to store negative numbers and how are they used. Which method is mainly used today and why?
signed magnitude, one bit indicates the sign of the number and the other bits indicate the positive magnitude of the number (this system has two representations for zero: +0 and -0)one's complement, positive numbers are represented as their positive magnitude and negative numbers are represented as the complement of their positive magnitude (this system has two representations for zero: +0 and -0)two's complement, positive numbers are represented as their positive magnitude and negative numbers are represented as the complement of their positive magnitude plus one (this system is asymmetric about zero, with one more negative value than positive)offset binary, numbers are represented as the positive sum of their actual value and an offset (this system is asymmetric about zero, typically with one more negative value than positive)Most modern systems use two's complement for fixed point numbers (because the arithmetic circuitry is simpler than the others) and a combination of signed magnitude and offset binary for floating point numbers (because this format allows the same instructions for comparing fixed point numbers to also be used to compare floating point numbers, reducing the number of different instructions and the circuitry to implement them),
What is the maximum number represents by 10 bit signed binary digits?
+511
Can some one find any clues after converting 514-34-24-18 to binary. These numbers were the first clue in the challenge and his hint was convert to binary?
If these are truly subtractions, then 514-34-24-18 = 438 which in binary is 111000000 and can be considered as a 9 bit signed binary number and translates to EBCDIC "-{" and if considered as an unsigned binary number it translates to EBCDIC "1{", may be this will give you a clue with respect to the context.
What is higher signed numbers or natural numbers?
Neither. Given any signed number it is possible to find a higher natural number and given any natural number it is possible to find a higher signed number.
Canonical signed digit number representation of a binary number?
is it possible to apply CSD to bough wooley multiplier
What is the main limitation of sign magnitude representation?
One of the bit patterns is wasted. Addition doesn't work the way we want it to. Remember we wanted to have negative binary numbers so we could use our binary addition algorithm to simulate binary subtraction. How does signed magnitude fare with addition? To test it, let's try subtracting 2 from 5 by adding 5 and -2. A positive 5 would be represented with the bit pattern '0101B' and -2 with '1010B'. Let's add these two numbers and see what the result is: 0101 0010 ----- 0111 Now we interpret the result as a signed magnitude number. The sign is '0' (non-negative) and the magnitude is '7'. So the answer is a postive 7. But, wait a minute, 5-2=3! This obviously didn't work. Conclusion: signed magnitude doesn't work with regular binary addition algorithms.
