which is the rule for binary shifting of a negative number

Question

example -7 >> 3

Answer 1

it works quite simple:
y<<x is equivalent y*2**x
y>>x is equivalent y//2**x
(so -7//2**3 == -7//8 == -1 (floor division))

Answer 2

In which language?
All language is different about this

Answer 3

7=
0000 0000
0000 0000
0000 0000
0000 0111
-7=
1111 1111
1111 1111
1111 1111
1111 1001
negative just flip all bits and do addition by one
-7>>3=
0001 1111
1111 1111
1111 1111
1111 1111
Sorry I might be wrong bc I'm busy
[Edited]
-7>>3=
1111 1111
1111 1111
1111 1111
1111 1111
shift in negative will fill 1 instead 0

Answer 4

Actually the >> right bit shift is pretty standard across multiple languages.
The right bit shift shifts the binary value of x to the right y times (x >> y) dropping off the right most value of the binary number and left fills a copy of the left most number.
I.E.
A positive number is 0 (zero) filled on the left while a negative number is 1 (one) filled from the left.
a 16 bit binary number with the value of -10 would look like:
1111 1111 1111 0110
so if we right shifted it 2 times it would look like:
1111 1111 1111 1101
which has the value of -3
if we right shifted it 2 more times:
1111 1111 1111 1111
we now have -1. At this point it won't matter how many times we right shift, the value will not go any higher than -1

Answer 5

how do i have to calculate it (language = pencil).

Answer 6

so i calculate -7 >> 3 = -1
great stuff . i undetstand.

Answer 7

so
47>>3 = 5
and
-47>>3 = -6

Answer 8

yuri... it is indeed quiet simple!