Restoring Division Algorithm(KTU COA Module 2 Syllabus)

[@AyushRaj-lm9yp]

Nicely Explained.... understood very well

[@peperoni7103]

this video> other explaining videos

[@sahdevsingh8858]

Is MSB first bit of the binary representation? I think its the last bit of any binary represented number

[@TONY-qb5he]

Superr baby.. ❤

[@ChabPoha]

why u didnt consider sign bit

[@ForthGay]

very good explanation

[@alakhjee8903]

Patre kamariya jingi bhar rahi ae rajaji...

[@niteshkumar4876]

Great mam 👍

[@suraj-sc9ne]

excellent ma'am thank you!

[@Maha-ro2uz]

Great explanation mam TQ 🙂👍

[@lavanyabhosale]

How did you take one extra zero in 3 binary representation

[@Besankaladduu]

Just to handle borrow While addition or substraction We can add extra bits (zeros) before

[@muskanchhabra4929]

In every question we have to do this?

[@Besankaladduu]

​​@@muskanchhabra4929No you just have to see the Number of "n" (no. Of bits in Binary representation of Dividend or 11 = *1011* ) which is 4 here , so your "A" should be One more than "n" thus having 5 bits. Just coz binary of 2 = *11* (have two bits) so we add 3 more Zero bits to handle the carry . Always "A" would have one more bit than "n" Did I explain it well?

[@muskanchhabra4929]

@@Besankaladduu understood thanks and I have one more doubt what if we are given negative number like -7/3 then we will take q = 7 or -7

[@Besankaladduu]

@@muskanchhabra4929 we take 1's compliment of that number to represent negative

[@nikhilenjirapu]

❤

[@meme_723]

Thanks madam ❤

[@prashantrasaily4905]

Well explained Maam....😁

[@deepakkushwaha1392]

small correction ---> quotient is in Q and remainder is in A

[@abhishekak8597]

Thankyou ma'am

[@HappyMishra-r9t]

Thankyou mam

[@rushikasuram5980]

1:50

[@chmod-o]

answer wrong xa

[@bikdigdaddy]

excellent video & the like:dislike ratio is excellent.