Skip to content
Early access — you're among the first to try PYQLabs. Share feedback

GATE 1987 CSE & IT

18 questions across 1 session

PYQ 1

A square matrix is singular whenever:

Discrete Mathematics·MCQ·easy·✓ keyed
PYQ 2

A critical region is:

Operating Systems·MCQ·✓ keyed
PYQ 3

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

Data Structures·MCQ·easy·✓ keyed
PYQ 4

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

Operating Systems·MCQ·easy·✓ keyed
PYQ 5

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

Discrete Mathematics·MCQ·easy·✓ keyed
PYQ 6

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

Algorithms·OTHER·easy
PYQ 7

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

Algorithms·OTHER·easy
PYQ 8

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

Discrete Mathematics·OTHER·easy
PYQ 9

Let P be a quicksort program to sort numbers in ascending order. Let t 1 and t 2 be the time taken by the program for the inputs [1 2 3 4] and [5 4 3 2 1], respectively. Which of t...

Algorithms·MCQ·easy·✓ keyed
PYQ 10

(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 fun...

Discrete Mathematics·OTHER·medium
PYQ 11

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

Data Structures·MCQ·easy·✓ keyed
PYQ 12

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

Data Structures·MCQ·easy·✓ keyed
PYQ 13

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

Discrete Mathematics·MCQ·easy·✓ keyed
PYQ 14

FORTRAN is:

Theory of Computation·MCQ·✓ keyed
PYQ 15

Give minimal $$DFA$$ that performs as a Mod-$$3$$ $$1's$$ counter, i.e., outputs a $$1$$ each time the number of $$1's$$ in the input sequence is a sequence is a multiple of $$3.$$

Theory of Computation·OTHER·easy
PYQ 16

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

Theory of Computation·OTHER·easy
PYQ 17

A context-free grammar is ambiguous if:

Theory of Computation·MCQ·easy·✓ keyed
PYQ 18

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

Algorithms·OTHER·medium