Sunday, November 29, 2009
BINARY DIVISION
Here is an example:
Step1. 1 0 is divisible by 1 0. Enter a quotient of 1. Multiply 1 by 1 0 . Subtract 1 0 by 1 0.
Step2. 1 0 - 1 0 is 0. We bring down 1. Since 0 1 is not divisible by 1 0. We enter a 0 into the quotient.
Then step3. We bring down the last digit 1. Now we'd have to divide 0 1 1 by 1 0, so we enter 1 to have 0 1 1 - 1 0.
Perform the subtraction operation of 0 1 1 and 1 0 to get 1. This will be our remainder.
The final answer is 1 0 1 remainder 1.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment