what is the largest positive number one can represent in an 8-bit 2's complement code?

Question

write results in binary and decimal.

Answer 1

2^(n -1) -1 for positive numbers
-2^(n-1) for negative numbers.
n = number of bits.

In your case which is also called signed numbers +127 to -128.

Answer 2

2's supplement potential to make a favorable quantity a detrimental you invert all the bits (ie one million turns into 0 and 0 turns right into one million), then upload one million to the quantity. the 1st bit is reserved for indicating no remember if the quantity is detrimental or valuable. If it particularly is one million meaning the quantity is detrimental, and 0 potential valuable. So b) is the only one which could properly be a favorable quantity.

Answer 3

(11111111)binary = 1x2^0 + 1x2^1 + 1x2^2 + 1x2^3 + 1x2^4 + 1x2^5 + 1x2^6 + 1x2^7 = 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 = (255)decimal.

Answer 4

I dont know , however I love digital and how relatively easy it is
so,
I like your line of questioning
and will work on this
( im not sure what you mean by 2's compliment code , but i am intrigued )

Answer 5

11111111= 255 (0 is a null digit but still a place holder so the "place" count is 256) Each place is a power of 2.

Answer 6

01111111 = 127