divide 21 by 4 using restoring and non restoring division algorithms 66447

Name: divide 21 by 4 using restoring and non restoring division algorithms 66447
Uploaded: 2023-09-05T04:13:45-08:00
Duration: 6 min 39 s
Channel: Supreeta N
Description: divide 21 by 4 using restoring and non restoring division algorithms 66447

Divide 21 by 4 using restoring and non restoring division...

Transcript

00:01 Hello student here we have to perform the division by the restoring and non -restoring method so here 21 and 4 are given dividend and divisor is given so here first what we have to do first i am doing this division with the help of a restoring division algorithm so first convert the number to the binary so both numbers are converted into the binary these are the decimal number so 21 is converted into the binary which comes 10101 and 4 is converted into the binary which comes 00100 so here this is the binary conversion of the dividend and the divisor and after this step 2 initialize the register so here we have to use a register because we are using the restoring division algorithm so we have to store somewhere so we are using register here after this quotient initially we declared five zeros because we have not performed the division yet now and result will be stored in the quotients register so dividend register equal to 10101 and the divisor is this one so here 21 here and 4 is this one so this is dividend and this is divisor after this step 3 perform the division we will perform 5 iteration the number of the bits in the dividend so according to number of bit we perform the iteration so here 5 bits so here we will perform the 5 iterations so number 1 shift q and dr left bringing a bit from dr to the right of the qr so here shift q and dr left so we have to shift the q so here first 00001 and dr register will become 01010 in this way here the dr register is 10101 so here after shifting this become this in this way suppose here dr carry 10101 so now i have to shift its bit so when i shift 1 bit so the value become like this 0101 and i will here this to make the 5 bits i will add here 0 and this one will go to the quotient register so 00001 so this one will come here subtract qr from dr now we are performing division so we have to subtract the qr from the dr dr is the dividend register so from the dividend register now dividend register will become like this this dividend register now i have to subtract the qr so its r divisor now this become like this so no change positive since the result is positive since the first bit of the q is 1 so iteration 2 now we will shift to the iteration 2 and after shifting to the iteration 2 shift q and dr left so after shifting the result will be like this and after subtracting this will become positive since the second bit of the q is 1 so iteration 3 after performing third result will be like this so iteration 4 and after shifting and subtracting the result will be like this and now iteration 5 first we will shift in q and dr and after this we will subtract and now the result is this so convert the quotient to the decimal so here our quotient is coming this its decimal is 20 so after performing the division we get the result 20 here in the non -restoring method convert the number to the binary similar initialize the register quotient register similar dividend register divisor register perform the division we will perform in the 5 iteration because of the number of the bits 5 so here iteration 1 shift q and dr left bringing a bit from dr to the right of qr so here shifting now shift the dr register bit and the q so similar q become 00001 and dr become 01010 because of shifting so here set the first bit of the q to 1 this is our answer so in answering first we have stored the first bit 1 after this iteration 2 now shift q and dr to the left and now after add qr to dr so here we are not subtracting the dividend and divisor so here what we are doing we are adding qr to the dr so we are adding here so here we are performing the addition operation in the non -restoring so here we add first we add here after this in the second iteration we are adding here so select the second bit of the q is also 1 so second bit is also 1 so here second bit is 1 also now subtract the qr from the dr now we are performing here subtraction subtract qr from dr in these two steps we are adding and here we are subtracting so here we are subtracting and it's coming positive so the result is 1 now shift qr to the left and subtract qr from the dr and in this way iteration 5 and here convert the quotient q to the decimal same as before so it's coming 20 so using the non -storing algorithm 21 divided by 4 20 just like with the storing algorithm so both the give the same output in storing storing and non -restoring result 20...

Question

Divide 21 by 4 using restoring and non restoring division algorithms.

Question

Divide 21 by 4 using restoring and non restoring division algorithms.

Please give Ace some feedback