Question: ALGORITHMS AND PROGRAMMING TECHNIQUES Q2: (10 Pts.) A. In each of the following situations, indicate whether f= O(g), or f= 2(g), or both f=lg). 1.

ALGORITHMS AND PROGRAMMING TECHNIQUES

Q2: (10 Pts.) A. In each of the following situations, indicate whether f= O(g), or f= 2(g), or both f=lg). 1. f(n)=n - 100 and g(n)=n-200. 2. f(n)=n1/2 and g(n)=n2/3. 3. f(n)= 100n +logn and g(n)=n +(logn)2. 4. f(n) = 10 logn and g(n)=log(n2). 5. f(n)=n2/logn and g(n)=n(logn). B. For this code answer the following ALGORITHM Mystery (n) S = 0 fori 1 to n do st S + i*i Return s (a) What does the algorithm computes? (6) Write the running time for each line, and derive the exact time? (c) What is the basic operation? (d) What is the efficiency class of this algorithm? (e) Can we do better algorithm

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q1) A. Prove or disprove (2 Pts.) If f(n) is O(g(n)). Is then 2 f(n) = O(2 g(n) )? f(n) = O(g(n)), then g(n) = O(f(n)). n k = (2 n ) log(n!) = (nlogn) B) In each of the following situations, indicate...

2. (30 pts.) Compare Growth Rates. In each of the following situations, indicate whether f = O(g), or f = (g), or both (in which case f = O(g)). Give a one sentence justification for each of your...

((6)0 = f 0.1. In each of the following situations, indicate whether f = O(g), or f = (g), or both (in which cas f (n) g (n) (a) n - 100 n - 200 (b) n1/2 n2/3 100n + log n n + (log n)2 n log n 10n...

((6) 0 = f 0.1. In each of the following situations, indicate whether f = O(g), or f = (9), or both (in which case f (n) g (n) (a) n - 100 n - 200 () n1/2 n 2/3 (c) 100n + log n n + (log n) 2 nlogn...

This about big-O Please explain clearly. Just want to see a,b k. Please show how you got the answer. Also dont use fill in calucation. Confused on how solving it. trying to use this method below to...

Q 3 :Prove or disprove 1 . 5 n 2 + 4 0 n + 1 0 0 = O ( n 2 ) . 2 . n 3 / 1 0 0 0 = O ( n 2 ) . 3 . f ( n ) = 2 . is f ( n ) = ( n 3 ) ? 4 . nk = ( 2 n ) 5 . = ( nlogn ) 6 . 7 n = ( 9 n ) Q 4 :In each...

Exercises 0.1. In each of the following situations, indicate whether f = 0(1), or f = (g), or both (in which case f = (g)) f(n) (a) n 100 (b) n1/2 (c) 100n +logn n(logn)2 (d) nlogn (e) log 2n (f)...

0.1. In each of the following situations, indicate whether f = O(g), or f (g), or both (in which case f f (n) (g)) g (n) n- 200 n2/3 (a) n- 100 (b) n1/2 (c) 100n+logn n+ (logn)2 (d) nlogn (e) log 2n...

B) In each of the following situations, indicate whether f = O(g), or f = (g), or both f = (g). (2 Pts.) f(n) = 100n + log n and g(n) = n + (log n) 2 . f(n) = n 1.01 and g(n) = n log n. f(n) = n 1/2...

Exercise 6 (3 pts) . In each of the following situations, indicate whether f = O ( g ), or f = ( g ), or both (in which case f = ( g ): f (n) g n) either O, or 12. or 10n lg(10n) n(lg n)2 2 nlgn...

For a graphite/ epoxy unidirectional lamina, following properties are available: E= 181 GPa, E= 10.5 GPa, G 7.2 GPa and U0.02. The lamina is subjected to the following loading conditions: 04 MPa, 0-4...

Show how you would accomplish the following synthetic transformations. You may use any necessary reagents. (a) N-ethylbenzamide benzylethylamine (b) Ethyl benzoate N-ethylbenzamide (c) Pyrrolidine ...

6. (True/False): The CALL instruction pushes the offset of the instruction following the CALL on the stack.

Compared with half a century ago, adoption has become _ _ _ _ _ _ _ _ _ common, but it is more open and acceptabl e , so we probably discuss it _ _ _ _ _ _ _ . fill in the blanks more or much less or...

6. Current training methods allow limited time for practice, feedback, and assessment.

7. Use of new technology fits into the organizational culture or business strategy.

5. Employees have a difficult time attending scheduled training programs.