GATE CSE 1987

## GATE CSE

Solve the recurrence equations
T (n) = T (n - 1) + n
T (1) = 1

View Question What is the generating function G (z) for the sequence of Fibonacci numbers?

View Question Let P be a quicksort program to sort numbers in ascending order. Let t1 and t2 be the time taken by the program for the

View Question Find a solution to the following recurrence equation
T(n) = T(n - 1)+ n
T(1) = 1

View Question In a circular linked list organization,insertion of a record involves modification of :

View Question It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given.

View Question If the no of leaves in a tree is not a power of 2,then the tree is not a binary tree.

View Question (a) How many binary relations are there on a set A with n elements?
(b) How many one - to - one functions are there from

View Question State whether the following statement are TRUE or FALSE:
(a) The union of two equivalence relations is also an equivale

View Question (a) Solve the recurrence equations
$$\,\,\,\,\,\,\,\,\,T\left( n \right) = T\left( {n - 1} \right) + n$$
$$\,\,\,\,\,\,

View Question A square matrix is singular whenever:

View Question If a, b and c are constants, which of the following is a linear inequality?

View Question A critical region is:

View Question On receiving an interrupt from an $${\rm I}/O$$ device the $$CPU$$:

View Question Give minimal $$DFA$$ that performs as a Mod-$$3$$ $$1's$$ counter, i.e., outputs a $$1$$ each time the number of $$1's$$

View Question Give the regular expression over $${\left\{ {0,\,\,1} \right\}}$$ to denote the set of proper non-null substrings of the

View Question A context-free grammar is ambiguous if:

View Question FORTRAN is:

View Question