The document discusses restoring division in binary arithmetic, detailing steps for a division algorithm. It involves shifting bits, subtracting, and conditionally restoring values based on the sign. An example of dividing 7 by 2 is provided for illustration.

1. Restoring Division
Unit II - ARITHMETIC UNIT
IT2201 – Computer Organization and Architecture
BY
C. Raj Kannan, AP/IT
Kamaraj College of Engineering and Technology

2. Restoring Division
• Shift A and Q left one binary position
• Subtract M from A, and place the answer back in A
• If the sign of A is 1, set q0 to 0 and add M back to A
(restore A); otherwise, set q0 to 1
• Repeat these steps n times

3. Examples
Solve 7/2 by using Restoring Division

4. Thank You