1
GATE CSE 1990
Subjective
+2
-0
Express T(n) in terms of the harmonic number Hn = $$\sum\limits_{t = 1}^n {1/i,n \ge 1} $$ where T(n) satisfies the recurrence relation, T(n) = $${{n + 1} \over 2}$$ T(n-1) + 1, for $$n \ge 2$$ and T(1) = 1 What is the the asymptotic behavior of T(n) as a function of n?
2
GATE CSE 1987
Subjective
+2
-0
Solve the recurrence equations
T (n) = T (n - 1) + n
T (1) = 1
3
GATE CSE 1987
Subjective
+2
-0
What is the generating function G (z) for the sequence of Fibonacci numbers?
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12