Question
Solve the following recurrence Using Recursion tree method
(i) T(n) = 3T(n/3) + n
(ii) T(n) = 2T(n/2) + n²
(iii) T(n) = T(n/2) + T(n/4) + T(n/8) + n
Answer :
Word Count : 206
For (i) (T(n)=3T(n/3)+n): At level 0, the cost is (n). At level 1, there are 3 subproblems of size (n/3), each contributing (n/3), so total cost is (3 \cdot (n/3)=n). At level 2, there are (3^2) subproblems of size (n/3^2), total ___ ______ ____ ____ ________ ________ ___.
__________ __________ ____ _______ ______ _____ ______ ____ ______ _________ ____ __________.
________ _______ _____ ______ ______.
_________ ____ _________ ________ _____ __________ _______ ____.
____ _____ ______ ____ _____.
__________ ___ __________ _________ _____ ________ _____ ________.
___ __________ ______ _______ _________ _____ _________ _____ ________ ____.
___ __________ ___ __________ __________ ____.
__________ _____ _____ _______ _______ ___.
__________ ________ ______ _____ ______ _________ _______ ______ _____ ______ ___.
_________ _____ _______ _____ ________ ___.
______ __________ __________ _______ _______ ______.
_________ __________ _________ __________ ___.
__________ _________ ____ _________ _________ ___ __________ ________ __________ ________.
______ _________ ______ __________ ___ ___ _________.
_______ ____ ___ ______ _________ ___ _______ _____ _______ ______ __________ ________.
____ ________ ____ ___ _____ ________ ___ __________.
__________ ____ ___ ___ _____ __________ ______ ________ _____ _________.
________ _____ _____ _______ ____ ________ ____ ______ ___ ____ _______ __________.
_____ ______ __________ ________ _______ ___ _________ ______.
____ ______ _____.
Get Full Answer on WhatsApp
For (i) (T(n)=3T(n/3)+n): At level 0, the cost is (n). At level 1, there are 3 subproblems of size (n/3), each contributing (n/3), so total cost is (3 \cdot (n/3)=n). At level 2, there are (3^2) subproblems of size (n/3^2), total ___ ______ ____ ____ ________ ________ ___.
__________ __________ ____ _______ ______ _____ ______ ____ ______ _________ ____ __________.
________ _______ _____ ______ ______.
_________ ____ _________ ________ _____ __________ _______ ____.
____ _____ ______ ____ _____.
__________ ___ __________ _________ _____ ________ _____ ________.
___ __________ ______ _______ _________ _____ _________ _____ ________ ____.
___ __________ ___ __________ __________ ____.
__________ _____ _____ _______ _______ ___.
__________ ________ ______ _____ ______ _________ _______ ______ _____ ______ ___.
_________ _____ _______ _____ ________ ___.
______ __________ __________ _______ _______ ______.
_________ __________ _________ __________ ___.
__________ _________ ____ _________ _________ ___ __________ ________ __________ ________.
______ _________ ______ __________ ___ ___ _________.
_______ ____ ___ ______ _________ ___ _______ _____ _______ ______ __________ ________.
____ ________ ____ ___ _____ ________ ___ __________.
__________ ____ ___ ___ _____ __________ ______ ________ _____ _________.
________ _____ _____ _______ ____ ________ ____ ______ ___ ____ _______ __________.
_____ ______ __________ ________ _______ ___ _________ ______.
____ ______ _____.
Get Full Answer on WhatsApp
Related Questions
Solve the following recurrence Using Recursion tree method
(i) T(n) = 3T(n/3) + n
(ii) T(n) = 2T(n/2) + n²
(iii) T(n) = T(n/2) + T(n/4) + T(n/8) + n
Binary search
Apply Kruskal's Algorithm on the following graph to find minimum cost spanning tree
) Merge sort
Binary sort
Q8. Explain DFS and BDS Graph traversal algorithms with the help of a suitable example.
Insertion sort
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★