1
GATE CSE 1994
+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}$$
2
GATE CSE 1989
Subjective
+2
-0
How many sub strings can be formed from a character string of length $$n$$?
3
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$$
4
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
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization
EXAM MAP
Joint Entrance Examination