In decimal, what is the most negative number that can be represented using a 12-bit two’s complement binary integer?

In an n-bit two's complement representation scheme, the amount of numbers we can represent is 2n - 1. In 12- bit, it's 1111 1111 1111, or 4095 in decimal. The largest positive number must not have a leading 1, as it would have to be negative, so the largest positive number we can represent is 2n-1 - 1, which is 0111 1111 1111 or 2047 in decimal. Subtracting these two numbers 2047 - 4095 gives us, all the negative numbers we can represent, and since the smallest negative number is -1, this also equals to the largest negative number. -2048.

MD

Related Computing A Level answers

All answers ▸

In Python, write a recursive function that returns the first n Fibonacci numbers.


Define resolution in regards to images and how it differs from colour depth


Why are bit patterns often displayed in hexadecimal notation instead of binary notation?


What is the difference between a variable and an identifier?