GATE CS 2024: Recurrence Relation T(n) | Asymptotic Analysis Solution

```

Computer Sciences > GATE 2024 Set-2 > Recurrence Relations

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?

A

T(n) = Θ(2ⁿ)

B

T(n) = Θ(n2ⁿ)

C

T(n) = Θ(3ⁿ)

D

T(n) = Θ(n3ⁿ)

Correct : c

Similar Questions

Consider the following recurrence relation: Which one of the following options is CORRECT?

#878 MCQ

Let an represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for an?

#1134 MCQ

Consider the following recurrence relation:T(n)=2T(n-1)+n2n for n>0, T(0)=1.Which ONE of the following options is CORRECT?

#1363 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......