1
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
$$T\left( n \right) = 3T\left( {{n \over 4}} \right) + n$$ has the solution $$T(n)$$ equal to
2
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
3
GATE CSE 1989
Subjective
+2
-0
How many sub strings can be formed from a character string of length $$n$$?
4
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$$
$$\,\,\,\,\,\,\,\,\,\,T\left( n \right) = \left( {{n \over 2}} \right) + 1$$
$$\,\,\,\,\,\,\,\,\,\,\,T\left( 1 \right) = 1$$
Questions Asked from Combinatorics (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2014 Set 1 (2)
GATE CSE 2014 Set 2 (1)
GATE CSE 2008 (5)
GATE CSE 2007 (2)
GATE CSE 2006 (3)
GATE CSE 2005 (3)
GATE CSE 2004 (3)
GATE CSE 2001 (1)
GATE CSE 1999 (1)
GATE CSE 1998 (2)
GATE CSE 1996 (1)
GATE CSE 1994 (1)
GATE CSE 1989 (1)
GATE CSE 1988 (1)
GATE CSE 1987 (1)
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude