ExamSIDE.Com

© ExamSIDE.Com 2019

About Us Privacy Policy

GATE CSE 1987 Question

Subjective Type Answer by Yourself
Solve the recurrence equations
T (n) = T (n - 1) + n
T (1) = 1

GATE CSE 1987 Question

Subjective Type Answer by Yourself
What is the generating function G (z) for the sequence of Fibonacci numbers?

GATE CSE 1990 Question

Subjective Type Answer by Yourself
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?

GATE CSE 1993 Question

Signle Correct Answer
$$\sum\limits_{1 \le k \le n} {O(n)} $$ where O(n) stands for order n is:
A
O(n)
B
O(n2)
C
O (m3)
D
O(3n2)

Share