GATE CSE 1989
View Questions

GATE CSE

1
The transitive closure of the relation
$$\left\{ {\left( {1,2} \right)\left( {2,3} \right)\left( {3,4} \right)\left( {5,4} \right)} \right\}$$
on the set $$A = \left\{ {1,2,3,4,5} \right\}$$ is ________ .
2
How many sub strings can be formed from a character string of length $$n$$?
3
Which of the following graphs is / are planar? (see fig.) GATE CSE 1989 Discrete Mathematics - Graph Theory Question 30 English
4
Match the pairs in the following question.

List - $${\rm I}$$
$$(A)$$$$\,\,\,\,$$ Virtual Memory
$$(B)$$$$\,\,\,\,$$ Shared memory
$$(C)$$$$\,\,\,\,$$ Look-ahead buffer
$$(D)$$$$\,\,\,\,$$ Look-aside buffer

List - $${\rm II}$$
$$(p)$$$$\,\,\,\,$$ Temporal locality
$$(q)$$$$\,\,\,\,$$ Spatial Locality
$$(r)$$$$\,\,\,\,$$ Address Translation
$$(s)$$$$\,\,\,\,$$ Mutual exclusion

5
Disk requests come to disk driver for cylinders $$10,22,20,2,40,56$$ and $$38,$$ in that order at a time when the disk drive is reading from cylinder $$20.$$ The seek time is $$6msec$$ per cylinder. Compute the total seek time if the disk arm scheduling algorithm is
(a) First come first served
(b) Closest cylinder next.
6
In which of the following cases it is possible to obtain different results for call-by-reference and call-by-name parameter passing?
7
An unrestricted use of the "goto" statement is harmful because of which of the following reason(s):
8
How many substrings (of all lengths inclusive ) can be formed from a character string of length $$n$$? Assume all characters to be distinct. Prove your answer.
9
Is the class of regular sets closed under infinite union? Explain.
10
Context free languages and regular languages are both closed under the operation(s) of :
11
Which of the following problems are un-decidable?
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12