Multiplication Algorithm | Signed Magnitude Data || Computer Organization and Architecture

[@dionjohnson4655]

great thanks maan beautifully explained of really helpful topic

[@aryangupta9800]

Great video 👍

[@roshnivishwakarma1799]

Thankyou so much mam it really helped me!!

[@DrSapnaKatiyar]

Thanks Roshni...
Please subscribe and share with others also...

[@twinharsh7945]

thnxx mam...!!!

[@amitgangwar5843]

11:04 Excuse me mam , tell me that SC

[@GalAxy-ww3kr]

She's mixing water and oil
If these numbers is singned magnitude i will assume as -7 and -3 and the answer must be + 21// wrong
If numbers are unsigned, i will assume as 23 and 19 and the solution is correct
For singned numbers multiplication, the booths algorithm is the correct choice

[@AtulSharma-kr1hq]

Thank you ma'am

[@akshatk448]

mam please explain with one negative number , if br is negative the we take 2s complement of br , answer is not correct

[@divyaarora25]

What is the result of 011101 multiplied by 110101, where both the numbers are signed?

[@sushobhitjakhmolaAdmin]

question 1:
What does n really mean? is it register size or just the no of bits to represent mutiplier , however taking it any way wont change the answer
Question 2:
assume we B and Q are 8 bit registers, but in this algorithm you are consider all bits of B , which is wrong.
suppose B : 10111011 (-ve number in signed representation) and A : 1001
then we have to ignore the msb of B but it has not been addressed in video
Ques 3: why are we doing Qs:Qs xor Bs
if the number is negative , As should be enough to store its sign

[@shreshthamathur2169]

Thankuu maam 💫

[@DrSapnaKatiyar]

Thanks...
Please subscribe and share with others also...

[@jhanvigupta1743]

Could you pls provide it's notes?

[@AtulSharma-kr1hq]

Ma'am aap next vedio kb upload karengi

[@DrSapnaKatiyar]

Atul very soon.