GATE CSE 1994


Q1.

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 elements of lower triangle) of each row are stored one after another, starting from the first row, the index of the (i, j)^{th} element of the lower triangular matrix in this new representation is:
GateOverflow

Q2.

Consider the following two functions: g_1(n) = \begin{cases} n^3 \text{ for } 0 \leq n \leq 10,000 \\ n^2 \text{ for } n \geq 10,000 \end{cases}g_2(n) = \begin{cases} n \text{ for } 0 \leq n \leq 100 \\ n^3 \text{ for } n > 100 \end{cases}Which of the following is true?
GateOverflow

Q3.

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

Q4.

Which of the following statements is false?
GateOverflow

Q5.

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

Q6.

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

Q7.

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

Q8.

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

Q9.

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

Q10.

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