Question: 1: Programming Problems 2 Marks Each- I suggest you stick to MARS for this, it's possible to use SPIM but more of a headache to

1: Programming Problems 2 Marks Each- I suggest you stick to MARS for this, it's possible to use SPIM but more of a headache to setup and mark. Submit your source code, and documentation on how you tested it. + Program 1: Write a MIPS program that asks the user for two number inputs (we'll call them a and b), calculate and print to screen in this order: a b,a*b, a + b, if b is not 0, also calculate a/b. Then check if a + b is in the range 10 ... 20. Stick to integers, but allow positive or negative values (don't check input types, and don't test edge cases like very large integers) Program 2: Write a MIPS program that will ask the user for a negative integer (we will call this n), check if it is negative, if not throw an error. Iteratively calculate the factorial of n*n*n*n (n). Assume nis between 0 and -5, there are some issues with factorial calculations with big numbers which we will discuss in class... don't sign yourself up for those). Recursion is a problem for future assignments, so do this iteratively. 1: Programming Problems 2 Marks Each- I suggest you stick to MARS for this, it's possible to use SPIM but more of a headache to setup and mark. Submit your source code, and documentation on how you tested it. + Program 1: Write a MIPS program that asks the user for two number inputs (we'll call them a and b), calculate and print to screen in this order: a b,a*b, a + b, if b is not 0, also calculate a/b. Then check if a + b is in the range 10 ... 20. Stick to integers, but allow positive or negative values (don't check input types, and don't test edge cases like very large integers) Program 2: Write a MIPS program that will ask the user for a negative integer (we will call this n), check if it is negative, if not throw an error. Iteratively calculate the factorial of n*n*n*n (n). Assume nis between 0 and -5, there are some issues with factorial calculations with big numbers which we will discuss in class... don't sign yourself up for those). Recursion is a problem for future assignments, so do this iteratively
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
