Scribd
Upload
101 views

Ada Assignment - 1

The document contains 12 problems related to analyzing the asymptotic behavior of algorithms and solving recurrence relations using different methods. It asks the student to arrange functions by growth rate, determine Big O, Big Theta, and Big Omega notation, use the Master Method to solve divide-and-conquer recurrences, and apply substitution and iteration methods to solve linear recurrence relations.

Uploaded by

Aksh Patel
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
101 views

Ada Assignment - 1

The document contains 12 problems related to analyzing the asymptotic behavior of algorithms and solving recurrence relations using different methods. It asks the student to arrange functions by growth rate, determine Big O, Big Theta, and Big Omega notation, use the Master Method to solve divide-and-conquer recurrences, and apply substitution and iteration methods to solve linear recurrence relations.

Uploaded by

Aksh Patel
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment -1

1. Arrange following rate of growth in increasing order.


2n, nlgn, n2, 1, n, lgn, n!, n3, nn, n!, √𝑛

2. Find big oh(Ο) notation for following:


a) f(n) = 6993 b) f(n) = 6n2 + 135

3. Find big theta(Ө) and big omega(Ω) notation.


a) f(n) = 14 * 7 + 83. b) f(n) = 83n3 + 84n

4. Let f(n) and g(n) be asymptotically positive functions. Prove following.


f(n) + g(n) = Θ(max(f(n), g(n))).

5. Prove that (n + a)b = Ө( nb) , b>0

6. Is 2n+1 = Ο(2n) ? Explain.

7. Is 22n = Ο(2n) ? Explain.

8. Prove that (lgn)lgn = Ω(n3/2)

9. Prove that lg(n!) = Ө(nlgn)

10. Find order of growth using Master Method


(a) T (n) = 9T(n/3) + n (h) T(n) = 7T(n/2) + n2
(b) T (n) = T (2n/3) + 1 (i) T(n) = 3T(n/2) + n
(c) T (n) = 4T(n/2) + n2 (j) T(n) = 3T(n/3) + √n
(d) T (n) = 4T(n/2) + n3 (k) T(n) = 3T(n/3) + n/2
(e) T(n) = 2T(n/2) + n3 (l) T(n) = 2T(n/4) + n0.51
(f) T(n) = T(9n/10) + n (m) T(n) = 16T(n/4) + n!
(g) T (n) = 7T(n/3) + n2 (n) T(n) = 6T(n/3) + n2lgn

11. Solve following recurrence equations using substitution method.

(a) T(n) = 2T(n/2) + n , T(1) = 1 (c) T(n) = 2T(√𝑛) + lgn


(b) T(n) = T(n-1) + n

12. Solve following recurrence equations using iteration method.


(a) T(n) = 3T(n-2), T(1) = 1 (d) T(n) = T(n-1) + 2, T(0) = 1
(b) T(n) = 2T(n/2) + n , T(1) = 1 (e) T(n) = T(n-1) + n , T(0) = 0
(c) T(n) = 2T(n-1) + 1, T(1) = 1

You might also like