Retaking the Assembly project¶
If you are retaking the Assembly project you will need to implement the calculating prime application as explained in Course Project 2025.
We are providing two pieces of code that might be useful for you:
Do not use any of this code in any of the exercises of Module3. If you do it, it will be considered plagiarism and the exercise wont be considered
Requirements and suggestions¶
- Your code must pass 14/20 tests
- Your code must use subroutines
- Your code should check the following witnesses:
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37 - Your code should collect the numbers to be tested starting by the memory position stored in
%r8 - Your code MUST use a stack. You can define the position of stack, but position 0x1000 is a good place. You must initialize correctly %rsp and %rbp to that position in the begining of your app. Remember that the stack should not collide with the array where we store the Fibonacci numbers (position 0x1800 or bigger)
- Your code should be correctly commented
- Your code should not overpass 1,500,000 steps
Assessment¶
- Final project is evaluated as PASS/FAIL.
- If your code pass 14/20 tests and meet previous requirements it will be graded as PASS. Otherwise, it will be graded as FAIL
- If your code cannot complete within the 300000 instructions is considered FAIL.
If your code is graded as PASS the Module 4 is graded with 8 points.
EXTENDED DEADLINE 2026-03-06 23:59