(15 pts) Solve the following recurrence and express your solution using asymptotic notations (O, Ω or...

Question

Question

(15 pts) Solve the following recurrence and express your solution using asymptotic notations (O, Ω or Ѳ)

(a)T(n) = 2T(n/3) + n‐1

(b)T(n) = 3T(n/2) + 2n

(c)T(n) = 4T(n/2) + n2

engineering Computer-Science

Answer 1

Answer #1

a)


b)


c)

Answer 2

Similar Homework Help Questions

3. Determine the asymptotic complexity of the function defined by the recurrence relation. Justify your solution...

3. Determine the asymptotic complexity of the function defined by the recurrence relation. Justify your solution using expansion/substitution and upper and/or lower bounds, when necessary. You may not use the Master Theorem as justification of your answer. Simplify and express your answer as O(n*) or O(nk log2 n) whenever possible. If the algorithm is exponential just give exponential lower bounds c) T(n) T(n-4) cn, T(0) c' d) T(n) 3T(n/3) c, T() c' e) T(n) T(n-1)T(n-4)clog2n, T(0) c' 3. Determine the...
(1) (1) (a) (14 pts.) Solve the following recurrence relation with the method of the charac-...

(1) (1) (a) (14 pts.) Solve the following recurrence relation with the method of the charac- teristic equation: T(n) = 4T(n/2) + (n/2), for n > 1, n a power of 2 T(1) = 1 Determine the coefficients. (b) (1 PT.) What is the big O) order of the solution as a function of n? (c) (5 PTS.) Verify your solution by substituting back in the recurrence relation. (ii) (10 PTS.) Solve using the method of the characteristic equation to...
Solve the following recurrences. You only need to derive the asymptotic solution (in 0) 2. T(n) =...

Solve the following recurrences. You only need to derive the asymptotic solution (in 0) 2. T(n) = 3T(1) + TRT, T(1) = 1. Solve the following recurrences. You only need to derive the asymptotic solution (in 0) 2. T(n) = 3T(1) + TRT, T(1) = 1.

Using the Master Theorem discussed in class, solve the following recurrence relations asymptotically. Assume T(1) =...

Using the Master Theorem discussed in class, solve the following recurrence relations asymptotically. Assume T(1) = 1 in all cases. (a) T(n) = T(9n/10) + n (b) T(n) = 16T(n/4) + n^2 (c) T(n) = 7T(n/3) + n^2 (d) T(n) = 7T(n/2) + n^2 (e) T(n) = 2T(n/4) + √n log^2n.
2. Asymptotic Notation (8 points) Show the following using the definitions of O, Ω, and Θ....

2. Asymptotic Notation (8 points) Show the following using the definitions of O, Ω, and Θ. (1) (2 points) 2n 3 + n 2 + 4 ∈ Θ(n 3 ) (2) (2 points) 3n 4 − 9n 2 + 4n ∈ Θ(n 4 ) (Hint: careful with the negative number) (3) (4 points) Suppose f(n) ∈ O(g1(n)) and f(n) ∈ O(g2(n)). Which of the following are true? Justify your answers using the definition of O. Give a counter example if...
19. Solve the following recurrence equations using the characteristic equation o) T(n)2T(3o n> 1, n a powver of 3...

19. Solve the following recurrence equations using the characteristic equation o) T(n)2T(3o n> 1, n a powver of 3 T(1) 0 (b) T(n)-0n> 1, n a per of 5 T(1) =0 (c) nT (n)- (n 1)T(n-1)+3 for > 1 T (1) 1 (d) 'aT (n) = 3 (n-1 )T (n-1)-2 (n-2)T (n-2) + 4n T (0) = 0 T(1)=0 for n > 1 ##Solve for D only 19. Solve the following recurrence equations using the characteristic equation o) T(n)2T(3o n>...

Solve the following recurrence relations and give a Θ bound for each of them. (a) T(n)...

Solve the following recurrence relations and give a Θ bound for each of them. (a) T(n) = T(n − 1) + 2n (assume T(0) = 0) (b) T(n) = 2T(n − 1) + c (assume T(0) = 0) (c) T(n) = 2T(n/3) + n (assume T(1) = 1)
d. (4 pts) Fill in the asymptotic complexity (not the exact solution) of the work represented...

d. (4 pts) Fill in the asymptotic complexity (not the exact solution) of the work represented by the following summations for an input of size n. Write complexities in simplest form. ) (1) Ź 2' = 01 — (3) Z(64) = 01_ (2) (Si +5) = 01 - (4) I"3n =01_ logn ) ) e. (5 points) Consider the recurrence T(n) = 4T(n/2) +n , T(2) = 8. and a proposed closed-form solution T(n) = n² + 2n Suppose we...
Solve the following recurrence relation without using the master method! report the big O 1. T(n)...

Solve the following recurrence relation without using the master method! report the big O 1. T(n) = 2T(n/2) =n^2 2. T(n) = 5T(n/4) + sqrt(n)

Solve the recurrence relation T(n) = 2T(n / 2) + 3n where T(1) = 1 and...

Solve the recurrence relation T(n) = 2T(n / 2) + 3n where T(1) = 1 and k n = 2 for a nonnegative integer k. Your answer should be a precise function of n in closed form. An asymptotic answer is not acceptable. Justify your solution.