Professional Documents
Culture Documents
CS15102 - Advanced Algorithms - Assignments AOA1
CS15102 - Advanced Algorithms - Assignments AOA1
CS15102 - Advanced Algorithms - Assignments AOA1
List of Assignments
Instructions:
• All assignments must be submitted by hand written. You have to submit scan copy of the assignments.
• File name: Make a zip/rar file or a single PDF file with the name similar as
“B180015_Assignment_XYZ”, where B180015 indicates your roll number. Similarly, the student with
roll number B180028 will make the file name as “B180028_Assignment_XYZ”. Here, “XYZ”
indicates first three letters of assignment code, e.g., “AVL”, “STM”, etc.
• Submit the assignment through Google class only.
Analysis of Algorithms
Assignment AOA1: Solve the following recurrence relations using Masters Theorem. Consider T(1) = c.
1. T(n) = 2T(n/4) + n0.51
2. T(n) = 3T(n/4) + n log n
3. T(n) = 6T(n/3) + n2 log n
4. T(n) = 0.5T(n/2) + 1/n
5. T(n) = 2T(n/4) + √3
6. T(n) = √2T(n/2) + log n