Problem 2: Consider the following sequential pseudo-code segment, in which n 1 is an integer. for...

Transcribed Image Text:

Problem 2: Consider the following sequential pseudo-code segment, in which n 1 is an integer. for i 0 ton do oin Compute function f(i) end (25 points) Suppose that computing f(i) needs t(i) time, m(i) memory and p(i) energy. Observe that the total time for the computation is additive over the iterations in a sequential execution. The total energy consumed is also additive over the iterations. Assuming memory can be reused across the iterations, the memory usage of the for loop is the largest of the usage across all iterations. (a) If t(i) =i+1, m(i) = 2* and p(i) = 5, then what is the total time, memory and energy usage of the for loop? (b) Repeat the above part for t(i) = 2ni, m(i) = i and p(i) = 2ni. Problem 2: Consider the following sequential pseudo-code segment, in which n 1 is an integer. for i 0 ton do oin Compute function f(i) end (25 points) Suppose that computing f(i) needs t(i) time, m(i) memory and p(i) energy. Observe that the total time for the computation is additive over the iterations in a sequential execution. The total energy consumed is also additive over the iterations. Assuming memory can be reused across the iterations, the memory usage of the for loop is the largest of the usage across all iterations. (a) If t(i) =i+1, m(i) = 2* and p(i) = 5, then what is the total time, memory and energy usage of the for loop? (b) Repeat the above part for t(i) = 2ni, m(i) = i and p(i) = 2ni.