Computer Sciences > GATE 2026 SET-1 > Recurrence Relations
Consider the following recurrence relations:
For all n > 1,
T1(n) = 4T1(n/2) + T2(n)
T2(n) = 5T2(n/4) + Θ(log2n)
Assume that for all n ≤ 1, T1(n) = 1 and T2(n) = 1.
Which one of the following options is correct?
For all n > 1,
T1(n) = 4T1(n/2) + T2(n)
T2(n) = 5T2(n/4) + Θ(log2n)
Assume that for all n ≤ 1, T1(n) = 1 and T2(n) = 1.
Which one of the following options is correct?
Correct : a
Similar Questions
Consider the following recurrence relation:
Which one of the following options is CORRECT?
Let T(n) be the recurrence relation defined as follows: T(0) = 1, T(1) = 2, and T(n) = 5T(n-1) - 6T(n-2) for n ≥ 2 Which one of the following statements is TRUE...
Let an represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for an?
Total Unique Visitors
Loading......