Course Content

Other Courses

Tribhuvan university > CSIT - 2074 Syllabus > Design and Analysis of Algorithms > Old Questions > 2078(New Course)

Design and Analysis of Algorithms - Old Questions

Syllabus Notes Old Questions Unit Wise Questions Question Bank

4. Explain the recursion tree method for solving the recurrence relation. Solve following recurrence relation using using this method. T(n) = 2T(n/2)+1 for n>1, T(n) = 1 for n = 1 (2+3)

5 marks | Asked in 2078(New Course)