Trusted by millions of Kenyans
Study resources on Kenyaplex

Get ready-made curriculum aligned revision materials

Exam papers, notes, holiday assignments and topical questions – all aligned to the Kenyan curriculum.

Multiply the following pair of signed 2’s complement numbers using the Booth algorithm. Assume A is the multiplicand and B is the multiplier. Show all...

Multiply the following pair of signed 2’s complement numbers using the Booth algorithm. Assume A is the multiplicand and B is the multiplier. Show all the steps. No partial credit will be awarded unless all steps are shown.

A = 010111, B = 110110

Answers


KELVIN
Multiplicand 0 1 0 1 1 1
Multiplier 1 1 0 1 1 0
Double length PP 0 0 0 0 0 0 0 0 0 0 0 0

Step 0, bit pair 00 0 0 0 0 0 0 0 0 0 0 0 0
Action -- 0 0 0 0 0 0 0 0 0 0 0 0
Shift rt. 0 0 0 0 0 0 0 0 0 0 0 0

Step 1, bit pair 10 0 0 0 0 0 0 0 0 0 0 0 0
Action: SUB 1 0 1 0 0 1 0 0 0 0 0 0
Shift rt. 1 1 0 1 0 0 1 0 0 0 0 0

Step 2, bit pair 11 1 1 0 1 0 0 1 0 0 0 0 0
Action: -- 1 1 0 1 0 0 1 0 0 0 0 0
Shift rt. 1 1 1 0 1 0 0 1 0 0 0 0

Step 3, bit pair 01 1 1 1 0 1 0 0 1 0 0 0 0
Action: ADD 0 1 0 0 0 1 0 1 0 0 0 0
Shift rt. 0 0 1 0 0 0 1 0 1 0 0 0

Step 4, bit pair 10 0 0 1 0 0 0 1 0 1 0 0 0
Action: SUB 1 1 0 0 0 1 1 0 1 0 0 0
Shift rt. 1 1 1 0 0 0 1 1 0 1 0 0

Step 5, bit pair 11 1 1 1 0 0 0 1 1 0 1 0 0
Action: -- 1 1 1 0 0 0 1 1 0 1 0 0
Shift rt. 1 1 1 1 0 0 0 1 1 0 1 0

kalvinspartan answered the question on July 7, 2018 at 08:13

Answer Attachments

Exams With Marking Schemes

Related Questions