Great way of explaining borrow as two 1s. I spent 15 minutes stuck on another video that explained it a different way, and got it within less than a minute with your video!
Thank you so much for this explanation. My CS 350 course text has a terrible explanation for binary subtraction, and you have really cleared it up. Awesome!
I always had confusion in binary subtraction😓 But after watching this video I can easily do binary calculation 🤓 You are good teacher! Thx for sharing quality content🔥🔥
The video is very good. I thought I could add some details for the truly nerdy, and for those who have an interest in how computer hardware does binary arithmetic, particularly subtraction. If you are new to binary, I suggest you skip this posting. There needs to be a way to represent negative numbers. There are three common ways: (1) Sign magnitude (2) One's complement (3) Two's complement; this is by far the most common, and the description follows: All of the explanation will be given assuming 4-bit words. Extending the description to 32 bits (or n bits) is left as an exercise for the reader. (LOL, don't you just hate it when instructors say that?) The 4 bits have the weights: -8, +4, +2, and +1. Note: --- Only the left most bit (the sign bit, the most-significant-bit MSB) has a negative weight; All the other bits have positive weights. --- If you set any bit to a 1 (except for the sign bit), the number becomes more positive (or less negative). --- The zero value is represented by 0000 --- All ones, 1111, has the value -1. (Since -8+4+2+1 = -1).
To get the negative of a number (that is, to get -N given N), the rule is "complement all the bits and add 0001". First, define the bit-complement operator ~ to be: "Change each 1 to a 0 and each 0 to a 1". Examples: ~0000 = 1111, and ~1111 = 0000 ~0001 = 1110 ~1010 = 0101 Proof: note that N + ~N = 1111 = -1 Example: 0101 + ~0101 = 0101 + 1010 = 1111 = -1 Rearrange: ~N = -1 - N Rearrange: ~N + 1 = -N Finally: -N = ~N + 1 (QED) Examples using the complement+1 negation rule: +1 = 0001; -1 = ~0001 + 1 = 1110 + 1 = 1111 -1 = 1111; +1 = ~1111 + 1 = 0000 + 1 = 0001 +5 = 0101; -5 = ~0101 + 1 = 1010 + 1 = 1011 -5 = 1011; +5 = ~1011 + 1 = 0100 + 1 = 0101 0 = 0000; -0 = ~0000 + 1 = 1111 + 1 = 0000 (Notice: negating 0000 results in 0000.) And finally, negating twice returns the original number, a requirement. Now any two numbers, positive or negative, can be added or subtracted. To subtract a number, first take its negative (using the complement+1 rule given above) and then add. NO "BORROWING" IS EVER NECESSARY. The subtraction method used by hardware inside a computer CPU is: Change the subtraction problem to an addition problem (by negating the subtrahend using the complement+1 rule), then add, propagating the carries right to left. Note that the longer a computer word is, the more carries need to be propagated. The time to propagate the carries is proportional to the length of the word, O(length), which is slow for long words. There are "carry skipping" methods which reduce the carry time to O(log(length)), but these methods are another topic. Addition and subtraction can cause the integer overflow exception: -- If two positive numbers added result in a negative (MSB=1) sum, overflow has occurred. -- If two negative numbers added result in a positive (MSB=0) sum, overflow has occurred. Adding a positive number to a negative number never results in overflow. The negative of 1000 (= -8) results in 1000 and overflow, since the largest positive number is 0111 = +7. In hardware, it is easy to calculate overflow by looking at the carries into and out of the MSB: Overflow = ExclusiveOR(CarryIntoMSB, CarryOutOfMSB).
Note that there is always a "strange" number for any of the three number systems: --- Sign magnitude has the number 1000 = 0000 (-0 = +0) since the MSB is the sign and has no value; there is no +8 or -8. --- One's complement has the number 1111 = 0000. Again, -0 = +0, and there is no +8 or -8. --- Two's complement has the number 1000 = -8, but there is no +8; the largest positive number is 0111 = +7. Two's complement has the "strange" number in the most out-of-the-way place, so it rarely causes a problem. The other two systems have the "strange" number at zero, which causes all-to-frequent, and unexpected, computational difficulties.
My Assembly Language professor spent an entire lecture going over Binary addition, and subtraction, yet he failed to explain it. And here you are, making it clear as sky in 5 minutes.
Even after my teachers and friends showed me multiple times how to do this I still couldn't solve one equation correctly but this video made me understand in just 1 second. Love this video!❤❤
My tuition and c school teachers took 4 f**king hours to taught it but i dont understand it but you, you taught be in only five minutes and i understand clearly And is anyone in 2024
Currently on track of learning Kotlin, making a small project about Steganography and Cryptography, your tutorial helped me understand this topic, THANK YOU!
thank you for this! you actually taught about the case in which you have to borrow from the next columns which my professor seemed to avoid. so easy thank you for explaining
Oh god,thank you so much lmao. I.m having a test in 3 days and i.m struggling on how to "borrow",but after watching this video it all makes sense to me now. Thank you so much now i can go through my test peacefully.
who'd have thought a 1:1 ratio, potato quality video from 9 years ago would teach me beautifully in 3 minutes
correction: a 11 year video has taught me
Lol
they are always the best ones
I’m 69th like 👍
@@krishpansuriya9229 something about books and covers.
Anyone In 2024??
Here
Haha yeah
Here👋🏾
Yessir
wouldn't be without my teacher
My prof went over this for an hour, never got it... and then you taught me in 5 min haha thank you!
Same here
Same
Same here! I am so happy to have found this video :) Thank you so much!
Professors suck...
@@alphax4686 online school sucks man
FINALLY someone does a clear example with borrowing! Thank you!
Dude. And textbooks fail to explain this.
@@nkosinathimlenzane3044 yes u r right
Hy game developer
Watching this in 2024, 13 years after the upload and this tutorial was the only one which I found useful. Thanks a lot sir ❤
I had just started primary school when you posted this video. Now, I'm at university watching it. Thank you very much :)
Great way of explaining borrow as two 1s. I spent 15 minutes stuck on another video that explained it a different way, and got it within less than a minute with your video!
same
Twos Compliment is actually the correct way.
I was so confused with this and your explanation really helped me out. Thank you, and again, thank you.
ua-cam.com/video/siK3fiBVOLI/v-deo.html
after 12 years ur video is saving lifes
حقيقي ❤
3 minutes in and everything I'd been struggling to understand became so clear to me
I've seen many videos on subtracting binary, and this one was, by far, the most straightforward with less fluff and complexity.
thankyou
Thank you so much for this explanation. My CS 350 course text has a terrible explanation for binary subtraction, and you have really cleared it up. Awesome!
11 years later and still very usefull, thank you!
Anyone in 2024😢
Here!!
here
I always had confusion in binary subtraction😓
But after watching this video I can easily do binary calculation 🤓
You are good teacher!
Thx for sharing quality content🔥🔥
EXACTLY I FEEL YOU TOO
Bruh we spent like 5 periods learning binary subtraction and here you are making it clear as the difference between day and night in 5 minutes
man hearing that type of mic after all these years, it brings me such nostalgia. Thank you for the tutorial
Anyone in 2024
Yes😂
👋🏻👋🏻👋🏻😂
The video is very good. I thought I could add some details for the truly nerdy, and for those who have an interest in how computer hardware does binary arithmetic, particularly subtraction. If you are new to binary, I suggest you skip this posting.
There needs to be a way to represent negative numbers. There are three common ways:
(1) Sign magnitude
(2) One's complement
(3) Two's complement; this is by far the most common, and the description follows:
All of the explanation will be given assuming 4-bit words. Extending the description to
32 bits (or n bits) is left as an exercise for the reader. (LOL, don't you just hate
it when instructors say that?)
The 4 bits have the weights: -8, +4, +2, and +1. Note:
--- Only the left most bit (the sign bit, the most-significant-bit MSB) has a negative weight;
All the other bits have positive weights.
--- If you set any bit to a 1 (except for the sign bit), the number becomes more positive (or less negative).
--- The zero value is represented by 0000
--- All ones, 1111, has the value -1. (Since -8+4+2+1 = -1).
To get the negative of a number (that is, to get -N given N), the rule is "complement all the bits and add 0001".
First, define the bit-complement operator ~ to be: "Change each 1 to a 0 and each 0 to a 1". Examples:
~0000 = 1111, and ~1111 = 0000
~0001 = 1110
~1010 = 0101
Proof: note that N + ~N = 1111 = -1
Example: 0101 + ~0101 = 0101 + 1010 = 1111 = -1
Rearrange: ~N = -1 - N
Rearrange: ~N + 1 = -N
Finally: -N = ~N + 1 (QED)
Examples using the complement+1 negation rule:
+1 = 0001; -1 = ~0001 + 1 = 1110 + 1 = 1111
-1 = 1111; +1 = ~1111 + 1 = 0000 + 1 = 0001
+5 = 0101; -5 = ~0101 + 1 = 1010 + 1 = 1011
-5 = 1011; +5 = ~1011 + 1 = 0100 + 1 = 0101
0 = 0000; -0 = ~0000 + 1 = 1111 + 1 = 0000 (Notice: negating 0000 results in 0000.)
And finally, negating twice returns the original number, a requirement.
Now any two numbers, positive or negative, can be added or subtracted.
To subtract a number, first take its negative (using the complement+1 rule given above) and then add.
NO "BORROWING" IS EVER NECESSARY.
The subtraction method used by hardware inside a computer CPU is: Change the subtraction problem to an addition problem (by negating the subtrahend using the complement+1 rule), then add, propagating the carries right to left. Note that the longer a computer word is, the more carries need to be propagated. The time to propagate the carries is proportional to the length of the word, O(length), which is slow for long words.
There are "carry skipping" methods which reduce the carry time to O(log(length)), but these methods are another topic.
Addition and subtraction can cause the integer overflow exception:
-- If two positive numbers added result in a negative (MSB=1) sum, overflow has occurred.
-- If two negative numbers added result in a positive (MSB=0) sum, overflow has occurred.
Adding a positive number to a negative number never results in overflow.
The negative of 1000 (= -8) results in 1000 and overflow, since the largest positive number is 0111 = +7.
In hardware, it is easy to calculate overflow by looking at the carries into and out of the MSB:
Overflow = ExclusiveOR(CarryIntoMSB, CarryOutOfMSB).
Note that there is always a "strange" number for any of the three number systems:
--- Sign magnitude has the number 1000 = 0000 (-0 = +0) since the MSB is the sign and has no value; there is no +8 or -8.
--- One's complement has the number 1111 = 0000. Again, -0 = +0, and there is no +8 or -8.
--- Two's complement has the number 1000 = -8, but there is no +8; the largest positive number is 0111 = +7.
Two's complement has the "strange" number in the most out-of-the-way place, so it rarely causes a problem.
The other two systems have the "strange" number at zero, which causes all-to-frequent, and unexpected, computational difficulties.
Nah bro is goated in teaching binary subtraction
My Assembly Language professor spent an entire lecture going over Binary addition, and subtraction,
yet he failed to explain it.
And here you are, making it clear as sky in 5 minutes.
the sky is kind of cloudy for me right now tho
this is the most windows-xp-on-a-toughbook thing ive seen in a while. thanks for the upload!!
SIR, you YOU, just taught me perfectly 2 days before the exam and i was so lost on this, you legend
Still works in 2023
Thanks❤
THANK YOU SO MUCH. Saved me for my exam tomorrow. My lecturer didn't explain the borrowing concept of "two 1s" properly.
My teacher spend a freaking 2hrs to teach this and never got it but you taught in 5mins clearly😊😂😂😂
Wow, you taught me it in less than a minute which I was trying to crack since an hour. Hats off to you sir.
Ok the quality of the video might be bad but he really explained this thing beautifully..
You, sir, are a gentleman and a scholar. Thank you very much.
You have a special place in heaven, teachers never taught me this and i just realised how simple it is W
Even after my teachers and friends showed me multiple times how to do this I still couldn't solve one equation correctly but this video made me understand in just 1 second. Love this video!❤❤
My tuition and c school teachers took 4 f**king hours to taught it but i dont understand it but you, you taught be in only five minutes and i understand clearly
And is anyone in 2024
We plenty o. I get exam na Wetin carry me come here.
Thank you. Finally, can solve the tricky ones.
"Cut off one head, and two more shall take it's place."
In decimal 10 will take Its place haha
@@sumitupadhayay2270 Never noticed that fact . Your open minded
finally got it.......... your explanation was straight to the point.THANK YOU :)
Excellent explanation, alot more clear and concise than my book...or teacher.
how is your life right now
Currently on track of learning Kotlin, making a small project about Steganography and Cryptography, your tutorial helped me understand this topic, THANK YOU!
I didn't understand this when reading my text book for my CSIS110 Course, but this made the process infinitely clear.
You made it so easy to understand, thank you🦋💕
this is what i call clarification!
not really, sound is kinda lackin
he posted this when i was 7 who knew he would help me 13 years later
Thank you so much, It helped me out, my exam is on 6th September, Thank You So Much🎉🎉🎉🎉🎉🎉🎉🎉🎉
thank you for this! you actually taught about the case in which you have to borrow from the next columns which my professor seemed to avoid. so easy thank you for explaining
Thanks sir I'm from India and tomorrow is my exam so it helped me a lot .
thank you sir
i am giving five star
from Afghanistan
thank you man, ı gues knowledge is truly immortal
Bro just helped me in my computer science homework, thanks
holy shit my professor dragged on for about an hour about this and it was so confusing, now I understand after 3 minutes thank you so much
10years later. Anyone?
Aug 25 2023, you're still a genius!!!
And 12 years later still useful thanks man
Best method for me so far. Thank you!
ua-cam.com/video/siK3fiBVOLI/v-deo.html
this is the best video on binary subtraction....!!!!! no doubt at all....
Thank you good sir!! first clear explanation, why couldn't my teacher just say this?
I haven't gotten this for months and I have exams but I got it in 5 mins from you!
Searched for hours but couldn’t understand finally got here.
DUDE. You're the man. My prof made this so much more complicated
Why does it become two 1’s ?
Oh god,thank you so much lmao. I.m having a test in 3 days and i.m struggling on how to "borrow",but after watching this video it all makes sense to me now. Thank you so much now i can go through my test peacefully.
me too
buen trabajo comrade
2 years it's been, how time flies. Also stfu you two.
i asked
I used your tutorial now and it was awesome and I completely understand it.Thanks a lot.
Video launcher:- 15 years later. Me:- watching in 2026😂😂😂
TYSM finally after so many classes in my college and still nothing,, one video and bam! i know binary subtraction! yay.. thnx
great video, binary subtraction finally makes sense
I've been stressed about this the whole weekend😂 and you've made me get it in 3 minutes haha😅.....video from 9yrs ago🤦♀️😅
FINALLY understood it...great explanation!
Thank you so much!! I've got exams coming up about this and you just saved me from failing, great video!
Your teaching is better than my sir
Thanks for this. You made it so easy to understand.
10 years later you save my ass, sir
Best explanation of borrowing in binary subtraction I got frm this video 👌
watching this on 2024 july. Thanks man. you are a Legend!
This 5 minute video saved tonnes of my time!!
Finally! I got it, nobody explained it properly it was so frustrating
i was in kindergarden when you posted this and now i am watching this for my comp sci degree
Gosh, this is better than the lecture I had. Understood it in just less than 5min as compared to the near 30min ver I had in my course =.=
Was really helpful..better thn my CS professor thank you
Really good explanation sir. Your video viewer from Canada
Bro sounds like hes narrating a battle during the second world war
Wow, finding this video in 2023 and learning smth, love it
man, look how cool and nostalgic this is: win 7 xp with a good teacher... can't get any better.
thank you, you explained this so much better than my professor
i would rate this school a 8/10 pretty good
This is a lot better than the way my professor explained it.
ua-cam.com/video/siK3fiBVOLI/v-deo.html
Probably the best one out there. Understood it clearly!
12 years passed and still thank you
Windows XP.... the good old days
I am having windows 10
@@dynamitegaming9770 no one ask
that start up sound tho
I love it, the way u explained borrowing i was struggling for 2yrs u made it easy and simple to understand thank you
thanks for the short, simple, and informative video.
I just want to say thank you so much. This video is gold. Well done
Best vedio ever for binary subtraction, thank you ❤❤
Thank's for your tutorial
I managed to figure it out within 1 minute, thanks!
Thank you. Straight to the f-ing point. Nice job.
Your explanation is so simple i love it thank you
oh this made me understand so much about "borrowing" thanks
12 years later but still it's bery useful
Thanks dude....for the uploading this video in the era of windows xp
I'm having this lesson rn I really needed this thanks
that was amazing :), I have an exam tomorrow in digital design, and I benefited thank you.
Amazing explanation.....
Thank you so much! I can now understand it!