This here is a list of the largest and smallest possible values in each n-bit type of number which are possible to be represented as 2s-complements :
n-bits (SMALLEST : LARGEST)
2-bits (-2 : 1)
3-bits (-4 : 3)
4-bits (-8 : 7)
5-bits (-16 : 15)
6-bits (-32 : 31)
7-bits (-64, 63)
8-bits (-128 : 127)
9-bits (-256 : 255)
10-bits (-512 : 511)
11-bits (-1024 : 1023)
12-bits (-2048 : 2047)
16-bits (-32,768 : 32,767)
32-bits (-2,147,483,648 : 2,147,483,647)
64-bits (-9,223,372,036,854,775,808 : 9,223,372,036,854,775,807)
70-bits (-590,295,810,358,705,651,712 : 590,295,810,358,705,651,711)
Thus, it is evident that for n-bits, the smallest possible value will be -(2^n) and the largest possible value would be ((2^n)-1).
Currently, our modern computers have operating systems running up to 64-bits. Exceeding 70-bits is going to cause a problem known as a 'floating point precision error' or 'floating point bug'.
ESTÁS LEYENDO
Computer Science
No FicciónNON-FICTION In this modern era of constantly developing technologies, digital devices are the utmost crucial resources that underpins all of the luxuries and factors of staying synchronized with the rest of the world. Computers are amongst the most...
