If you didn't see the first part of this post click here and enjoy !

Do you remember of our bitwise table in part I? We are not going to need it anymore. What we are going to do here is simple math, so let's start with the left shift operator that uses multiplication ( * ). The full definition from php is : "Shift the bits of `$a`` $b` steps to the left (each step means "multiply by two")"

The formula is : bit leftmost * 2 ^ bit rightmost

bit leftmost = 7;

bit rightmost = 9;

7 * 2 ^ 9 = ? (2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2)

2 ^ 9 = 512

7 * 512 =3584

"Shift the bits of `$a`` $b` steps to the right (each step means "divide by two")". Even easy, isn't it ? Let's try an example!

Can you guess what will be the output ?

Our formula this time will by : bit leftmost / 2 ^ bit rightmost

bit leftmost = 4;

bit rightmost = 6;

4 / 2 ^ 6 = ? (2 * 2 * 2 * 2 * 2 * 2)

2 ^ 6 = 64

4 / 64 = 0

Finally we have got the last operator and of course the easiest one. To achieve the NOT operator we must follow the formula ~x = -x -1 (To further information please click here).

What we have to do is simply apply the formula swifting the X by 9.

~x = ~9;

-x = -9;

-1 = -1;

**~9 = -9 -1 = - 10**