The Gateway to Computer Science Excellence

0 votes

Solve the following recursions ( in terms of Θ ).

T(0) = T(1) = Θ(1) in all of the following.

- $T(n) = n + \frac{1}{n}\sum_{i=0}^{i=n-1}T(i)$
- $T(n) = n + \frac{2}{n}\sum_{i=0}^{i=n-1}T(i)$
- $T(n) = n + \frac{4}{n}\sum_{i=0}^{i=n/2}T(i)$
- $T(n) = n + \frac{40}{n}\sum_{i=0}^{i=n/5}T(i)$

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,648 questions

56,429 answers

195,206 comments

99,915 users