Logical shift and operation

It calls that all bit of binary is shifted on left and right logical shift. When it shifts logically, value changes as description below.

On the left n bit shift: It becomes 2 n-tuple
On the right n bit shift: 2- the n-tuple (the value which is divided with 2n) it becomes

 Therefore, the bit just is shifted can do multiplication and division.

 Example: Binary “0101” on the left 2 bit shifts
  (The result which is shifted 2 n-tuple (4 times) verification the thing which becomes)

Binary
0
1
0
1

When it converts to decimal, “0101” -> “5”

Binary on the left 2 bit shifts
0
1
0
1
0
0

2 bits it shifts to the left, it inserts “0” into the bit which is less crowded
The result and 2 n-tuple (4 times) “20” you can verify that is

Then, it will try solving the problem of logical shift and operation.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: