ExamSIDE
Questions (Powered by ExamGOAL)
Algorithms
Complexity Analysis and Asymptotic Notations
Marks 1Marks 2
Searching and Sorting
Marks 1Marks 2
Divide and Conquer Method
Marks 1Marks 2
Greedy Method
Marks 1Marks 2
P and NP Concepts
Marks 1Marks 2
Dynamic Programming
Marks 1Marks 2
Previous
1
GATE CSE 1987
Subjective
+2
-0
What is the generating function G (z) for the sequence of Fibonacci numbers?
2
GATE CSE 1987
Subjective
+2
-0
Solve the recurrence equations
T (n) = T (n - 1) + n
T (1) = 1
Previous
Questions Asked from Marks 2
GATE CSE 2024 Set 1 (1) GATE CSE 2023 (1) GATE CSE 2022 (1) GATE CSE 2021 Set 2 (1) GATE CSE 2021 Set 1 (1) GATE CSE 2019 (1) GATE CSE 2016 Set 2 (1) GATE CSE 2015 Set 3 (1) GATE CSE 2015 Set 1 (2) GATE CSE 2013 (1) GATE CSE 2011 (1) GATE CSE 2008 (5) GATE CSE 2007 (3) GATE CSE 2005 (3) GATE CSE 2004 (4) GATE CSE 2003 (1) GATE CSE 2002 (2) GATE CSE 2000 (1) GATE CSE 1994 (1) GATE CSE 1993 (1) GATE CSE 1990 (1) GATE CSE 1987 (2)
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