You can use barrel shift algorithm for multi-shifting. And bit shifting means add 0's to right side of the number or remove the 0's from the right side. and there are two operators for this: << (shift left) and >> (shift right). For example 10100 >> 2 -> 101 (remove two 0's from the right) and 101 << 2 -> 10100 (add two 0's to right). And for example if we do 101 shift to 1011, barrel shift algorithm says first we split 101 (1 x 4 + 0 x 2 + 1 x 1) and then we do some calculations to our number 1011. 101's first bit is 1 x 4 and we do this shift to 1011 (10110000). Then we can't do a 2 shift because second bit is not 1. In finally there is 1 in the end bit. And it means one more shift and our answer is: 101100000.