GATE CS 2024 Set 2 — Question 15
MCQ+1 / -0.33MediumRecurrence RelationsSets & CombinatoricsEngineering Mathematics
Engineering Mathematics → Sets & Combinatorics → Recurrence Relations
Last updated
Question
Let be the recurrence relation defined as follows:,
, and
for .Which one of the following statements is TRUE?
, and
for .Which one of the following statements is TRUE?
A.
B.
C.
D.
Correct answer
(A) T(n) = Θ(2ⁿ)
Solution
The given recurrence relation is a linear homogeneous recurrence relation with constant coefficients: .
From the first equation, .
Substitute into the second: .
Then .
1.Find the characteristic equation:
The characteristic equation is .2.Solve for the roots:
.3.Write the general solution:
.4.Use initial conditions to find constants:
- For :
- For :
From the first equation, .
Substitute into the second: .
Then .
5.Final expression for :
.6.Determine asymptotic complexity:
Since , it follows that .Thus, option (A) is correct.More questions on Sets & Combinatorics
2024 Set 2 Q3In an engineering college of 10,000 students, 1,500 like neither their core branches nor other…2024 Set 1 Q11Let be a function such that…2024 Set 2 Q12Let and be the following propositions: : Fail grade can be given. : Student scores…2024 Set 1 Q12The product of all eigenvalues of the matrix…2024 Set 1 Q14Consider a permutation sampled uniformly at random from the set of all permutations of…
Practice GATE CS PYQs with adaptive difficulty
Timed practice, skill tracking, and AI explanations — free to start.
Start practicing free