3. Binary Division method (Restoring and Non-restoring Division Algorithm)

Показать описание

Рекомендации по теме

Комментарии

Thank you so much mister, my teacher taught this and i didnt understand anything. Its because of people like you that makes things easier and as a fellow indian, i would like to wish you success and hope the world recognises your talent someday.

marvichadap

Honestly you are the ones who should be honoured in ytff. We get to learn what we really need to!!
Thanks a lot!🙏🏻

srushti

I was just looking for 3:50. Thank you so much; my doubt has now been cleared.

aryaone

bro no words can express how helpful this is, thank you bro

rafaelangelopiad

Excellent teaching sir....it's very easy to understand everyone... Becz of... u teaching the way is very simplest..it's too much good sir..tqsm

HGCS_ASHWINIMD

Thanks a lot bhaiyya!!!... I wasn't able to solve these questions earlier, this tutorial has clarified all my doubts on the topic, thank you😊

aditichatterjee

P E R F E C T
Amazing method to divide with a simple algorithm and resulting directly the quotient and the rest.
Thank you

MasterMindmars

For anyone wondering it is 10 / 3 instead of 9 / 3

manishswami

First i was a little bit confused but after watching his video I'm now more confused

nikhilgiripunje

Wht abt non restoring method.. If it was nt to be taught in this video then why the name is included..??

sakshirajput

Very much needed bro...i cannot found this method anywhere on internet...🤘

pranavchauhan

Thank you very much sir ... tomorrow i have exam...i understood clearly thanks a lot 🎉

saravanann

I was searching for such simple explanation and finally came across the video
Thank you sir🤩🤩🤩

_PremKharat

Very nice explanation sir, next time please cover whole page☺️

arshadshaikh

This algorithm is actually a special case. NOTE the sign bit of the divisor being zero in this example. The generalized division algorithm does not require this but generates TWO carry bits. Processors do not handle a second carry bit, but it can be emulated by implementing a flip-flop in software. Yes, that requires the use of a goto operation which is spaghetti code. When it comes to division, goto is not harmful. A benefit of this is an extra bit of precision which allows correct rounding when the unsigned quotient is restored to a signed integer. While that is simple in assembly language, it results in complicated logic in many high level languages. Unsigned scaled integer division is usually ignored for this reason. The reader should understand what is being avoided in this video and why the extra zero in the divisor is so important. Omit that and the algorithm will work most of the time, and depending on the inputs, may occur so infrequently as to avoid detection during testing. The generalized version is never used in life safety software because it is so poorly understood by most programmers. Just because you understand it doesn't mean someone in the future won't clean up the code because they don't comprehend the reason it exists.

OldSloGuy