GATE CSE 1989

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.

The transitive closure of the relation <br>$$\left\{ {\left( {1,2} \right)\left... How many sub strings can be formed from a character string of length$$n$$? Which of the following graphs is / are planar? (see fig.) <img class="question... Operating Systems Match the pairs in the following question. <p><b>List -$${\rm I}$$</b> <br>$$(A...
Disk requests come to disk driver for cylinders $$10,22,20,2,40,56$$ and $$38,$$...

Programming Languages

In which of the following cases it is possible to obtain different results for c...
An unrestricted use of the <b>"goto"</b> statement is harmful because of which o...

Theory of Computation

How many substrings (of all lengths inclusive ) can be formed from a character s...
Is the class of regular sets closed under infinite union? Explain.
Context free languages and regular languages are both closed under the operation...
Which of the following problems are un-decidable?