Timestamps for topics covered in the video: 0:00 Introduction 0:57 Decimal to Other Base Number Systems 2:18 Decimal to Binary Number System 3:50 Example 1 5:47 Fractional Decimal Number to Other Base Number System 7:38 Fractional Decimal to Binary Number 8:55 Example 2
I was stuck on this topic for more than an hour, it simply took me 20 mins to understand this. This is the simplest yet the most efficient video i had seen on this topic, thank you so much sir! This was very very helpful for me
Thank you I've learned a lot tomorrow is our midterm exam for intro. To computing this help me thank done watching also a about the addition, subtraction and this❤️❤️❤️
Hello sir, you're classes are awesome. I would like to ask you to provide the slides/ ppt presentation in the videos as notes for us in the description of every video. I hope you'll do it. Thank you 😊
This may help Assume K is the decimal number we want to convert to binary number Then, we can write into this formula: STEP 1 k_0*2^1 + r_0*2^0 = K k_0 is the quotient and r_0 is the remainder which is always zero or one STEP 2 if k_0 is > 0, then we can further decompose k_0 into the following formula k_1*2^1 + r_1*2^0 = k0 STEP 3 Then, we can substitute k_1*2^1 + r_1*2^0 = k0 into k_0*2^1 + r_0*2^0 = K, this generate the following formula (k_1*2^1 + r_1*2^0)*2^1 + r_0*2^0 = K k_1*2^2 + r_1*2^1 + r_0*2^0 = K If we keep on repeating STEP2 - 3, we always find that there is a k_n term multiplied by the highest power of 2 (2^n), and always find that the remainder always multiplied by remaining terms (2^0 to 2^n - 1 terms). If k_n = 0, then we can stop repeating STEP 2 - 3. If k_n != 0, then we need to keep on repeating STEP 2-3 until k_n = 0. From the above logic, it shows that why the remainders are important to find the answer of binary number. The following is the generalised formula for decimal number to binary number k_n*2^n + r_n-1*2^(n-1) + ... + r_2*2^2 + r_1*2^1 + r_0*2^0 = K k_n = 0 and r_n-1 to r_0 can be 0 or 1
Suppose if you have 4, then you can divide it by 2. In that case, quotient is 2. And there is no remainder. But can not divide 1 by 2. So, quotient will be 0 and remainder is 1. I hope, it will clear your doubt.
![Felix "Unfair" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/Oswujxm2Ag0/mqdefault.jpg)
Timestamps for topics covered in the video:
0:00 Introduction
0:57 Decimal to Other Base Number Systems
2:18 Decimal to Binary Number System
3:50 Example 1
5:47 Fractional Decimal Number to Other Base Number System
7:38 Fractional Decimal to Binary Number
8:55 Example 2
I was stuck on this topic for more than an hour, it simply took me 20 mins to understand this. This is the simplest yet the most efficient video i had seen on this topic, thank you so much sir! This was very very helpful for me
I can understand this very well More than our teachers thank you so much ❤️
Thank you I've learned a lot tomorrow is our midterm exam for intro. To computing this help me thank done watching also a about the addition, subtraction and this❤️❤️❤️
Very useful Even other languages students understand this topic, thank you so much 😇
Hello sir, you're classes are awesome. I would like to ask you to provide the slides/ ppt presentation in the videos as notes for us in the description of every video. I hope you'll do it.
Thank you 😊
I'm still confused on the how to get their reminder?!!! I can't get it😥
Good information
Bestest 👌🏻👌🏻
Excellent lecture sir 😽✨🤙✌✌✌👍👍👍👍👍👍🤩🤩no words to say ❤❤
Sir very good 👍
1:30 bro it is wrong b^0/b=b^-1 so it is not x0 or x1 it is x0/b and x1/b
sir you are awesome thank you thank you thank you thank you thank you thank you thank you thank you thank you thank you thank
Sir please tell layers in krita, And more on HTML5
This may help
Assume K is the decimal number we want to convert to binary number
Then, we can write into this formula:
STEP 1
k_0*2^1 + r_0*2^0 = K
k_0 is the quotient and r_0 is the remainder which is always zero or one
STEP 2
if k_0 is > 0, then we can further decompose k_0 into the following formula
k_1*2^1 + r_1*2^0 = k0
STEP 3
Then, we can substitute k_1*2^1 + r_1*2^0 = k0 into k_0*2^1 + r_0*2^0 = K, this generate the following formula
(k_1*2^1 + r_1*2^0)*2^1 + r_0*2^0 = K
k_1*2^2 + r_1*2^1 + r_0*2^0 = K
If we keep on repeating STEP2 - 3, we always find that there is a k_n term multiplied by the highest power of 2 (2^n), and always find that the remainder always multiplied by remaining terms (2^0 to 2^n - 1 terms). If k_n = 0, then we can stop repeating STEP 2 - 3. If k_n != 0, then we need to keep on repeating STEP 2-3 until k_n = 0. From the above logic, it shows that why the remainders are important to find the answer of binary number.
The following is the generalised formula for decimal number to binary number
k_n*2^n + r_n-1*2^(n-1) + ... + r_2*2^2 + r_1*2^1 + r_0*2^0 = K
k_n = 0 and r_n-1 to r_0 can be 0 or 1
sir very very good explanation.keep it up.thanks
Please post videos for FM,PM,PPM,PWM,PCM,PAM,ASK,PSK,FSK,MARY ASK,MARY FSK, MARY PSK
PWM is already covered. Will also try to cover other topics.
commendable!!
Sir my request is if possible canyou please do videos related to embedded systems,Vlsi
Sir.
How x0b^0/b could be X0
Thanks sir I don't understand this then I saw your video because tomorrow is my computer exam
Good luck !!
Nice
Sir didn't understand the last step..i'e 1 decided by 2
Suppose if you have 4, then you can divide it by 2. In that case, quotient is 2. And there is no remainder.
But can not divide 1 by 2. So, quotient will be 0 and remainder is 1.
I hope, it will clear your doubt.
❤️
Today the date is 8-4-21
Today date is 6-9-22
Today the date is 17-7-23
Thanks your mail
(0.625)10→(0.101)2
Good day sir, I sent you a text on your Facebook messenger. But no response yet and it’s urgent sir. Thanks 🙏
Please provide classes in Hindi language
very confusing video
0.000009999887780259 BNB
WHERE IS THE POINT FOR SUCH A TRANSACTIONS ❓ WHAT'S THE REAL VALUE OF THE NUMBER YOU ALL SEE ABOVE 🙏