Given C code: The “fib” function is used check the “n” value, if the “n” is 0 it will return false. If the “n” is 1, it will return true. Otherwise the function returns the “fib (n-1) + fib (n-2)”. MIPS instructions: Initially the “fib” loop creates a stack then pushes the values into the stack. Check if the value of “n” is greater than 1, and then go to the “check” loop. Otherwise set “fib (0) = 0”. Finally the “fib” loop jump to the “return” loop. In “check” loop add the “$0” and “1” and store the result in the “$t0” register. Check if the “n” value is greater than 1, if the condition is true goes to the “loop” loop. Otherwise set “fib (1) = 1”. Finally the “check” loop jump to the “return” loop. In “loop” loop subtract the “n” and “1”. Call the loop “fib” with an argument “n-1”. Copy the value to the “fib(n-1)”. Subtract the “n” and “2”. Again call the loop “fib” with an argument “n-2”. Finally the “loop” add “fib (n-1)” and “fib (n-2)” values. In “return” loop pop every elements from the stack. Restore the value. Return the caller value.

Question

Want to see the full answer?

Answer 1

Question

Chapter 2, Problem 2.32E

Program Plan Intro

Given C code:

The “fib” function is used check the “n” value, if the “n” is 0 it will return false. If the “n” is 1, it will return true. Otherwise the function returns the “fib (n-1) + fib (n-2)”.

MIPS instructions:

Initially the “fib” loop creates a stack then pushes the values into the stack.

Check if the value of “n” is greater than 1, and then go to the “check” loop.

Otherwise set “fib (0) = 0”.

Finally the “fib” loop jump to the “return” loop.

In “check” loop add the “$0” and “1” and store the result in the “$t0” register.

Check if the “n” value is greater than 1, if the condition is true goes to the “loop” loop.

Otherwise set “fib (1) = 1”.

Finally the “check” loop jump to the “return” loop.

In “loop” loop subtract the “n” and “1”.

Call the loop “fib” with an argument “n-1”.

Copy the value to the “fib(n-1)”.

Subtract the “n” and “2”.

Again call the loop “fib” with an argument “n-2”.

Finally the “loop” add “fib (n-1)” and “fib (n-2)” values.

In “return” loop pop every elements from the stack.

Restore the value.

Return the caller value.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

cases: Compare the Poisson approximation with the correct binomial probability for the following a. P{X=2} when n = 8, p = 0.2 b. P{X 5} when n = 10, p = 0.5 c. P{X=0} when n = 20, p = 0.2 d. P{X=3} when n = 9, p = 0.1

4. Suppose that the average number of cars abandoned weekly on a certain highway is λ = 1.68. Approximate the probability that there will be (a) No abandoned cars in the next week. (b) At least 2 abandoned cars in the next week. Hint: Model the problem with a Poisson random variable.

od The probability mass function of a discrete random variable X is given by P(X = 1) = {} x=1,2,3,4 10 otherwise (a) Draw the probability mass function (PMF) of this random variable. (b) Draw the cumulative distribution function (CDF) of this random variable. (c) What is P{2< x <4}? Write it in terms of the CDF. (d) What is E[X]? (e) What is Var[X]? (f) What is E[X (6-X)]? (g) What is Var[3X - 2]?