a complete assembly language program which asks the user for a number n,
and calculates and prints n! (n!,
or n factorial, is 1 * 2 * 3 * … * n). (Your program does not have to be recursive.) What is
the largest value of n for which n! is correctly calculated
by your program?
the program from the previous part to compute n! using
single precision floating point numbers.
what is the largest value of n for which n! is computed exactly?
is the largest value for which the value of n! is
is a memory location containing a double precision floating point number x.
Write an assembly language code fragment to calculate x^3/13.0 – x. [That’s
“x cubed divided by 13.0 minus x” .] (You aren’t required to assemble and
run this code, but it might be a good idea to make sure you’ve done it