1
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?
$$\,\,\,\,\,\,\,\,\,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?
Questions Asked from Marks 2
GATE CSE 2023 (1) GATE CSE 2020 (1) GATE CSE 2016 Set 1 (1) GATE CSE 2014 Set 2 (1) GATE CSE 2014 Set 1 (2) 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
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