Question

Give the big-Oh notation of the following expression: 1000 + 1000000*n + 5*n^2

Give the big-Oh notation of the following expression:

1000 + 1000000*n + 5*n^2

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

The big -Oh notation of the given expression is: O(n2)

Explanation:

Big o notation provides a tight upper bound and it is a mathematical notation to represent the behavior of a given function.

This notation tells about how long the given source code or algorithm takes to run and used for algorithm analysis.

The given expression is:

= 1000 + 1000000*n + 5*n^2

The given function is a sum of three terms.

The third term has the highest growth and this term is a product of 5 and n2. The first factor doesn't depend upon the n.

So, the big -Oh notation of the given expression is: O(n2)

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
give T(n)=T(n-1)+2^n use substituiton method prove that it’s big oh O(n^2)
give T(n)=T(n-1)+2^n use substituiton method prove that it’s big oh O(n^2)
1.) the following code fragments give running time analysis (Big Oh). Explain your answer: sum2 =...
1.) the following code fragments give running time analysis (Big Oh). Explain your answer: sum2 = 0; sum5 = 0; for(i=1; i<=n/2; i++) { sum2 = sum + 2; } for(j=1; j<=n*n; j++) { sum5 = sum + 5; } i think it is O(n^2) since big oh finds the order of worst case which is the the second loop being n^2 complexity. but im not sure. 2.) Give an efficient algorithm along with running time analysis to find the...
Analyze the worst case running time of the following code in “big-Oh” notation in terms of...
Analyze the worst case running time of the following code in “big-Oh” notation in terms of the variable n. a. void fdisp1(int n) { for(int i=0; i < n; i++) { for(int j=0; j < n; j++) { for(int k=0; k < n; k++) { for(int m=0; m < n; m++) { System.out.println("Hi I am Here"); } } } } } b. voidprintAllPossibleOrderedPairs(intarr[], int size) { for (int i = 0; i < size; i++) { for (int j =...
Fill in the following table, using Big-O notation to give the worst and average-case times for...
Fill in the following table, using Big-O notation to give the worst and average-case times for each of the stack methods for a stack of size N. OPERATION WORST-CASE TIME AVERAGE-CASE TIME constructor empty size push pop peek
Present the running time (in terms of Big-Oh notation) of the operations search, insert, delete, print...
Present the running time (in terms of Big-Oh notation) of the operations search, insert, delete, print all elements, find median, find min/max, successor while implementing a dictionary ADT using (1) Unsorted arrays (2) sorted arrays (3) Balanced BST.
#data structures Give the appropriate execution time efficiency of the following array algorithms using Big-O notation....
#data structures Give the appropriate execution time efficiency of the following array algorithms using Big-O notation. Assume the size of the array is n. a)   Linear Search (average case)   ______________________    b)   Binary Search (worst case)       ______________________    c)   Insertion Sort (best case)       ______________________    d)   Insertion Sort (average case)           ______________________    e)   Quick Sort (average case)           ______________________
The mass action expression (MAE) for the following reaction is equal to what? Ca(OH)2 (s) +...
The mass action expression (MAE) for the following reaction is equal to what? Ca(OH)2 (s) + CO32-(aq) <---> CaCO3(s) + OH- (aq) [CaCO3][OH-]/[Ca(OH)2][CO32-] [OH-]/[CO32-] [Ca(OH)2][CO32-]/[CaCO3][OH-]/ [CO32-]/[OH-]
give the notation(using letter designation for 1) for the subshells denoted by the following numbers? A)...
give the notation(using letter designation for 1) for the subshells denoted by the following numbers? A) n=6, L=2 B)n=5, l=0 C)n=4, l=3 D) n=6,l=1
2. Write the big-O expression to describe the number of operations required for the following two...
2. Write the big-O expression to describe the number of operations required for the following two pieces of code. You need to explain your solution and show your work. (3 points) code 1: counter = 0       for (i = 1; i < n; ++i) {           for (j = 1; j < i; j++) { counter++; }    } code 2: counter = 0; for (i = 1; i < n; ++i) { for (j = 1; j <...
Please write in C++. Write down the pseudo-code for Fibonacci sequence and give the Big-Oh bound...
Please write in C++. Write down the pseudo-code for Fibonacci sequence and give the Big-Oh bound for your algorithm.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT