00:01
So let us start with the a path in which we have been given 0 1 0 0 0 1 0 1 1 1 to the best 2 and we have to convert it to the best 10 that means in decimal.
00:17
So for decimal we use the simple form that is 1 into 2 to the power 8 plus 1 into 2 to the power 4 then plus 1 into 2 to the power 2 plus 1 into 2 to the power 1 plus 1 into 2 to the power 0.
00:37
So this will becomes 256 plus 16 plus 4 plus 2 plus 1 so this will be goes to 279.
00:46
Why i'm not taking here 765 because all 765 terms are 0.
00:52
Simple.
00:53
Now let's take the b in which we have to convert the decimal of 53 .3125 to the best 10 to binary.
01:07
Okay means in the form of 0 1 0 1 likewise.
01:10
So how could we do that? for that you have to use the long division method.
01:15
Let's say here i will keep the 53 and here it will be 2.
01:20
So let us divide by 2 2 the 4 2 6 the 12 remaining is 1 then 2 1 the 2 2 3 the 6 remaining 0 2 6 the 12 remaining is what 1 then 2 3 the 6 remaining is was 0 2 1 the 2 remaining is what 1.
01:38
So we will start from the down and going to upward.
01:43
So this will give me the required binary of 53.
01:46
So 53 will be equals to 1 1 0 1 0 1.
01:50
Now what about decimal numbers that is 0 .3125.
01:55
So this we have to multiply by 2.
01:57
So this will be goes to 0 .625.
02:02
So this 0 will be our required binary then 0 .625 multiplied by 2.
02:09
So it will come to 1 .25.
02:11
So this one will going to be our required one binary right then 0 .25 multiplied by 2 will be goes to 0 .5.
02:20
So 0 will be our required one then 0 .5 multiplied by 2 will be goes to 1 .0.
02:25
So this one going to be our required one.
02:27
So we can clearly say that 0 .3125 this will be goes to 0 1 0 1 to the best 2...