In Math, a division can be denoted as: dividend divisor = quotient..... remainder. For example 7+2...

Transcribed Image Text:

In Math, a division can be denoted as: dividend divisor = quotient..... remainder. For example 7+2 = 3 R1 Remainder Please implement a division: 123 + 10 (they are decimal numbers). You program will not be terminated until quotient is less than divisor. Please push the remainder separately into stack. For example, 1. 123 10 12 (quotient).....(remainder) = push 3 into stack 2. 12 10 1 (quotient).....2(remainder) push 2 into stack 3. 1 is less than 10, your program ends and also push 1 into stack In your program, please use (1) AL to save dividend; (2) DL to save divisor; (3) BX to save remainder. Assume (1) all registers are already initialized with 0; and (2) decimal numbers can be stored in registers. main PROC ? main PROC *** main ENDP END main Write down code to finish the part between the main PROC and ENDP In Math, a division can be denoted as: dividend divisor = quotient..... remainder. For example 7+2 = 3 R1 Remainder Please implement a division: 123 + 10 (they are decimal numbers). You program will not be terminated until quotient is less than divisor. Please push the remainder separately into stack. For example, 1. 123 10 12 (quotient).....(remainder) = push 3 into stack 2. 12 10 1 (quotient).....2(remainder) push 2 into stack 3. 1 is less than 10, your program ends and also push 1 into stack In your program, please use (1) AL to save dividend; (2) DL to save divisor; (3) BX to save remainder. Assume (1) all registers are already initialized with 0; and (2) decimal numbers can be stored in registers. main PROC ? main PROC *** main ENDP END main Write down code to finish the part between the main PROC and ENDP

Answer rating: 100% (QA)

Step1 Here is an execution of the division calculation in x86 Low level computing construct fundame... View the full answer