1
GATE CSE 1998
Subjective
+2
-0
Solve the following recurrence relation

$$\,\,\,\,\,\,\,{x_n} = 2{x_{n - 1}} - 1\,\,n > 1$$
$$\,\,\,\,\,\,\,{x_1} = 2$$

2
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
The recurrence relation $$\,\,\,\,\,$$ $$T\left( 1 \right) = 2$$
$$T\left( n \right) = 3T\left( {{n \over 4}} \right) + n$$ has the solution $$T(n)$$ equal to
A
$$O(n)$$
B
$$O$$ (log n)
C
$$O\left( {{n^{3/4}}} \right)$$
D
None of the above
3
GATE CSE 1994
MCQ (Single Correct Answer)
+2
-0.6
The number of substrings (of all length inclusive) that can be formed from a character string of length $$n$$ is
A
$$n$$
B
$${n^2}$$
C
$${{n\left( {n - 1} \right)} \over 2}$$
D
$${{n\left( {n + 1} \right)} \over 2}$$
4
GATE CSE 1989
Subjective
+2
-0
How many sub strings can be formed from a character string of length $$n$$?
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