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.
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.
Thanks for this informative video...I have only one suggestion:the flow chart is not visible while you were explaining the procedure of getting answer....other than that it is good.. thank you very much🤝👍
@@starkendeavours7072 if the dividend is a negative integer, we need to convert it to its two's complement representation and perform the algorithm as usual. The number of cycles required will be the same as for a positive dividend, but sign extension will be required at the end to obtain the correct sign for the quotient.
You save the signs of the operands before the operation to determine the sign of the quotient, and then set their most significant bits to 0 (so that it doesn't affect the actual division), after the division is finished, you set the sign of the quotient (XOR the MSbs of the operands), the sign of the remainder is the always the same as the sign of the dividend.
is it possible complete division in this question... -15 divide by +5 ??? please if u could solve it.. i did and in last i did set it but i had to restore because it was 0 remainder please help?
can somebody tell me how to identify if a given binary bit is +ve or -ve? i know what is sign bit, still how can i differentiate between any randomly given binary number and know?
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.
Honestly you are the ones who should be honoured in ytff. We get to learn what we really need to!!
Thanks a lot!🙏🏻
I was just looking for 3:50. Thank you so much; my doubt has now been cleared.
bro no words can express how helpful this is, thank you bro
You just described it with words.
@@simonriley8696 HAHAHAHAHAHAHAHAHAHAHAHA OH YEAH
hahahahahahahahahhahahahahahahahahahahahahahahahah oh yeah@@rafaelangelopiad8919
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
Very much needed bro...i cannot found this method anywhere on internet...🤘
First i was a little bit confused but after watching his video I'm now more confused
Wht abt non restoring method.. If it was nt to be taught in this video then why the name is included..??
chill re
South mode
Ha na
@@darshanbari2439 sir ka ladka hai kya tu 🙄
@@nikhilkamode9090 woh sir ka ladka hai ki nai pata nahi, pr tu uss ladki ka bhai zaroor lag raha hai 🤣🤣
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
If video is about restoring algorithm then remove (Restoring and non restoring algorithm) the title!
For anyone wondering it is 10 / 3 instead of 9 / 3
Thank you very much sir ... tomorrow i have exam...i understood clearly thanks a lot 🎉
Thank you so much! Much needed video
Thank you so much for clearing the concept✌️
I was searching for such simple explanation and finally came across the video
Thank you sir🤩🤩🤩
Very nice explanation sir ,next time please cover whole page☺️
Noted
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😊
very nice
Good Explanation For Morning Exam
Hats off bro. Superb and good explanation
Thank you so much sir ur teaching way really awesome concept cleared
Very well explained 👍👍Please divide 67÷14 using division algorithm....
Thank you for the great explanation.
I like it and I also understand it .Thank you
Thank you sir ,please provide a clearer image of the flow chart in the description it really helps us a lot!
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.
nice explanation
Helpfull❤️
great explanation , keep it up.
Thank you so much . Great video btw :)
why you not restored A in 3rd cyclce? ..pls reply
You need not restore if the sign is 0
Thank you so much sir for make this video
Thank you so much for this video
thank u for saving my life sir😘😘
thanks it helps me to understand in better way
Explained very well
Got my doubts clear ty sir
Thanks for this informative video...I have only one suggestion:the flow chart is not visible while you were explaining the procedure of getting answer....other than that it is good.. thank you very much🤝👍
Perfect ❤️❣️
Thank you so much sir😊
In last step 00001 remainder in my reader ?
Im assuming that A always has one more digits place than Q to account for sign bit and 2’s complement
Did'nt restore in 3rd cycle??
I do not understand why does A have 5 bits whereas Q has only 4 bits. Could you explain it for me? Thank you so much!
I think its added as a sign bit.
Number of bit +1
trinh cuong No of bits of A= no of bits of Q + 1
You can just use the carry out of the ALU :)
If the numbers are represented in signed 2's complement method then how 1010 becomes decimal 10.
Btw it cleared concept regarding restoring method
Btw means what sister??
By the way
Why we add agr hume subtract krna tha t??
Why u didnt restored in 3rd cycle and last cycle..???
Samanvitha Chidella Restoring A was not needed because we got a positive number(starting with zero).
Yes... I later understood.... But i have forget to delete that comment
Sir Hindi m hi Vdo bnaya kare thodi problem hoti hai samajne m😢😢
How are you doing the count operation? I mean to say by referring which thing you did the count operation?
Is this operation based on the number of bits present in the dividend?? I think that's why you are counting 4 cycles for complete this process.🤔
@@ujjwalsinha1237 Yes You are right.
@@ujjwalsinha1237 What if Dividend is a -ve integer? Will it Count 5 Cycles then?
@@starkendeavours7072 if the dividend is a negative integer, we need to convert it to its two's complement representation and perform the algorithm as usual. The number of cycles required will be the same as for a positive dividend, but sign extension will be required at the end to obtain the correct sign for the quotient.
Sir I have a question, when setiing Qo to 0, then after that why not doing A= A+M
Is this possible only for the unsigned values?? Is there any method for signed??
If sings of the input values are not the same you negate the output value. Thats all.
You save the signs of the operands before the operation to determine the sign of the quotient, and then set their most significant bits to 0 (so that it doesn't affect the actual division), after the division is finished, you set the sign of the quotient (XOR the MSbs of the operands), the sign of the remainder is the always the same as the sign of the dividend.
shouldn't the bit size of A = Q?
In 3rd cycle why not restore pls explain
Because Q0 was 1....use Restore when Q0 is 0
Sir I have a dought at 4th cycle ,why should we stopped at 4th cycle !
Bcz the value of n is 4
But at last step counter value is 1 then there will another step know as it is not zero
same doubt
thank you so much sir...
complimenttt...
Bro place your camera little bit up , we wre not able to see the lower part of block diagram clearly ..
is this balu sir?
thanks bro good explanation
sir aapka video toh bas black lover students hi dekhte honge 😷
Thanks a lot!🙏🏻
Thank you so much 🙏
how to solve this if the dividend is negative?
But reminder should be 00000 why we are getting 00001 ? According to Decimal system 3 is totally dividing 9 leaving reminder as 0.
Dividend is 1010 which is equal to 10 not 9
Exam offline hota to pakka ye aata 5 marks me ab to mcq de rhe hai 😓
Thank you so much bro
Thanks Sir 🙏🏻
after we shift and subtract.... if we get a carry do we discard or keep it??
discard
How to convert the remainder to the fornat bbb.bbb where b is binary numbers?
If there is A-B why he does A+B? Someone explain
Because he found the 2s complement which is basically -B so A+(-B)
thanks so much bhaiiiii
Thank u 💓
Bhai subtraction bol ke addition kyu Kiya
Super teaching
Thanks sir ❤
Can u do binary division for 273/15
is it possible complete division in this question... -15 divide by +5 ??? please if u could solve it.. i did and in last i did set it but i had to restore because it was 0 remainder please help?
Thanku so much
Thank you sir!
can somebody tell me how to identify if a given binary bit is +ve or -ve? i know what is sign bit, still how can i differentiate between any randomly given binary number and know?
If the first bit of the said binary number is 1 it is a negative number, and if it's 0 then it's a positive number.
I like you sir
Y u haven't restore on 3rd cycle
Because A>0 for third cycle
Sir please Hindi ma video bano
I know your English is very good
Thank you!
Sir puri screenc toh dikhao nhin toh mt padhao
Sir can u help me for another example . Dividend=1010, divisor=0100 . Plzz
Sandhya do it similar to video
Thank you sir
Thank you very much
how to divide 9/9?
Shruti Samal generally dividend and divisor won't be the same no
How to perform restoring and non restoring division for the following
11/4
17/8
Dividend =11 =1011= Q
Divisor= 4=00100 =B
If u don't mine can u solve an send me no need to send algorithm only process
I m out of station...I will solve it as early as possible and send u.
Hats off
Good 👍😂👍😂👍😂👍😂👍😂👍😊😊👍
Thanks!
Nice
Onnumea purila values new games edukera step by step explain pannunga
Me too
Respect++
R.I.P Audio
Thank you ;)