Solve the recurrence relation: T(n) = 3T(n-1) + 2, T(1) = 1.
Solve the recurrence relation: T(n) = 3T(n-1) + 2, T(1) = 1.
From the BPSC Assistant Programmer (CSE) December 2021 – Written exam, question 18 of 25.
More from this paper
- Previous: Write a program in C/Java to find out the factorial of a number using recursion also write its iterative program.
- Next: Consider a magnetic disk consisting of 16 heads and 400 cylinders. This disk has four 100-cylinder zones with the cylinders in different…
- All questions in BPSC Assistant Programmer (CSE) December 2021 – Written