Data Structures and Algorithms

Assignment 2 Feb-Jun 2023

Total marks: 100

1. Solve the following recurrence relation using the Master Method:

(a) (10 points) T (n) = 2T (n/2) + n2 log n
(b) (10 points) T (n) = 4T (n/3) + n2
(c) (10 points) T (n) = 3T (n/4) + n3/2 log n
√
(d) (10 points) T (n) = 2T (n/4) + n log n
(e) (10 points) T (n) = 5T (n/5) + n

2. (a) (10 points) T (n) = T (n/3) + T (2n/3) + n

(b) (10 points) T (n) = T (n/2) + T (n/4) + n
√
(c) (10 points) T (n) = 3T (n/4) + n
(d) (10 points) T (n) = 2T (n/3) + T (n/9) + n
(e) (10 points) T (n) = T (n − 1) + n2