Write, assemble, and test a program that calculates the sum of all "divisible by the number that is a result of the last 4 digits of your students ID module 15" numbers from the range [n,m].
For this exercise you are required to use subroutine/procedure.
Calculate sum/product in the main procedure;
Check if the number is "divisible by x" in the subroutine/procedure.

YOU CAN NOT USE multiplication or division instructions!!!

Solution PreviewSolution Preview

These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.

include    ; from Irvine CDROM

.stack 4096

greeting byte "enter the last 4 digits of your students ID : ", 0   ; message to write
getN byte "enter n : ", 0   ;
getM byte "enter m : ", 0   ;
printSum byte "sum : ", 0   ;
newline byte " ", 10,0   ;

intVal DWORD ?
mVal DWORD ?
candidate DWORD ? ; numbers from n to m
sum DWORD ?...

By purchasing this solution you'll be able to access the following files:

for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

Find A Tutor

View available Assembly Language Programming Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.

Upload a file
Continue without uploading

We couldn't find that subject.
Please select the best match from the list below.

We'll send you an email right away. If it's not in your inbox, check your spam folder.

  • 1
  • 2
  • 3
Live Chats