Group all the bits in the binary number, as a set of 3 bits.
Start from the right: approaching from least significant bit to the most significant bit.
If any bit remains ungrouped in a set of 3 bits then you can add a leading '0' to it on the left, to make it a perfect set.
Find the octal numbers and their equivalent binary numbers, as given in the picture.
ANY IDEAS ABOUT THIS TOPIC?