185 stored as a signed 8-bit number?

[joel amos]

Several exercises in my textbook start with assumptions that confuse me. For example:

• Assume 185 and 122 are signed 8-bit decimal integers stored in sign-magnitude format.
• Assume 151 and 214 are signed 8-bit decimal integers stored in two's complement format.
  

I am then to go on to find the sum or difference (varies by exercise) of the numbers and state if there is overflow, underflow, or neither.

But...isn't the maximum number that can be represented here 2^7−1=127?

 

[Mark44]

Several exercises in my textbook start with assumptions that confuse me. For example:

• Assume 185 and 122 are signed 8-bit decimal integers stored in sign-magnitude format.
• Assume 151 and 214 are signed 8-bit decimal integers stored in two's complement format.

I am then to go on to find the sum or difference (varies by exercise) of the numbers and state if there is overflow, underflow, or neither.

But...isn't the maximum number that can be represented here 2^7−1=127?

These questions don't make sense to me, either. 127 is the largest number that can be stored as a signed 8-bit integer. So three of the numbers listed above are already too large to fit in 8 bits (with one bit for the sign).

 

[Vanadium 50]

But...isn't the maximum number that can be represented here 2^7−1=127

And doesn't the question ask you if there are overflows or underflows?

 

[NascentOxygen]

Several exercises in my textbook start with assumptions that confuse me. For example:

• Assume 185 and 122 are signed 8-bit decimal integers stored in sign-magnitude format.
• Assume 151 and 214 are signed 8-bit decimal integers stored in two's complement format.

I am then to go on to find the sum or difference (varies by exercise) of the numbers and state if there is overflow, underflow, or neither.

But...isn't the maximum number that can be represented here 2^7−1=127?

Can you provide a sample: one exercise, together with the textbook's answer?