This is better than the other tutorials cause it explains that u need to add 0's to the end when the result is less than 32 bits. I was looking for an answer. Ty!
I did the fraction part differently but this a good video. This video better explained this concept in 10 minutes than my professor did for an hour in a half.
I dunno if you were joking, but it really did encourage me. It felt like "yes, even this guy teaching it gets that this is horribly boring, its not just me, i just need to power through it!"
What if you have to shift the floating point to the right (0.125) does that make p < 0 with -3 as p ? and u lower the exponent instead of making it bigger ?
I don't know if I fully understand your question, but when you're finding p you will always shift left. What you want to get is 1.- ideally, or even 0.-. You always want to only have one number to the left of your floating point.
+Tomáš Hrubý Yes, in that case You have to shift the coma to the right as many places as needed to satisfy the rule of 1 in front of the coma. Then the constant of shift amont (in video it is 'p') will be negative number. In example if you shift the coma two places to the right then p = -2. Next when you will calculate the exponent, you should do 127 + (- 2) = 125 in decade. Step four, is as in the video.
1. Turn 0.125 into binary 0.125 = 0.001 2. Shift the decimal point to get the 1.ff format in this case to the right 0.001 --> 1.00 Your p is now equal to the number of shifts you made but since you went to the right instead of left the p will be negative in this case p=-3 3. exp = 127 + (-3) = 124 Turn 124 into binary which is 1111100. When you put that number in the 8-bit register reserved for the exponent you get 01111100. 4. Put everything together and you have 0 01111100 00000000000000000000000
Love that pep talk you use at the beginning to get us amped. ;-)
actually cracked up so hard at the intro
Actually love how honest he is about this, it's fucking terrible... can't wait to get over this bs lol
10 minute demo that covers an hour of university material at ny state level, thanks
they get paid per course so i can see why
I LOVE YOU, MATE, this 10 minutes video explained better than my professor. Simple and clear.
This is so helpful! Some comp sci subjects really lack proper easy to understand documentation, but this is honestly perfect
straight to the point, thank you 8 years later
Dude you made me burst out laughing within 3 seconds of video, I was slightly depressed about my exams tomorrow.
Thanks for the laugh !
You sound like a really cool guy
good video, i like the depressed midnight studying setting/voice
This is better than the other tutorials cause it explains that u need to add 0's to the end when the result is less than 32 bits. I was looking for an answer. Ty!
Thank u so much..
really helpful for the night before of my exam.
can't thank enough.
i got 100 on my exam because of this guy. thanks so much
I did the fraction part differently but this a good video. This video better explained this concept in 10 minutes than my professor did for an hour in a half.
Bruh, you're literally saving lifes, thank you!
This is waaay more clearly explained than it is in the book I have to use. Thank you thank you!
Fantastic video. You explained quite a difficult and cumbersome topic incredibly clearly; well done.
A lot more clear than my professor. Thanks!
The introduction of this video really encourages you to continue watching
I dunno if you were joking, but it really did encourage me. It felt like "yes, even this guy teaching it gets that this is horribly boring, its not just me, i just need to power through it!"
@@luminousdragon same here, it did encourage me to switch the video to 1.5x speed as well lol
honestly, youre my spirit animal bro "look i didnt invent this so im just gonna call it the fraction"
couldn't get a better explanation. thank you very much
Thanks bro this is a godsend, i was going through my lecture notes and I have no idea how they can make this seem so confusin, when its super simple.
This video is the greatest. Thank you for making it.
I like your teaching style bro :D
And this video saved my life
I like your way of teaching , its super cool
love your enthusiasm :) especially in the first part of the video. ahah Kidding . Thank you
this made it so much easier thank you
Increase the speed to !.25 or 1.5. thank me later
Thank you
Thanks human
thank youuu
Amazing, helped a lot with my exams
That is a cool trick for converting decimal point to binary point!
Really clear and educational, but still kinda funny. Thank you so much!
You are saving my life! Thank you!
The whole 1.c class is thankfull
This is fucking awesome, thank you.
+Tomas Leitch Pretty sure he just saved our grades haha
thank you for this video! you even made me laugh:D
thank u man this video is the only understandable other guys were talking shiiiit
WOW, this is first time I see video WITHOUT a DISLIKE!
Congrats
Thanks Man your laugh made my day or rather night :P
PS : Studing @ night
The whole 1.c class is thankful
I finally understood it... Thanks you
the way he's as done with this as we are
awesome, thanks for the explanation. You explained more clearly than my teacher hahahaha :D
Damn Man!... Cool Teaching ...
Very good explanation. Thanks!
You're so awesome, thanks.
Really thanks it's very helpful for my homework.
Best tutorial ever!
What kind of application do you use to make this video?
thanks man...this was really great
thanks from Argentina !
What if you have to shift the floating point to the right (0.125) does that make p < 0 with -3 as p ? and u lower the exponent instead of making it bigger ?
I don't know if I fully understand your question, but when you're finding p you will always shift left. What you want to get is 1.- ideally, or even 0.-. You always want to only have one number to the left of your floating point.
if you have number 0.001 (0.125) u have to shift to right to have format 1.ff
+Tomáš Hrubý
Yes, in that case You have to shift the coma to the right as many places as needed to satisfy the rule of 1 in front of the coma.
Then the constant of shift amont (in video it is 'p') will be negative number. In example if you shift the coma two places to the right then p = -2.
Next when you will calculate the exponent, you should do 127 + (- 2) = 125 in decade.
Step four, is as in the video.
Do you stop at the first 1 because it's negative and that's the sign bit?
+Rockoman100 no, that's because that 1 can be implied, saving one bit of information :D
Thanks you so much. I have a little question. Why do you place the last zeros at the end instead of before the 1?
WOOWWW u really explained it well
If i want to make a special 24-bit float what would be the division of the FRACTION/MANTISSA and the EXP given sign takes 1-bit
hello, can i ask ? if i had 1100.110 in first step ,so i have to shift point like this : 11.00110 ?
thanks you, the method is very very easy to understand
Do you calculate the bias in the same way if the number is positive that you need to calculate?
What if i wanted to convert it with 64 bit precision? i just fill in the missing zeroes in the exponent and the mantissa?
really great work by you :)
you're an awsome guy
Thank u so much
you Helped me a lot
His laugh 😂🌟 02:43
sir what if number to be stored in mantissa is 4 bits doea that mean that the rest of the bits will be all zeros????
thanks man
you'r the best
Sweet. *high five* Thanks for the explanation! This definitely helps xoxoxoX
thank you very very very much sir i am fully understanded
Thank you very much .ment a lot♥️
what if you have something like -1.5
really cool video ! although you might wanna decrease the amount of "cheerness" it gets us very amped ! LOL thanx bro !
is -5 in binary not be two's complament of 5 so 011... no?
thank you great video
very helpful , thank you
calm and clear !!!
so at 4. stage zeroes goes to 32 times when number is negative or?
You just fill the rest of the number with 0s, it doesn't matter if the number is positive or negative
Random Strategy ok thanks
Thank you
Very helpful
was really helpful
Excellent example, though a bit complex.
awesome video....thanks
Very helpful
10/10
EducationAboutStuff the binary number in step 4 doesn't equal 32-bit in length.
Where did the negative sign go...can anyone explain?
hi does mantista or fraction always starting from 1 or we also do start from 0 as well.....??? anyone
I LOVE YOU, THANK YOU, SUBSCRIBING, AHHHH
Big like for your video
Is the largest dec number in ieee 754 127+127=254 2^127
and smallest 127-126=1 2^-126
255 and 0 are exceptions that don't count.
Thank for finished my test (* *)=b
Pls Help How to convert 0.125 into IEEE 32 Bit
1. Turn 0.125 into binary
0.125 = 0.001
2. Shift the decimal point to get the 1.ff format in this case to the right
0.001 --> 1.00
Your p is now equal to the number of shifts you made but since you went to the right instead of left the p will be negative in this case p=-3
3. exp = 127 + (-3) = 124
Turn 124 into binary which is 1111100.
When you put that number in the 8-bit register reserved for the exponent you get 01111100.
4. Put everything together and you have
0 01111100 00000000000000000000000
*YOU GUYS MUST KNOW THIS - Special case: The IEEE754 for 0.0 is 0000 0000 0000....(32 digits)
Thank you!
Thank u brother
THANK YOU
tnx bro...
thanks dude
ty for video :)
thanks broo♥
Thanks you!
Thanks!
Thanks bro
This dudes voice is agonizing.
ty very much
thank you