Page 274 - FUNDAMENTALS OF COMPUTER

274 Fundamentals of Computers NPP

Procedure Quotient
 Subtract divisor 10 from 1. The Q 0100
result is 11 with a Borrow (B) = 1 Divisor Dividend
 Since B → 1, Q-bit is “0”, add 10. 1 0 1 0 0 1
 When add, neglect end carry (Bit – 1 0
1 is restored here) Borrow = 1 1 1
 append next bit (0 here) + 1 0
 subtract divisor × 1 0
 since no borrow, Q-bit is 1 – 1 0
 append next bit (0 here) Borrow = 0 × 0 0
 subtract (10) – 1 0
 Since B → 1, Q bit is “0”. Now Borrow = 1 1 0
add divisor 10 + 1 0
 Neglect end carry and append × 0 1
next bit – 1 0
(1 here). NPP Borrow = 1 1 1
 Subtract (10) + 1 0
 Since B → 1, then Q-bit is “0”. × 1
Add (10)
 The remaining bit is 1, which is Remainder
remainder
 Quotient is 0100 Remainder = 1
Quotient = 0 1 0 0
The result can be viewed like this: AV… n[aUm_ Bg àH$ma go àmá hmoJm…

1001 1001
Quotient = 0100 with remainder = 01 ^mJ\$c = 0100 , eof\$c = 01
10 10
This can be verified after converting the Bg CÎma H$s Om±M h_ Xe_bd _| n[adV©Z H$aHo$
numbers into decimal. Because: H$a gH$Vo h¢ Š`m|{H$…
9 = 4 , with remainder 1 9
2 2 = 4 , ^mJ\$b d eof\$b = 01
The whole procedure can be shown with
the following flow chart: g§nyU© {d{Y H$mo Bg âbmo MmQ>© go Xem©`m Om gH$Vm
h¡…