Objectives of this assignment: to explore time complexity and real time to dust off programming skills...

Transcribed Image Text:

Objectives of this assignment: to explore time complexity and "real time" to "dust off" programming skills What you need to do: 1. Implement a simple algorithm A to compute the sum ax where where a and x are a real numbe with 0 x 1. 2. Collect the execution time T(n) of algorithm A as a function of n T(n) 3. Plot the functions (n), and on separate graphs. T(n) n' n " n 4. Refer to the analysis of the time complexity your performed for your Module I and discuss it in light the plots you plotted above. Objective: The objective of this programming assignment is to implement in your preferred* language an algorith A to compute the sum 0 ax where a and x are a real numbers (0 x 1). We are interested in explorir the relationship between the time complexity and the "real time (wall time). For this exploration, you w T(n) T(n) and T(n) collect the execution time T(n) of Algorithm A as a function of n and plot 2" on different graph Finally, discuss your results: use the plots you will build to determine and justify the time complexity of T(n). Algorithm A Compute SumPowers (a,xn) n inputs: x is a real number with 0 x 1. a is a real number. n is an integer (n 0) output: a real number equal to axi sum = 0 prod = 1 for i = 1 to n sum = sum + prod prod = prod * X return a*sum Objectives of this assignment: to explore time complexity and "real time" to "dust off" programming skills What you need to do: 1. Implement a simple algorithm A to compute the sum ax where where a and x are a real numbe with 0 x 1. 2. Collect the execution time T(n) of algorithm A as a function of n T(n) 3. Plot the functions (n), and on separate graphs. T(n) n' n " n 4. Refer to the analysis of the time complexity your performed for your Module I and discuss it in light the plots you plotted above. Objective: The objective of this programming assignment is to implement in your preferred* language an algorith A to compute the sum 0 ax where a and x are a real numbers (0 x 1). We are interested in explorir the relationship between the time complexity and the "real time (wall time). For this exploration, you w T(n) T(n) and T(n) collect the execution time T(n) of Algorithm A as a function of n and plot 2" on different graph Finally, discuss your results: use the plots you will build to determine and justify the time complexity of T(n). Algorithm A Compute SumPowers (a,xn) n inputs: x is a real number with 0 x 1. a is a real number. n is an integer (n 0) output: a real number equal to axi sum = 0 prod = 1 for i = 1 to n sum = sum + prod prod = prod * X return a*sum

Answer rating: 100% (QA)

To implement the algorithm A and analyze its time complexity you can follow these steps Implement the algorithm in your preferred programming language ... View the full answer