Restoring Algorithm _

1. UNSIGNED DIVISION - RESTORING ALGORITHM (CO-2, BL-3) -Anisha Mahato (Assistant Professor, CSE-SPL)

2. FLOWCHART Start M<- Divisor n <- no. Of bits Q <- Dividend A <- 0 Shift Left AQ A= A - M Sign bit of A? Q[0] =0 Restore A Q[0] = 1 n = n-1 Is n = 0? Quotient in Q And Remainder in A Stop =1 =0

3.  Example:  11(Dividend) / 3 (Divisor) = 3 (Quotient) and 2 (Remainder)  M (Divisor) = 3 = 00011  -M= 11101  Q (Dividend) =11 = 1011  A=0 =00000

4. TRACING n M A Q Action 4 00011 00000 1011 Initialization 00001 011_ SL AQ 11110 011_ A= A-M 3 00001 0110 Q[0]<-0, Restore A 00010 110_ SL AQ 11111 110_ A=A-M 2 00010 1100 Q[0]<- 0, Restore A 00101 100_ SL AQ 00010 100_ A= A-M 1 00010 1001 Q[0]<- 1 00101 001_ SL AQ 00010 001_ A= A-M 0 00010 0011 Q[0]<- 1

Restoring Algorithm _

More Related Content

More from SwatiHans10 (20)

Recently uploaded (20)

Restoring Algorithm _