edited by
444 views
1 votes
1 votes

Which of the following theorems can solve all Recurrence Relations?

  1. Mater Tehorem
  2. Akra-Bazzi Theorem
  3. Both [A] and [B]
  4. Akra-Bazzi can be applied to some cases but not for all.
edited by

2 Answers

Best answer
1 votes
1 votes
Akra bazzi is the answer. As master theorem can not be applied everywhere
selected by
1 votes
1 votes
Akra-Bazzi method isn't applicable to recurrences that don't involve divide and conquer.

I think Option D is more appropriate.
Answer:

Related questions

0 votes
0 votes
1 answer
1
Bikram asked May 26, 2017
463 views
The cost of optimal binary search tree for the identifier set $(a1, a2, a3) =$ (do, if, while) with $p(1) = 0.3, \ p(2) = 0.2, $ $p(3) = 0.15, q (0) = 0.05, q(1) = 0.15...
2 votes
2 votes
2 answers
3
Bikram asked May 26, 2017
341 views
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest pat...
1 votes
1 votes
2 answers
4
Bikram asked May 26, 2017
454 views
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.