Task 03 Write a program which stores a large number in AX, stores another smaller number in BX. Now ask whether the user wants to divide or multiply. User will give 'D' for Division or 'M' for Multiplication. If the user wants to divide, then perform AX / BX using repeated subtraction and print the final remainder. And if the user wants to multiply then perform AX * BX using repeated summation and then print the final result. You will not be able to use the "DIV" or the "MUL" function here. And you do not have to take overflow into account i.e. the test cases should be done without using any numbers which can cause overflow.
Task 03 Write a program which stores a large number in AX, stores another smaller number in BX. Now ask whether the user wants to divide or multiply. User will give 'D' for Division or 'M' for Multiplication. If the user wants to divide, then perform AX / BX using repeated subtraction and print the final remainder. And if the user wants to multiply then perform AX * BX using repeated summation and then print the final result. You will not be able to use the "DIV" or the "MUL" function here. And you do not have to take overflow into account i.e. the test cases should be done without using any numbers which can cause overflow.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Solve in Assembly language by emu8086
Transcribed Image Text:Task 03
Write a program which stores a large number in AX, stores another smaller number in BX. Now
ask whether the user wants to divide or multiply. User will give D' for Division or 'M’ for
Multiplication. If the user wants to divide, then perform AX / BX using repeated subtraction and
print the final remainder. And if the user wants to multiply then perform AX * BX using repeated
summation and then print the final result. You will not be able to use the "DIV" or the "MUL"
function here. And you do not have to take overflow into account i.e. the test cases should be done
without using any numbers which can cause overflow.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY