The following codes run on the five-stage pipelined datapath. for each piece of code,
answer the following questions.
a) without forwarding, insert the necessary number of ‘nops’ for the code to execute correctly
b) with the forwarding unit available (only supports forwards mem-> ex and wb-> ex), show
how the code will execute. mention the data that’s forwarded between the stages. use ‘nops’
only when necessary.
code 1:
sub t1, t2, t3
add t1, t4, t5
or t4, t2, t6
code 2:
and t2, t5, t1
sub t3, t2, t0
nor t7, t1, t5
code 3:
and t2, t5, t1
sub t3, t2, t0
nor t7, t2, t1
code 4:
lw t1, 22(t0)
and t2, t1, t3
code 5:
lw t1, 22(t0)
sub t6, t0, t2
xor t3, t1, t5

1)consider the following code snippet: #ifndef book_h#define book_hconst double max_cost = 1000.0; class book{public: book(); book(double new_cost); void set_cost(double new_cost); double get_cost() const; private: double cost; }; double calculate_terms(book bk); #endifwhich of the following is correct? a)the header file is correct as given.b)the definition of max_cost should be removed since header files should not contain constants.c)the definition of book should be removed since header files should not contain class definitions.d)the body of the calculate_terms function should be added to the header file.

The volume v and paper surface area a of a conical paper cup are given by where r is the radius of the base of the cone and h is the height of the cone. a. by eliminating h, obtain the expression for a as a function of r and v. b. create a user-de ned function that accepts r as the only argument and computes a for a given value of v. declare v to be global within the function. c. for v ! 10 in.3 , use the function with the fminbnd function to compute the value of r that minimizes the area a. what is the corresponding value of the height h? investigate the sensitivity of the solution by plotting v versus r. how much can r vary about its optimal value before the area increases 10 percent above its minimum value?

To check whether your writing is clear , you can