1. Give the computational complexity of the following piece of code in Big-Oh notation and explain...

Transcribed Image Text:

1. Give the computational complexity of the following piece of code in Big-Oh notation and explain how you arrived at your result: for(i=1;i QUESTION 6 What is the computational complexity of the function f(n)= n + 50? constant logn linear nlogn polynomial exponential all of the above none of the above QUESTION 7 What is the computational complexity of the function f(n)= 100n(5n+ 1)? constant logn linear nlogn polynomial exponential all of the above none of the above QUESTION 8 What is the computational complexity of the function f(n)= 700n^2 + 16nlogn? constant logn linear nlogn polynomial exponential all of the above none of the above The following complexity analysis questions are from the textbook. For each of the following code fragments, find the a. Exact number of operations for the code (statements) in rectangles [More clarification: Consider each statement inside the body of the loop (the red rectangle) as one operation. So for example, Amm = bom-com can be considered as three accesses, one addition and one assignment, for this homework, please consider it as one operation. Furthermore, you may ignore the costs of loop operations. Hence for the following loop: for(int index = 3; index 1. Give the computational complexity of the following piece of code in Big-Oh notation and explain how you arrived at your result: for(i=1;i QUESTION 6 What is the computational complexity of the function f(n)= n + 50? constant logn linear nlogn polynomial exponential all of the above none of the above QUESTION 7 What is the computational complexity of the function f(n)= 100n(5n+ 1)? constant logn linear nlogn polynomial exponential all of the above none of the above QUESTION 8 What is the computational complexity of the function f(n)= 700n^2 + 16nlogn? constant logn linear nlogn polynomial exponential all of the above none of the above The following complexity analysis questions are from the textbook. For each of the following code fragments, find the a. Exact number of operations for the code (statements) in rectangles [More clarification: Consider each statement inside the body of the loop (the red rectangle) as one operation. So for example, Amm = bom-com can be considered as three accesses, one addition and one assignment, for this homework, please consider it as one operation. Furthermore, you may ignore the costs of loop operations. Hence for the following loop: for(int index = 3; index