GATE 1994 CSE & IT

Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence 1, 2, 3, 4, 5 in that order?

The number of distinct simple graph with upto three nodes is

Let A and B be any two arbitrary events, then, which one of the following is true?

State True or False with reason. There is always a decomposition into Boyce-codd normal form $$(BCNF)$$ that is lossless and dependency preserving.

An unrestricted use of the "goto" statement is harmful because

Linked lists are not suitable data structures of which one of the following problems?

An instance of a relational scheme R(A, B, C) has distinct values for attribute A. Can you conclude that A is a candidate key for R?

The number of substrings (of all length inclusive) that can be formed from a character string of length $$n$$ is

Generation of intermediate code based on an abstract machine model is useful in compilers because

If A and B are real symmetric matrices of size n x n. Then, which one of the following is true?

In which one of the following cases is it possible to obtain different results for call-by-reference and call-by-name parameter passing methods?

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when

Which one of the following statements is false?

The recurrence relation that arises in relation with the complexity of binary search is:

Conside the following two functions: $${g_1}(n) = \left\{ {\matrix{ {{n^3}\,for\,0 \le n < 10,000} \cr {{n^2}\,for\,n \ge 10,000} \cr } } \right.$$ $${g_2}(n) = \left\{ {\matrix{ {...

Let $$p$$ and $$q$$ be propositions. Using only the truth table decide whether $$p \Leftrightarrow q$$ does not imply $$p \to \sim q$$ is true or false.

In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size n $$\times$$ n, non-zero elements (i.e...

The inverse of the matrix $$\left[ {\matrix{ 1 & 0 & 1 \cr { - 1} & 1 & 1 \cr 0 & 1 & 0 \cr } } \right]$$ is

The rank of the matrix $$\left[ {\matrix{ 0 & 0 & { - 3} \cr 9 & 3 & 5 \cr 3 & 1 & 1 \cr } } \right]$$ is

Give a relational algebra expression using only the minimum number of operators from $$\left( { \cup ,\, - } \right)$$ which is equivalent to $$R \cap S$$.

Some group (G, o) is known to be abelian. Then, which one of the following is true for G?

Which of the following conversions is not possible (algorithmically)?

Which of the following features cannot be captured by context-free grammars?

Given that language $${L_1}$$ is regular and that the language $${L_1} \cap {L_2}$$ is regular is the language $${L_2}$$ is always regular?

The number of sub-strings (of all lengths inclusive) that can be formed from a character string of length $$n$$ is

State True or False with one line explanation: A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).