## Still very confused

This is from a previous reply in red myquestions and in blue what i think this reply might be right but istill don't understand it.

Given x = 10 0101(two) and y = 11 0110(two) intwo’s complementbinary representation, perform showing allwork

a.    x × y using standard shift and addmethod.
b. using Booth’s algorithm
which method is more efficient in this case?

_____________________________________________________________________________

I keep trying to convertthem to decimal and multiplying them and then convert them to checkthe answers but they don't match. Also for the shift and add i gota different answer) Please help! Thanks

Given data:

X=100101 (what would this number be indecimal?) I get this to be-27

Y=110110 (what would this number be indecimal?) I get this to be-10

a) x × y using standard shiftand add method:

A standard approach that might be taken by a novice to performmultiplication is to "shift and add",That is, for each column inthe multiplier, shift the multiplicand the appropriate number ofcolumns and multiply it by the value of the digit in that column ofthe multiplier, to obtain a partial product. The partial productsare then added to obtain the final result:.

                1 0 0 1 0 1

                1 1 0 1 1 0

                1 0 0 1 0 1

              1 0 0 1 0 1

            0 0 0 0 0 0

          0 0 0 0 0 0

        1 0 0 1 0 1

        1 0 1 0 1 1 1 1 1 1 (is this a right answer and what would it be in decimal?) This has to be a positive number and to me this is overflow

  _____________________________

With this system, the number of partial products is exactlythe number of columns in the multiplier.
B). using Booth’s algorithm:

______________________________________________________
MultiplicandB=100101       E         A              Q                 SC
______________________________________________________

Multiplier inQ                    0       000000    110110            101
Qn=0;Shift rightEAQ        0       000000    011011            100
________
First Partialproduct          0       100101
Shift rightEAQ                   0       010010    101101            011
_________
Second Partialproduct    1      011011
Shift rightEAQ                  0      101101      110110            010
Qn=0;Shift right EAQ       0       010110      111011             001
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}