GATE CSE 1987

Exam Held on Thu Jan 01 1970 00:00:00 GMT+0000 (Coordinated Universal Time)
Click View All Questions to see questions one by one or you can choose a single question from below.

Algorithms

Solve the recurrence equations<br/> T (n) = T (n - 1) + n<br/> T (1) = 1<br/>
What is the generating function G (z) for the sequence of Fibonacci numbers?
Let P be a quicksort program to sort numbers in ascending order. Let t<sub>1</su...
Find a solution to the following recurrence equation<br/> T(n) = T(n - 1)+ n<br/...

Data Structures

In a circular linked list organization,insertion of a record involves modificati...
If the no of leaves in a tree is not a power of 2,then the tree is not a binary ...
It is possible to construct a binary tree uniquely whose pre-order and post-orde...

Discrete Mathematics

State whether the following statement are TRUE or FALSE: <br>(a) The union of ...
(a) How many binary relations are there on a set A with n elements? <p>(b) How m...
(a) Solve the recurrence equations <br>$$\,\,\,\,\,\,\,\,\,T\left( n \right) = ...
A square matrix is singular whenever:
If a, b and c are constants, which of the following is a linear inequality?

Operating Systems

A critical region is:
On receiving an interrupt from an $${\rm I}/O$$ device the $$CPU$$:

Theory of Computation

Give the regular expression over $${\left\{ {0,\,\,1} \right\}}$$ to denote the ...
Give minimal $$DFA$$ that performs as a Mod-$$3$$ $$1's$$ counter, i.e., outputs...
A context-free grammar is ambiguous if:
FORTRAN is:

EXAM MAP

Joint Entrance Examination

JEE Advanced JEE Main

Graduate Aptitude Test in Engineering

GATE CSE GATE EE GATE ECE GATE ME GATE CE GATE PI GATE IN