1
GATE CSE 1989
Subjective
+2
-0
How many sub strings can be formed from a character string of length $$n$$?
2
GATE CSE 1988
Subjective
+2
-0
Solve the recurrence equations:
$$\,\,\,\,\,\,\,\,\,\,T\left( n \right) = \left( {{n \over 2}} \right) + 1$$
$$\,\,\,\,\,\,\,\,\,\,\,T\left( 1 \right) = 1$$
3
GATE CSE 1987
Subjective
+2
-0
(a) Solve the recurrence equations
$$\,\,\,\,\,\,\,\,\,T\left( n \right) = T\left( {n - 1} \right) + n$$
$$\,\,\,\,\,\,\,\,\,T\left( 1 \right) = 1T$$
(b) What is the generating function?
$$\,\,\,\,\,\,\,\,\,G\left( z \right)$$ 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
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12