Back to the 2023 paper
Similar questions
Design and Analysis of Algorithms State master's theorem and find the time complexity for the following recurrence: T(n) = 2T(n^{1/2}) + \log n20227mDesign and Analysis of Algorithms Apply the Master Theorem to determine the time complexity of the following recurrence relations. (i) T(n) = 4T(n/2) + n^3 (ii) T(n) = T(n/2) + 2^n20235mDesign and Analysis of Algorithms What is the Master's Theorem? State the general form and the three cases of the theorem. Use it to solve the following recurrence relations: (i) T(n) = 2T(n/2) + n (ii) T(n) = 3T(n/2) + n^2 (iii) T(n) = 2T(n/2) + n/\log n Explain which case applies in each situation.20247mDesign and Analysis of Algorithms The recurrence T(n) = T(n/2) + 1 has a time complexity of: (i) O(n) (ii) O(\log n) (iii) O(n \log n) (iv) O(n^2)20242m
PreviousState the general Knapsack problem. Write a greedy algorithm for this problem and derive its time complexity.NextWhat is negative weight-cycle? Write Bellman-Ford algorithm to find single shortest distance of a directed graph.
Student FinanceWeb Platform
Pocketly — Personal Finance for Students
Keep your hostel and college expenses under control. Track accounts, log spending in seconds, and stay within your monthly budget.