565 views

2 Answers

2 2 votes

Smallest negative value expressed in 8 bit 2 complement from is $-128$ [ 1000 0000 ]

Now if we add it with itself : 

   1000 0000  $(-128)$

   1000 0000  $(-128)$


1 0000 0000  $(-256)$

 

Note: Here we can see overflow came because when we add two binary numbers there must be an overflow when : 

X   Y    Z 

0   0     1

1    1    0

Where X → Sign bit of first number 

            Y → Sign bit of second number 

    and, Z →  Sign bit of Resultant

0 0 votes
The range of numbers that can be represented using 8 bits in 2's complement form is  -128 to +127

and hence the smallest negative value is -128

now if we add -128 with -128 itself then we will get -256 which can't be represented using 8 bits in 2's complement form, so overflow will occur.

So -128 is the smallest negative value expressed in 8 bit 2's complement from that when added to itself, the sum causes an overflow

 

I hope this is a correct explanation.
Position:
Show:

Related questions

4 4 votes
1 1 answer
1.2k
1.2k views
lalitver10 asked Oct 3, 2022
1,171 views
Consider a classical 5-stage pipeline processor. A program consists of 25,000 instructions are executed on this processor. Assume that:- 4500 of those instructions are br...
1 1 vote
1 answers 1 answer
2.0k
2.0k views
aftab0711 asked Aug 9, 2024
2,000 views
How many number of states are required to construct the minimized DFA for the language over {a, b} whose languages of accepted strings (exactly) are(i) all strings matchi...
0 0 votes
1 1 answer
853
853 views
lalitver10 asked Sep 17, 2022
853 views
Question → If (G,*) is a group of order 960 and there exist a in G such that a^m=e for some integer m<=960 where e is identity element of G then total number of possible ...
1 1 vote
1 1 answer
281
281 views
NIL DAS asked Sep 22, 2025
281 views