Project 4 - Nested Loops and Procedures
Due Sunday by 11:59pm Points 50 Submitting a file upload File Types asm
Available after Feb 7 at 12am
Submit Assignment
Introduction
The purpose of this assignment is to reinforce concepts around procedures, nested loops,
and data validation (CLO 3, 4). Please be sure to thoroughly check the rubric - there are
some specific requirements with point penalties if they are not satisfied.
1. Designing and implementing procedures
2. Designing and implementing loops
3. Writing nested loops
4. Understanding data validation
What you must do
Program Description
Write a program to calculate prime numbers. First, the user is instructed to enter the number of primes
to be displayed, and is prompted to enter an integer in the range [1 ... 200]. The user enters a number,
n, and the program verifies that 1 ≤ n ≤ 200. If n is out of range, the user is re-prompted until they
enter a value in the specified range. The program then calculates and displays the all of the prime
numbers up to and including the n prime. The results must be displayed 10 prime numbers per line,
in ascending order, with at least 3 spaces between the numbers. The final row may contain fewer than
10 values.
Program Requirements
1. The programmer’s name and program title must appear in the output.
2. The counting loop (1 to n) must be implemented using the LOOP instruction.
3. The main procedure must consist of only procedure calls (with any necessary framing). It should
be a readable "list" of what the program will do.
4. Each procedure will implement a section of the program logic, i.e., each procedure will specify how
the logic of its section is implemented. The program must be modularized into at least the following
procedures and sub-procedures:
getUserData
validate
showPrimes
isPrime
farewell
The upper and lower bounds of user input must be defined as constants.
If the user enters a number outside the range [1 ... 200] an error message must be displayed and
the user must be prompted to re-enter the number of primes to be shown.
The program must be fully documented and laid out according to the CS271 Style Guide. This
includes a complete header block for identification, description, etc., a comment outline to explain
each section of code, and proper procedure headers/documentation.
Notes
1. For this program, you may use global variables instead of passing parameters in memory or on the
stack. This is a one-time relaxation of the standards so that you can get accustomed to using
procedures.
2. A number k is prime if it is an integer with exactly 2 distinct divisors: 1 and k. Note that this implies
that
a. 1 is not prime.
b. k must be positive.
3. There are several ways to make your isPrime procedure efficient. Feel free to discuss algorithms
on Piazza and Slack.
4. Check the Course Syllabus for late submission guidelines.
5. Find the assembly language instruction syntax and help in the CS271 Instructions Guide.
6. To create, assemble, run, and modify your program, follow the instructions on the course Syllabus
Page’s "Tools" tab.
Resources
Additional resources for this assignment
Project Shell with Template.asm
CS271 Style Guide
CS271 Instructions Reference
CS271 Irvine Procedure Reference
What to turn in
Turn in a single .asm file (the actual Assembly Language Program file, not the Visual Studio solution
file). File must be named "Proj4_ONID.asm" where ONID is your ONID username. Failure to name
files according to this convention may result in reduced scores (or ungraded work). When you
resubmit a file in Canvas, Canvas can attach a suffix to the file, e.g., the file name may become
2/19/2021 Project 4 - Nested Loops and Procedures
https://canvas.oregonstate.edu/courses/1798799/assignments/8201478 3/8
Proj4_ONID-1.asm. Don't worry about this name change as no points will be deducted because of
this.
Example Execution
User input in this example is shown in boldface italics.
Prime Numbers Programmed by Euclid
Enter the number of prime numbers you would like to see.
I’ll accept orders for up to 200 primes.
Enter the number of primes to display [1 ... 200]: 301
No primes for you! Number out of range. Try again.
Enter the number of primes to display [1 ... 200]: 0
No primes for you! Number out of range. Try again.
Enter the number of primes to display [1 ... 200]: 31
2 3 5 7 11 13 17 19 23 29
31 37 41 43 47 53 59 61 67 71
73 79 83 89 97 101 103 107 109 113
127
Results certified by Euclid. Goodbye.
Extra Credit (Original Project Definition must be Fulfilled)
To receive points for any extra credit options, you must add one print statement to your program
output per extra credit which describes the extra credit you chose to work on. You will not receive
extra credit points unless you do this. The statement must be formatted as follows...
--Program Intro--
**EC: DESCRIPTION
--Program prompts, etc—
Extra Credit Options
1. Align the output columns (the first digit of each number on a row should match with the row above).
(1pt)
2. Extend the range of primes to display up to 4000 primes, shown 20 rows of primes per page. The
user can “Press any key to continue …” to view the next page. Since length of the numbers will
increase, it’s OK to display fewer numbers per line. (2pt)
Grading criteria
2/19/2021 Project 4 - Nested Loops and Procedures
https://canvas.oregonstate.edu/courses/1798799/assignments/8201478 4/8
Project 4 Rubric
Please view the rubric attached to this assignment to understand how your assignment will be graded.
If you have any questions please ask on the course discussion board.
Criteria Ratings Pts
Files Correctly Submitted
Submitted file is correct assignment and is an
individual .asm file.