GATE CS question library

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 $\text{1, 2, 3, 4, 5}$ in that order?

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

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 …

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

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

The rank of matrix $\begin{bmatrix} 0 & 0 & -3 \\ 9 & 3 & 5 \\ 3 & 1 & 1 \end{bmatrix}$ is:

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

The logic expression for the output of the circuit shown in figure below is:

The number of distinct simple graphs with up to three nodes is

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

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

Let $A$ and $B$ be real symmetric matrices of size $n \times n$. Then which one of the following is true?

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

For the initial state of $000$, the function performed by the arrangement of the $\text{J-K}$ flip-flops in figure is:

If the state machine described in figure should have a stable state, the restriction on the inputs is given by

An $\text{ISAM}$ (indexed sequential) file consists of records of size $64$ bytes each, including key field of size $14$ bytes. An address of a disk block takes $2$ bytes. If the disk block size is $512$ bytes and there are $16K$ records, compute the size of the data and index areas in terms of number blocks. How many levels of $\text{tree}$ do …

$\displaystyle \sum_{1\leq k\leq n} O(n)$, where $O(n)$ stands for order $n$ is:

The less-than relation, $<,$ on real number is

Let $A$ and $B$ be sets with cardinalities $m$ and $n$ respectively. The number of one-one mappings from $A$ to $B$, when $m < n$, is

Let A be a finite set of size n. The number of elements in the power set of $A\times A$ is: