529 views
1 votes
1 votes
Assuming 6-bit 2's complement binary representation the largest number that can be subtracted from (-15) without causing overflow is?

1 Answer

3 votes
3 votes

Given that 6-bits and 2's complement form representation

therefore we can represent -32 to +31 decimal numbers, therefore beyond this range it cause overflow

Given that subtracting from -15 doesn't cause overflow

let x is your required number,

∴ -15-x can't cause overflow ===> -15-x ≥ -32 and  -15-x ≤ 31

 

1)  -15-x ≥ -32

-x ≥ -32+15 ===> -x ≥ -17 ====> x ≤ 17 ---------> For largest take 17

 

2) -15-x ≤ 31

-x ≤ 31+15 ===> -x ≤ 46 ===> x  ≥ -46 ----------> For lowest take -

But Note that -46 is can not represented with 6 bit in 2's complement number...

∴ up to -32 only we can represent ===> x  ≥ -32 ----------> For lowest take -32

edited by

Related questions

0 votes
0 votes
0 answers
1
Anuj1995 asked Aug 4, 2018
226 views
Let FP be the number of distinct numbers that can be represented in 4-byte IEEE floating point and UI be the number of distinct numbers that can be represented as unsigne...
1 votes
1 votes
1 answer
2
Anuj1995 asked Aug 4, 2018
638 views
For a floating point representation with 64 bits in the mantissa and $12$ bits in the unbiased exponent, the number of significant digits in decimal and the maximum (posi...
0 votes
0 votes
1 answer
4
Anuj1995 asked Aug 2, 2018
210 views
Consider a computer system that stores floating-point numbers with 16-bit mantissa and an 8-bit exponent, each in two’s complement. The smallest and largest positive va...