Binary shifts (updated)

Moving the bits stored in a register a given number of places with the registers

- Bits shifted out of the registers replaced with 0
- e.g: 10101111 Shifted left 3 place becomes 01111000

Multiples the number by 2 to the power of n

Divides the number by 2 to the power of n

- The sign of the number is preserved
- e.g: 10101111 Shifted right 3 places becomes 11110101

- Bits are shifted to the left
- e.g: 10101111 Shifted left 3 places becomes 01111000

- Bits are shifted to the right
- e.g: 10101111 Shifted right 3 places becomes 1111010

- No bits are lost, bits shifted out of one end of the register are introduced at the other end of the register
- e.g: 10101111 Shifted left 3 places becomes 01111101