CSE 374: Algorithms I Worksheet 4
Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: daixieit
CSE 374: Algorithms I
Worksheet 4
[Full marks 42]
Note: Worksheet problems are more like practice problems to hone your skills through better understanding the concepts. They are easier than homework problems. Solution to every problem should preferably be typed (or, very legibly written in hand on letter size pages). Plagiarism in any form will be strictly dealt with following departmental policy. You should try to solve by yourself as much as possible. You can take help of study materials and book resources and office hours.
1. For each of the following recurrences, give an expression for the runtime T (n) if the recurrence can be solved with the Master Theorem. Otherwise, indicate that the Master Theorem does not apply. Remember to show every step clearly. [21*2 = 42]
T(n) = 3T(n/2) + n2
T(n) = 4T(n/2) + n2
T(n) = T(n/2) + 2n
T(n) = 2'lT(n/2) + n'1
T(n) = 16T(n/4) + n
T(n) = 2T(n/2) + nlogn
T(n) = 4T(n/2) + logo
T(n) = 2T(n/2) + n/ logn
T(n) = 2T(n/4) + n051
T(n) = 0.5T(n/2) + l/n
T(n) = 16T(n/4) + n!
T(n) = \/2T(n/2) + logn
T(n) = 3T(n/2) + n
T(n) = 3T(n/4) + n log n
T(n) = 3T(n/3) + n/2
T(n)_6T(n/3) + n2 logn
T(n) = 4T(ti/2) + n/log n
T(n) = 64T(n/8) - n2 logn
2023-01-10