Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
Aptitude | GATE CS 1998 | Question 60
Last Updated :
Discuss
Comments
Solve the following recurrence relation:
xn = 2xn-1 -1, n>1 x1 = 2
This question is part of this quiz :
Top MCQs on Complexity Analysis of Algorithms with Answers,GATE CS 1998Share your thoughts in the comments
GeeksforGeeks